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 44 for “"Subspace learning"”.
-
Subspace learning by randomized sketching
… that can be leveraged to design scalable machine learning and signal processing algorithms. Developing efficient computational frameworks that take advantage of the underlying structure in the data is crucial. In this thesis, we consider a particular form of inherent low dimensionality in data: …
-
Evolutionary Weights for Random Subspace Learning
Ensemble learning is a widely used technique in Data Mining, this method allows us to aggregate models to reduce prediction error. There are many methods on how to perform model aggregation, one of them is known as Random Subspace Learning, which consists of building subspace of the feature space …
-
Graph and Subspace Learning for Domain Adaptation
… different distributions, traditional supervised learning can not achieve good performance on the new domain. Domain adaptation algorithms are therefore designed to bridge the distribution gap between training (source) data and test (target) data. In this thesis, I propose two graph learning and …
-
Multilinear Subspace Learning for Face and Gait Recognition
… This dissertation focuses on multilinear subspace learning for face and gait recognition, where low-dimensional representations are learned directly from tensorial face or gait objects. This research introduces a unifying multilinear subspace learning framework for systematic treatment of …
-
Unified Discriminative Subspace Learning for Multimodality Image Analysis
… locally adaptive (QDLA) method and four new subspace learning algorithms corresponding to different learning-locality criteria are presented. These four algorithms are locally embedded analysis (LEA), discriminant simplex analysis (DSA), correlation embedding analysis (CEA), and correlation …
-
Provable and efficient algorithms for robust subspace learning and tracking
… theme in the Signal Processing and Machine Learning is to exploit the fact that most real-world (extremely high dimensional) data exhibits a simple, succinct, low-dimensional representation. In other words, the data lies close to some low-dimensional structure of the ambient space. In this …
-
Spectral Regression: A Regression Framework for Efficient Regularized Subspace Learning
… tool for dimensionality reduction and manifold learning. These methods use information contained in the eigenvectors of a data affinity (\ie, item-item similarity) matrix to reveal the low dimensional structure in the high dimensional data. The most popular manifold learning algorithms include …
-
Markerless multiple-view human motion analysis using swarm optimisation and subspace learning
… particle swarm optimisation and charting, a subspace learning technique.In our first framework, we formulate, and perform, human motion tracking as a multi-dimensional non-linear optimisation problem, solved using particle swarm optimisation (PSO), a swarm-intelligence algorithm. PSO …
-
Random Subspace Learning on Outlier Detection and Classification with Minimum Covariance Determinant Estimator
… and classification. We explored the random subspace learning and expand other classification and outlier detection algorithms to adapt its framework. Our proposed methods can handle both high-dimension low-sample size and traditional low-dimensional high-sample size datasets. Essentially, we …
-
Subspace Learning for Data Arising from a Union of Subspaces of High Relative Dimension
… the rapid growth of statistical machine learning over the past decades, the ability of processing big and corrupted data becomes increasingly important. One of the major challenges is that structured data, such as images, videos and 3D point clouds, involved in many application scenarios …
-
Outlier detection and subspace learning via structured low rank approximation with applications to omic data
… have been already introduced in the machine learning community, and they are formulated as convex optimization problems. The main advantage of the convexity of this problems, is that it can be solved iteratively in an efficient way using first order optimization algorithms. However, outlier …
-
Novel Statistical Methods for High-Dimensional Data: Adversarial Subspace Learning and Quickest Detection of Community
… of the thesis focus on the domain of robust subspace learning under the influence of adversarial attacks. By analyzing the adversarial projection risk when the data follow the Spiked Covariance model, we advocate the employment of the empirical risk minimization (ERM) approach in order to …
-
The self-organizing hierarchical optimal subspace learning and inference framework for view-based object recognition and image retrieval
Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1996
-
Grassmann Learning for Recognition and Classification
… classification and recognition systems. Subspace learning has received considerable attention as a means of finding an efficient low-dimensional representation that leads to better classification and efficient processing. A Grassmann manifold is a space that promotes smooth surfaces, …
-
Cyclic Style Generative Adversarial Network for Near Infrared and Visible Light Face Recognition
… applications. With the development of the deep learning method, the recognition accuracy and speed have already reached an excellent level, where face recognition can be applied in various circumstances. However, in some extreme situations, there are still problems that face recognition cannot …
-
Sparse Methods for Learning Multiple Subspaces from Large-scale, Corrupted and Imbalanced Data
In many practical applications in machine learning, computer vision, data mining and information retrieval one is confronted with datasets whose intrinsic dimension is much smaller than the dimension of the ambient space. This has given rise to the challenge of effectively learning multiple …
-
Learning from Disparate Data: Applications in Biometrics and Sustainability
Many learning problems involve data coming from multiple sources, sensors, modalities or feature spaces, that describe the object of interest in a unique way, and typically exhibit heterogeneous properties. The varied data sources are termed as views, and the task of learning from such multi-view …
-
FACTORIZED HIDDEN LAYER ADAPTATION FOR DEEP NEURAL NETWORK BASED ACOUSTIC MODELING
… ASR. Namely, factorized hidden layer (FHL) and subspace learning hidden unit contributions (LHUC). FHL aims at modeling speaker dependent (SD) hidden layers by representing an SD affine transformation as a linear combination of bases. The combination weights can be initialized using speaker …
-
Dual Principal Component Pursuit and Filtrated Algebraic Subspace Clustering
… reduction and clustering, and the idea of learning one or more linear subspaces from the data has proved a fruitful notion in that context. Nevertheless, state-of-the-art methods, such as Robust Principal Component Analysis (RPCA) or Sparse Subspace Clustering (SSC), operate under the …
-
Linear Subspace and Manifold Learning via Extrinsic Geometry
… data, analyzing shape and image data, and learning from or classifying large corpora of text documents. Common Bayesian and Machine Learning techniques rely on using the unique geometry of these data types, however departing from Euclidean geometry can result in both theoretical and …
Page 1 of 3