Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 67 for “"random projections"”.
-
Data Dependent Random Projections
Random projections is a technique used primarily in dimension reduction, in order to estimate distances in data. They can be thought of a linear transformation mapping a data matrix X to a lower dimensional space, where distances are preserved in expectation. However, the preservation of distances …
-
Imaging using random projections: compression, communication, camera identification
… transmission and source camera identification. Random projections and compressed sensing are shown to be effective techniques to address such problems. We show that random projections can be used to compress multispectral images in a more rate-efficient manner than previously known and with a …
-
Dimension reduction of streaming data via random projections
… and engineering communities have developed randomised, probabilistic algorithms to estimate statistics of interest over streaming data on the fly, with small computational complexity and storage requirements, by constructing low dimensional representations of the stream known as data …
-
Experimental study of random projections below the JL limit
Random projection is a method used to reduce dimensionality of desired objects with pair-wise distances preserved at a relatively high probability. The mathematical theory behind this is called the Johnson-Lindenstrauss (JL) lemma. So, the basic idea of the JL lemma is that a set of points in a …
-
PROBABILISTIC PREDICTION USING EMBEDDED RANDOM PROJECTIONS OF HIGH DIMENSIONAL DATA
The explosive growth of digital data collection and processing demands a new approach to the historical engineering methods of data correlation and model creation. A new prediction methodology based on high dimensional data has been developed. Since most high dimensional data resides on a low …
-
CHANGE POINT ANALYSIS IN HIGH-DIMENSIONAL DATA USING RANDOM PROJECTIONS
… these limitations, we propose to use multiple random projections in change point analysis. The first part of the thesis develops a novel change point identification method for high-dimensional data using random projections, targeting a single change point setting. By projecting high-dimensional …
-
A Method for Clustering High-Dimensional Data Using 1D Random Projections
… clustering method using a binary tree of 1D random projections. As real data tends to have a lot of structures, we show that a 1D random projection of real data captures some of that structure with a high probability. More specifically, the structure manifests itself as a clear binary …
-
Versatile Compressive Sensing: Extensions of Random Projections for Imaging and Machine Vision
… the use of shallow neural networks to map from random, task-insensitive measurements to highly targeted, task-specific measurements without sacrificing reconstruction capability. This work improves single-pixel object classification accuracies even when the object is against a complex, unknown …
-
High-dimensional learning from random projections of data through regularization and diversification
Random signal measurement, in the form of random projections of signal vectors, extends the traditional point-wise and periodic schemes for signal sampling. In particular, the well-known problem of sensing sparse signals from linear measurements, also known as Compressed Sensing (CS), has promoted …
-
Exploring New Forms of Random Projections for Prediction and Dimensionality Reduction in Big-Data Regimes
… we turn to a simple and powerful method called random projections. Random projections are a simple, efficient, and data-independent method for stably embedding a point-set P of n points in R^d to R^k where d is typically large and k is on the order of log n. Random projections have a long …
-
Exploiting random projections and sparsity with random forests and gradient boosting methods - Application to multi-label and multi-output learning, random forest model compression and leveraging input sparsity
… together for state-of-the-art performance: random forest ensembles average the predictions of randomized decision trees trained independently in parallel, while tree boosting ensembles train decision trees sequentially to refine the predictions made by the previous ones. The emergence of new …
-
Applying Supervised Learning Algorithms and a New Feature Selection Method to Predict Coronary Artery Disease
… explains the k-Nearest Neighbour (k-NN) and Random Forest learning algorithms, and includes a complete proof that k-NN is universally consistent in finite dimensional normed vector spaces. Second, the thesis introduces two dimensionality reduction techniques: Random Projections and a new …
-
Two-Sample Testing of High-Dimensional Covariance Matrices
… this study proposes a method by which we first randomly project the original high-dimensional data into lower-dimensional space, and then apply the corrected likelihood ratio tests developed with random matrix theory. We show that testing with a single random projection is consistent under the …
-
Three essays in high dimensional linear regression in economics
… edge. While in the temporal dependence setting, Random Projections from the machine learning literature clearly dominates as the variables approach the unit root mark. The second essay addresses how high dimensional data sets are becoming increasingly present to econometricians combined with …
-
the use of random matrices as a tool for dimension reduction for high dimension reduction in high-dimensional problems
… thesis, wemainly discuss the approach of linear projections, especially principal componentanalysis and random projections to cope with high-dimensional data. We simulatedata in two settings: linear regression and survival analysis. We first reduce thedimension using either PCA and random …
-
Compressive Hyperspectral Structured Illumination and Classification via Neural Networks
… forms a low-dimensional, nonlinear manifold that random projections can stably embed using far fewer measurements. Thus random projections in compressive sampling can be regarded as a dimension-reducing process. We demonstrate a method using compressive measurements of images to train a neural …
-
Optimization over networks: Efficient algorithms and analysis
… set. We propose gradient descent algorithms with random projections which use various communication protocols. First, we present a distributed random projection (DRP) algorithm whereby each agent exchanges local information only with its immediate neighbors at each iteration. With reasonable …
-
Compressive classification for face recognition
… possible dimensionality reduction technique – random projections. Most traditional classifiers do not give good classification results when the dimensionality of the data is reduced by such method. This work proposes a new class of classifiers that are robust to data whose dimensionality has …
-
The Performance of Random Prototypes in Hierarchical Models of Vision
… the dictionary of natural shapes with entirely random prototypes has little impact on classification performance. This work explores that phenomenon by studying the performance of random prototypes on natural scenes, and by comparing their performance to that of sparse random projections of …
-
Tensor dimensionality reduction and applications
… reduction methods for vectors, matrices, such as random projections and low-rank decompositions, to be suitable for higher-order tensors. Numerical experiments show the proposed reduction algorithms result in significant storage savings and computation speed-ups. As a trade-off, from the …
Page 1 of 4