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 80 for “"Random projection"”.

  1. Random Projection Optimal Trees Ensemble

    … effect of feature selection on three methods: Random Forest (RF), Optimal Trees Ensemble (OTE) and Random Projection Ensembles (RP) in high dimensional settings. To this end, LASSO has been considered for selecting the most important features based on training data for dimension reduction. …

    essex Download PDF for Random Projection Optimal Trees Ensemble (opens in a new tab)

  2. Accelerating Stochastic Random Projection Neural Networks

    … distribution of the logical values as a random bit stream. Generally, the accuracy of these systems is correlated with the stochastic bit stream length and requires long compute times. In this work, a framework is proposed to accelerate the long compute times in stochastic ANNs. A GPU …

    rit Repository record for Accelerating Stochastic Random Projection Neural Networks (opens in a new tab)

  3. Random projection methods for stochastic convex minimization

    … closed and convex sets. The problem has random features. Gradient or subgradient of objective function carries stochastic errors. Number of constraint sets can be extensive or infinitely many. Constraint sets might not be known apriori yet revealed through random realizations or randomly …

    uiuc Repository record for Random projection methods for stochastic convex minimization (opens in a new tab)

  4. Search algorithms for biosequences using random projection

    … algorithms for biosequence annotation that use random projection, a technique borrowed from high-dimensional computational geometry. Random projection reduces computationally challenging problems of inexact string matching to a series of more tractable exact matching problems in exchange for a …

    washington Repository record for Search algorithms for biosequences using random projection (opens in a new tab)

  5. Efficient random projection trees for nearest neighbor search and related problems

    … Locality sensitivity hashing (LSH) and random projection trees (RPT) are two popular methods to solve NNS problem in sublinear time. Earlier works have demonstrated that RPT has superior performance compared to LSH. However, RPT has two major drawbacks, namely, i) its high space …

    wichita-thes Repository record for Efficient random projection trees for nearest neighbor search and related problems (opens in a new tab)

  6. On some deterministic properties of stochastic gradient descent and random projection sequences

    … thesis investigates deterministic properties of random algorithms, focusing on boundedness and a property related to the convergence rate of sequences generated by stochastic gradient and random projection methods in both finite and infinite-dimensional Hilbert spaces. We begin by revisiting …

    ubc Repository record for On some deterministic properties of stochastic gradient descent and random projection sequences (opens in a new tab) Download PDF for On some deterministic properties of stochastic gradient descent and random projection sequences (opens in a new tab)

  7. 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 …

    temple Repository record for Two-Sample Testing of High-Dimensional Covariance Matrices (opens in a new tab)

  8. Noise reduction in differentially private learning

    … on this problem. However, although the notion of random projection has pre-existed for a long time, little is known about randomly compressed models in the DP framework. In this thesis, we develop theories that quantify the effect of random projections on the learning performance, and the excess …

    birmingham Download PDF for Noise reduction in differentially private learning (opens in a new tab)

  9. Performance Analysis of Fixed-Random Weights in Artificial Neural Networks

    … To alleviate these concerns, the idea of fixed-random weights in deep neural networks is explored. More critically the goal is to maintain performance akin to fully trained models. Metrics such as floating point operations per second and memory size are compared and contrasted for fixed-random …

    rit Repository record for Performance Analysis of Fixed-Random Weights in Artificial Neural Networks (opens in a new tab)

  10. Advances on Dimension Reduction for Multivariate Linear Regression

    … one of the main approaches. In some literature, random projection methods were used to reduce dimension in large datasets. In Chapter 2, a new random projection method, with low-rank matrix approximation, is proposed to reduce the dimension of the parameter space in high-dimensional multivariate …

    mcmaster Repository record for Advances on Dimension Reduction for Multivariate Linear Regression (opens in a new tab)

  11. 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 …

    cornell Repository record for Data Dependent Random Projections (opens in a new tab)

  12. Changeable and Privacy Preserving Face Recognition

    … This dissertation systematically investigates random transformation based methods for addressing the challenging problems of changeability and privacy protection in biometrics enabled recognition systems. A random projection based approach is first introduced. We present a detailed mathematical …

    toronto-retro Repository record for Changeable and Privacy Preserving Face Recognition (opens in a new tab)

  13. ADDRESSING THREE PROBLEMS IN EMBEDDED SYSTEMS VIA COMPRESSIVE SENSING BASED METHODS

    … using the minimum number of measurements called projections. Its theory covers topics such as l1 optimisation, dimensionality reduction, information preserving projection matrices, random projection matrices and others. In this thesis we extend and use the theory of compressive sensing to address …

    unsw Repository record for ADDRESSING THREE PROBLEMS IN EMBEDDED SYSTEMS VIA COMPRESSIVE SENSING BASED METHODS (opens in a new tab)

  14. Invariance principle of random matrix

    Random matrix has been found useful in many real-world applications. The celebrated Johnson-Lindenstrauss lemma states that certain geometric structure of deterministic vectors is preserved when projecting high dimensional space to a lower dimensional space. However, when random vectors are …

    gatech Repository record for Invariance principle of random matrix (opens in a new tab)

  15. Novel Methods for Distributed and Privacy-Preserving Data Stream Mining

    … stream mining based on the combination of random projection, random translation, and additive noise. Experimental evaluation of HDSM demonstrates significant improvements in classification accuracy over existing distributed stream mining approaches while minimising data transmission and …

    auckland-tech Repository record for Novel Methods for Distributed and Privacy-Preserving Data Stream Mining (opens in a new tab)

  16. Large-scale high dimensional distance metric learning and its application to computer vision

    … is a Positive Semi-Definitive (PSD) matrix, a projection into the PSD cone is required at every iteration, whose cost is cubic in the dimensionality making it unsuitable for high dimensional data; (ii) The number of variables that needs to be optimized in DML is quadratic in the dimensionality, …

    msu

  17. Advances in independent component analysis with applications to data mining

    … given on a computationally simple method called random projection: it does not introduce severe distortions in the data. It is also proposed that random projection could be used as a preprocessing method prior to ICA, and experimental results are shown to support this claim. This thesis also …

    aalto Repository record for Advances in independent component analysis with applications to data mining (opens in a new tab)

  18. On Dimensionality Reduction of Data

    Random projection method is one of the important tools for the dimensionality reduction of data which can be made efficient with strong error guarantees. In this thesis, we focus on linear transforms of high dimensional data to the low dimensional space satisfying the Johnson-Lindenstrauss lemma. …

    uno Repository record for On Dimensionality Reduction of Data (opens in a new tab)

  19. Near duplicate image search

    … data. The proposed algorithm, named random seeding quantization, is more efficient in generating bag-of- words representations for near duplicate images. The new scheme is motivated by approximating the optimal partial matching between bag-of-features, and thus produces a bag-of-words …

    msu

  20. Scalable Nonparametric Bayes Learning

    … unstable. We propose an algorithm utilizing random projection ideas to construct flexible, computationally efficient and easy to implement approaches for generic scenarios. We then further improve the algorithm incorporating some structure and blocking ideas in our random projections and …

    duke Repository record for Scalable Nonparametric Bayes Learning (opens in a new tab)

Page 1 of 4