Log in

Relevant bibliographies by topics / Data approximation / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Data approximation.

Dissertations / Theses on the topic 'Data approximation'

Author: Grafiati

Published: 7 December 2024

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Data approximation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Ross, Colin. "Applications of data fusion in data approximation." Thesis, University of Huddersfield, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.247372.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Deligiannakis, Antonios. "Accurate data approximation in constrained environments." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2681.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2005.<br>Thesis research directed by: Computer Science. Title from abstract of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

3

Tomek, Peter. "Approximation of Terrain Data Utilizing Splines." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236488.

Full text

Abstract:

Pro optimalizaci letových trajektorií ve velmi malé nadmorské výšce, terenní vlastnosti musí být zahrnuty velice přesne. Proto rychlá a efektivní evaluace terenních dat je velice důležitá vzhledem nato, že čas potrebný pro optimalizaci musí být co nejkratší. Navyše, na optimalizaci letové trajektorie se využívájí metody založené na výpočtu gradientu. Proto musí být aproximační funkce terenních dat spojitá do určitého stupne derivace. Velice nádejná metoda na aproximaci terenních dat je aplikace víceroměrných simplex polynomů. Cílem této práce je implementovat funkci, která vyhodnotí dané teren

APA, Harvard, Vancouver, ISO, and other styles

4

Cao, Phuong Thao. "Approximation of OLAP queries on data warehouses." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00905292.

Full text

Abstract:

We study the approximate answers to OLAP queries on data warehouses. We consider the relative answers to OLAP queries on a schema, as distributions with the L1 distance and approximate the answers without storing the entire data warehouse. We first introduce three specific methods: the uniform sampling, the measure-based sampling and the statistical model. We introduce also an edit distance between data warehouses with edit operations adapted for data warehouses. Then, in the OLAP data exchange, we study how to sample each source and combine the samples to approximate any OLAP query. We next c

APA, Harvard, Vancouver, ISO, and other styles

5

Lehman, Eric (Eric Allen) 1970. "Approximation algorithms for grammar-based data compression." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87172.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.<br>Includes bibliographical references (p. 109-113).<br>This thesis considers the smallest grammar problem: find the smallest context-free grammar that generates exactly one given string. We show that this problem is intractable, and so our objective is to find approximation algorithms. This simple question is connected to many areas of research. Most importantly, there is a link to data compression; instead of storing a long string, one can store a small grammar that generates i

APA, Harvard, Vancouver, ISO, and other styles

6

Hou, Jun. "Function Approximation and Classification with Perturbed Data." The Ohio State University, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1618266875924225.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zaman, Muhammad Adib Uz. "Bicubic L1 Spline Fits for 3D Data Approximation." Thesis, Northern Illinois University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10751900.

Full text

Abstract:

<p> Univariate cubic <i>L</i><sup>1</sup> spline fits have been successful to preserve the shapes of 2D data with abrupt changes. The reason is that the minimization of <i>L</i><sup>1</sup> norm of the data is considered, as opposite to <i>L</i><sup>2</sup> norm. While univariate <i>L</i><sup>1</sup> spline fits for 2D data are discussed by many, bivariate <i>L</i><sup>1</sup> spline fits for 3D data are yet to be fully explored. This thesis aims to develop bicubic <i>L</i><sup>1</sup> spline fits for 3D data approximation. This can be achieved by solving a bi-level optimization problem. One l

APA, Harvard, Vancouver, ISO, and other styles

8

Cooper, Philip. "Rational approximation of discrete data with asymptotic behaviour." Thesis, University of Huddersfield, 2007. http://eprints.hud.ac.uk/id/eprint/2026/.

Full text

Abstract:

This thesis is concerned with the least-squares approximation of discrete data that appear to exhibit asymptotic behaviour. In particular, we consider using rational functions as they are able to display a number of types of asymptotic behaviour. The research is biased towards the development of simple and easily implemented algorithms that can be used for this purpose. We discuss a number of novel approximation forms, including the Semi-Infinite Rational Spline and the Asymptotic Polynomial. The Semi-Infinite Rational Spline is a piecewise rational function, continuous across a single knot, a

APA, Harvard, Vancouver, ISO, and other styles

9

Schmid, Dominik. "Scattered data approximation on the rotation group and generalizations." Aachen Shaker, 2009. http://d-nb.info/995021562/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

McQuarrie, Shane Alexander. "Data Assimilation in the Boussinesq Approximation for Mantle Convection." BYU ScholarsArchive, 2018. https://scholarsarchive.byu.edu/etd/6951.

Full text

Abstract:

Many highly developed physical models poorly approximate actual physical systems due to natural random noise. For example, convection in the earth's mantle—a fundamental process for understanding the geochemical makeup of the earth's crust and the geologic history of the earth—exhibits chaotic behavior, so it is difficult to model accurately. In addition, it is impossible to directly measure temperature and fluid viscosity in the mantle, and any indirect measurements are not guaranteed to be highly accurate. Over the last 50 years, mathematicians have developed a rigorous framework for reconci

APA, Harvard, Vancouver, ISO, and other styles

11

Măndoiu, Ion I. "Approximation algorithms for VLSI routing." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/9128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Santin, Gabriele. "Approximation in kernel-based spaces, optimal subspaces and approximation of eigenfunctions." Doctoral thesis, Università degli studi di Padova, 2016. http://hdl.handle.net/11577/3424498.

Full text

Abstract:

Kernel-based approximation methods provide optimal recovery procedures in the native Hilbert spaces in which they are reproducing. Among other, kernels in the notable class of continuous and strictly positive definite kernels on compact sets possess a series decomposition in L2 - orthonormal eigenfunctions of a particular integral operator. The interest for this decomposition is twofold. On one hand, the subspaces generated by eigenfunctions, or eigenbasis elements, are L2 -optimal trial spaces in the sense of widths. On the other hand, such expansion is the fundamental tool of some of the st

APA, Harvard, Vancouver, ISO, and other styles

13

Koufogiannakis, Christos. "Approximation algorithms for covering problems." Diss., [Riverside, Calif.] : University of California, Riverside, 2009. http://proquest.umi.com/pqdweb?index=0&did=1957320821&SrchMode=2&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1268338860&clientId=48051.

Full text

Abstract:

Thesis (Ph. D.)--University of California, Riverside, 2009.<br>Includes abstract. Title from first page of PDF file (viewed March 11, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 70-77). Also issued in print.

APA, Harvard, Vancouver, ISO, and other styles

14

Wiley, David F. "Approximation and visualization of scientific data using higher-order elements /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2003. http://uclibs.org/PID/11984.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Grishin, Denis. "Fast and efficient methods for multi-dimensional scattered data approximation /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2004. http://uclibs.org/PID/11984.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Fung, Ping-yuen, and 馮秉遠. "Approximation for minimum triangulations of convex polyhedra." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B29809964.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Lewis, Cannada Andrew. "The Unreasonable Usefulness of Approximation by Linear Combination." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/83866.

Full text

Abstract:

Through the exploitation of data-sparsity ---a catch all term for savings gained from a variety of approximations--- it is possible to reduce the computational cost of accurate electronic structure calculations to linear. Meaning, that the total time to solution for the calculation grows at the same rate as the number of particles that are correlated. Multiple techniques for exploiting data-sparsity are discussed, with a focus on those that can be systematically improved by tightening numerical parameters such that as the parameter approaches zero the approximation becomes

APA, Harvard, Vancouver, ISO, and other styles

18

Thomas, A. "Data structures, methods of approximation and optimal computation for pedigree analysis." Thesis, University of Cambridge, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.372922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Turner, David Andrew. "The approximation of Cartesian coordinate data by parametric orthogonal distance regression." Thesis, University of Huddersfield, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.323778.

Full text

Abstract:

This thesis is concerned with the approximation of Cartesian coordinate data by parametric curves and surfaces, with an emphasis upon a technique known as parametric orthogonal distance regression (parametric ODR). The technique has become increasingly popular in the literature over the past decade and has applications in a wide range of fields, including metrology-the science of measurement, and computer aided design (CAD) modelling. Typically, the data are obtained by recording points measured in the surface of some physical artefact, such as a manufactured part. Parametric ODR involves mini

APA, Harvard, Vancouver, ISO, and other styles

20

Schmid, Dominik [Verfasser]. "Scattered Data Approximation on the Rotation Group and Generalizations / Dominik Schmid." Aachen : Shaker, 2009. http://d-nb.info/1161303006/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Grimm, Alexander Rudolf. "Parametric Dynamical Systems: Transient Analysis and Data Driven Modeling." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/83840.

Full text

Abstract:

Dynamical systems are a commonly used and studied tool for simulation, optimization and design. In many applications such as inverse problem, optimal control, shape optimization and uncertainty quantification, those systems typically depend on a parameter. The need for high fidelity in the modeling stage leads to large-scale parametric dynamical systems. Since these models need to be simulated for a variety of parameter values, the computational burden they incur becomes increasingly difficult. To address these issues, parametric reduced models have encountered increased popularity in recent y

APA, Harvard, Vancouver, ISO, and other styles

22

Swingler, Kevin. "Mixed order hyper-networks for function approximation and optimisation." Thesis, University of Stirling, 2016. http://hdl.handle.net/1893/25349.

Full text

Abstract:

Many systems take inputs, which can be measured and sometimes controlled, and outputs, which can also be measured and which depend on the inputs. Taking numerous measurements from such systems produces data, which may be used to either model the system with the goal of predicting the output associated with a given input (function approximation, or regression) or of finding the input settings required to produce a desired output (optimisation, or search). Approximating or optimising a function is central to the field of computational intelligence. There are many existing methods for performing

APA, Harvard, Vancouver, ISO, and other styles

23

Kotsakis, Christophoros. "Multiresolution aspects of linear approximation methods in Hilbert spaces using gridded data." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0016/NQ54794.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Fu, Shuting. "Bayesian Logistic Regression Model with Integrated Multivariate Normal Approximation for Big Data." Digital WPI, 2016. https://digitalcommons.wpi.edu/etd-theses/451.

Full text

Abstract:

The analysis of big data is of great interest today, and this comes with challenges of improving precision and efficiency in estimation and prediction. We study binary data with covariates from numerous small areas, where direct estimation is not reliable, and there is a need to borrow strength from the ensemble. This is generally done using Bayesian logistic regression, but because there are numerous small areas, the exact computation for the logistic regression model becomes challenging. Therefore, we develop an integrated multivariate normal approximation (IMNA) method for binary data with

APA, Harvard, Vancouver, ISO, and other styles

25

Pötzelberger, Klaus, and Klaus Felsenstein. "On the Fisher Information of Discretized Data." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 1991. http://epub.wu.ac.at/1700/1/document.pdf.

Full text

Abstract:

In this paper we study the loss of Fisher information in approximating a continous distribution by a multinominal distribution coming from a partition of the sample space into a finite number of intervals. We describe and characterize the Fisher information as a function of the partition chosen especially for location parameters. For a small number of intervals the consequences of the choice is demonstrated by instructive examples. For increasing number of individuals we give the asymptotically optimal partition. (author's abstract)<br>Series: Forschungsberichte / Institut für Statistik

APA, Harvard, Vancouver, ISO, and other styles

26

Lee, Dong-Wook. "Extracting multiple frequencies from phase-only data." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/15031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Hakimi, Sibooni J. "Application of extreme value theory." Thesis, University of Bradford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.384263.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Furuhashi, Takeshi, Tomohiro Yoshikawa, Kanta Tachibana, and Minh Tuan Pham. "A Clustering Method for Geometric Data based on Approximation using Conformal Geometric Algebra." IEEE, 2011. http://hdl.handle.net/2237/20706.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Qin, Hanzhang S. M. Massachusetts Institute of Technology. "Near-optimal data-driven approximation schemes for joint pricing and inventory control models." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119336.

Full text

Abstract:

Thesis: S.M. in Transportation, Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2018.<br>Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 95-96).<br>The thesis studies the classical multi-period joint pricing and inventory control problem in a data-driven setting. In the problem, a retailer makes periodic decisions of the prices and inventory levels of an item that the retailer wishes to sell. The o

APA, Harvard, Vancouver, ISO, and other styles

30

Bingham, Jonathan D. "Comparison of Data Collection and Methods For the Approximation of Streambed Thermal Properties." DigitalCommons@USU, 2009. https://digitalcommons.usu.edu/etd/456.

Full text

Abstract:

When approximating heat transfer through a streambed, an understanding of the thermal properties of the sediments is essential (e.g., thermal conductivity, specific heat capacity, and density). Even though considerable research has been completed in this field, little has been done to establish appropriate standard data collection approaches or to compare modeling methods for approximating these properties. Three mixture models were selected for comparison against each other and against a bed conduction model (SEDMOD). Typical data collection approaches were implemented for use in the mixture

APA, Harvard, Vancouver, ISO, and other styles

31

Kim, Jung Hoon. "Performance Analysis and Sampled-Data Controller Synthesis for Bounded Persistent Disturbances." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/199317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Wang, Hongyan. "Analysis of statistical learning algorithms in data dependent function spaces /." access full-text access abstract and table of contents, 2009. http://libweb.cityu.edu.hk/cgi-bin/ezdb/thesis.pl?phd-ma-b23750534f.pdf.

Full text

Abstract:

Thesis (Ph.D.)--City University of Hong Kong, 2009.<br>"Submitted to Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy." Includes bibliographical references (leaves [87]-100)

APA, Harvard, Vancouver, ISO, and other styles

33

Mehl, Craig. "Developing a sorting code for Coulomb excitation data analysis." University of the Western Cape, 2015. http://hdl.handle.net/11394/4871.

Full text

Abstract:

>Magister Scientiae - MSc<br>This thesis aims at developing a sorting code for Coulomb excitation studies at iThemba LABS. In Coulomb excitation reactions, the inelastic scattering of the projectile transfers energy to the partner nucleus (and vice-versa) through a time-dependent electromagnetic field. At energies well below the Coulomb barrier, the particles interact solely through the well known electromagnetic interaction, thereby excluding nuclear excitations from the process . The data can therefore be analyzed using a semiclassical approximation. The sorting code was used to process

APA, Harvard, Vancouver, ISO, and other styles

34

Bennell, Robert Paul. "Continuous approximation methods for data smoothing and Fredholm integral equations of the first kind when the data are noisy." Thesis, Cranfield University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Levy, Eythan. "Approximation algorithms for covering problems in dense graphs." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210359.

Full text

Abstract:

We present a set of approximation results for several covering problems in dense graphs. These results show that for several problems, classical algorithms with constant approximation ratios can be analyzed in a finer way, and provide better constant approximation ratios under some density constraints. In particular, we show that the maximal matching heuristic approximates VERTEX COVER (VC) and MINIMUM MAXIMAL MATCHING (MMM) with a constant ratio strictly smaller than 2 when the proportion of edges present in the graph (weak density) is at least 3/4, or when the normalized minimum degree (stro

APA, Harvard, Vancouver, ISO, and other styles

36

Basna, Rani. "Edgeworth Expansion and Saddle Point Approximation for Discrete Data with Application to Chance Games." Thesis, Linnaeus University, School of Computer Science, Physics and Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-8681.

Full text

Abstract:

<p>We investigate mathematical tools, Edgeworth series expansion and the saddle point method, which are approximation techniques that help us to estimate the distribution function for the standardized mean of independent identical distributed random variables where we will take into consideration the lattice case. Later on we will describe one important application for these mathematical tools where game developing companies can use them to reduce the amount of time needed to satisfy their standard requests before they approve any game</p>

APA, Harvard, Vancouver, ISO, and other styles

37

Folia, Maria Myrto. "Inference in stochastic systems with temporally aggregated data." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/inference-in-stochastic-systems-with-temporally-aggregated-data(17940c86-e6b3-4f7d-8a43-884bbf72b39e).html.

Full text

Abstract:

The stochasticity of cellular processes and the small number of molecules in a cell make deterministic models inappropriate for modelling chemical reactions at the single cell level. The Chemical Master Equation (CME) is widely used to describe the evolution of biochemical reactions inside cells stochastically but is computationally expensive. The Linear Noise Approximation (LNA) is a popular method for approximating the CME in order to carry out inference and parameter estimation in stochastic models. Data from stochastic systems is often aggregated over time. One such example is in luminesce

APA, Harvard, Vancouver, ISO, and other styles

38

Karimi, Belhal. "Non-Convex Optimization for Latent Data Models : Algorithms, Analysis and Applications." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLX040/document.

Full text

Abstract:

De nombreux problèmes en Apprentissage Statistique consistent à minimiser une fonction non convexe et non lisse définie sur un espace euclidien. Par exemple, les problèmes de maximisation de la vraisemblance et la minimisation du risque empirique en font partie.Les algorithmes d'optimisation utilisés pour résoudre ce genre de problèmes ont été largement étudié pour des fonctions convexes et grandement utilisés en pratique.Cependant, l'accrudescence du nombre d'observation dans l'évaluation de ce risque empirique ajoutée à l'utilisation de fonctions de perte de plus en plus sophistiquées représ

APA, Harvard, Vancouver, ISO, and other styles

39

Choudhury, Salimur Rashid, and University of Lethbridge Faculty of Arts and Science. "Approximation algorithms for a graph-cut problem with applications to a clustering problem in bioinformatics." Thesis, Lethbridge, Alta. : University of Lethbridge, Deptartment of Mathematics and Computer Science, 2008, 2008. http://hdl.handle.net/10133/774.

Full text

Abstract:

Clusters in protein interaction networks can potentially help identify functional relationships among proteins. We study the clustering problem by modeling it as graph cut problems. Given an edge weighted graph, the goal is to partition the graph into a prescribed number of subsets obeying some capacity constraints, so as to maximize the total weight of the edges that are within a subset. Identification of a dense subset might shed some light on the biological function of all the proteins in the subset. We study integer programming formulations and exhibit large integrality gaps for various fo

APA, Harvard, Vancouver, ISO, and other styles

40

Lundberg, Oscar, Oskar Bjersing, and Martin Eriksson. "Approximation of ab initio potentials of carbon nanomaterials with machine learning." Thesis, Luleå tekniska universitet, Institutionen för teknikvetenskap och matematik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-62568.

Full text

Abstract:

In this work potentials of carbon nanomaterials calculated with Density Functional Theory (DFT) are approximated using an Artificial Neural Network (ANN). Previous work in this field has focused on estimating potential energies of bulk structures. We investigate the possibility to approximate both the potential energies and the forces of periodic carbon nanotubes (CNTs) and fullerenes. The results indicate that for test structures similar to those in the training set the ANN approximates the energies to within 270 meV/atom (< 3.7% error, RMSE 40 meV/atom) and the forces to within 7.5 eV/Å (

APA, Harvard, Vancouver, ISO, and other styles

41

Eremic, John C. "Iterative methods for estimation of 2-D AR parameters using a data-adaptive Toeplitz approximation algorithm." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/28321.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Agarwal, Khushbu. "A partition based approach to approximate tree mining : a memory hierarchy perspective." The Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=osu1196284256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Singhal, Kritika. "Geometric Methods for Simplification and Comparison of Data Sets." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1587253879303425.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Essegbey, John W. "Piece-wise Linear Approximation for Improved Detection in Structural Health Monitoring." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1342729241.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Duan, Xiuwen. "Revisiting Empirical Bayes Methods and Applications to Special Types of Data." Thesis, Université d'Ottawa / University of Ottawa, 2021. http://hdl.handle.net/10393/42340.

Full text

Abstract:

Empirical Bayes methods have been around for a long time and have a wide range of applications. These methods provide a way in which historical data can be aggregated to provide estimates of the posterior mean. This thesis revisits some of the empirical Bayesian methods and develops new applications. We first look at a linear empirical Bayes estimator and apply it on ranking and symbolic data. Next, we consider Tweedie’s formula and show how it can be applied to analyze a microarray dataset. The application of the formula is simplified with the Pearson system of distributions. Saddlepoin

APA, Harvard, Vancouver, ISO, and other styles

46

Qin, Xiao. "A Data-Driven Approach for System Approximation and Set Point Optimization, with a Focus in HVAC Systems." Diss., The University of Arizona, 2014. http://hdl.handle.net/10150/318828.

Full text

Abstract:

Dynamically determining input signals to a complex system, to increase performance and/or reduce cost, is a difficult task unless users are provided with feedback on the consequences of different input decisions. For example, users self-determine the set point schedule (i.e. temperature thresholds) of their HVAC system, without an ability to predict cost--they select only comfort. Users are unable to optimize the set point schedule with respect to cost because the cost feedback is provided at billing-cycle intervals. To provide rapid feedback (such as expected monthly/daily cost), mechanisms f

APA, Harvard, Vancouver, ISO, and other styles

47

Morel, Jules. "Surface reconstruction based on forest terrestrial LiDAR data." Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0039/document.

Full text

Abstract:

Au cours des dernières années, la capacité de la technologie LiDAR à capturer des informations détaillées sur la structure des forêts a attiré une attention croissante de la part de la communauté des écologues et des forestiers. Le LiDAR terrestre, notamment, apparaît comme un outil prometteur pour recueillir les caractéristiques géométriques des arbres à une précision millimétrique.Cette thèse étudie la reconstruction de surface à partir de nuages de points épars et non structurés, capturés en environnement forestier par un LiDAR terrestre. Nous proposons une suite d’algorithmes dédiés à la r

APA, Harvard, Vancouver, ISO, and other styles

48

Morvan, Anne. "Contributions to unsupervised learning from massive high-dimensional data streams : structuring, hashing and clustering." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLED033/document.

Full text

Abstract:

Cette thèse étudie deux tâches fondamentales d'apprentissage non supervisé: la recherche des plus proches voisins et le clustering de données massives en grande dimension pour respecter d'importantes contraintes de temps et d'espace.Tout d'abord, un nouveau cadre théorique permet de réduire le coût spatial et d'augmenter le débit de traitement du Cross-polytope LSH pour la recherche du plus proche voisin presque sans aucune perte de précision.Ensuite, une méthode est conçue pour apprendre en une seule passe sur des données en grande dimension des codes compacts binaires. En plus de garanties t

APA, Harvard, Vancouver, ISO, and other styles

49

Gorman, Joe, Glenn Takata, Subhash Patel, and Dan Grecu. "A Constraint-Based Approach to Predictive Maintenance Model Development." International Foundation for Telemetering, 2008. http://hdl.handle.net/10150/606187.

Full text

Abstract:

ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California<br>Predictive maintenance is the combination of inspection and data analysis to perform maintenance when the need is indicated by unit performance. Significant cost savings are possible while preserving a high level of system performance and readiness. Identifying predictors of maintenance conditions requires expert knowledge and the ability to process large data sets. This paper d

APA, Harvard, Vancouver, ISO, and other styles

50

Hildebrandt, Filip, and Leonard Halling. "Identifiering av tendenser i data för prediktiv analys hos Flygresor.se." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209646.

Full text

Abstract:

I och med digitaliseringen förändras samhället snabbare än någonsin och det är viktigt för företag att hålla sig uppdaterade för att kunna anpassa sin verksamhet till en marknad som hela tiden utvecklas. Det existerar en uppsjö av business intelligence modeller för just detta ändamål, och prediktiv analys är en central del bland dessa. Fokus i denna rapport ligger i att undersöka i vilken utsträckning tre olika prediktiva analysmetoder lämpar sig för ett specifikt uppdrag gällande månadsprognoser baserat på klickdata från Flygresor.se. Målet med rapporten är att kunna redogöra för vilken av me

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!