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 62 for “"Subspace clustering"”.

  1. Hierarchical Subspace Clustering

    It is well-known that traditional clustering methods considering all dimensions of the feature space usually fail in terms of efficiency and effectivity when applied to high-dimensional data. This poor behavior is based on the fact that clusters may not be found in the high-dimensional feature …

    lmu-germany Repository record for Hierarchical Subspace Clustering (opens in a new tab)

  2. OVERCOMPLETE DEEP SUBSPACE CLUSTERING

    Deep Subspace Clustering Networks (DSC) provide an efficient solution to the problem of unsupervised subspace clustering by using an undercomplete deep auto-encoder with a fully-connected layer to exploit the self expressiveness property. This method uses undercomplete representations of the input …

    jhu Repository record for OVERCOMPLETE DEEP SUBSPACE CLUSTERING (opens in a new tab)

  3. Subspace Clustering: A Possibilistic Approach

    … αλγορίθμου, του sparse adaptive possibilistic K-subspaces (SAP K-subspaces). Ο αλγόριθμος αυτός αποτελεί γενίκευση του αλγορίθμου sparse possibilistic c-means algorithm (SPCM) [2], πράγμα που σημαίνει ότι μπορεί να διαχειριστεί με αξιοπιστία δεδομένα τόσο με θόρυβο και ακραίες τιμές όσο και …

    athens Repository record for Subspace Clustering: A Possibilistic Approach (opens in a new tab)

  4. Singular Value Computation and Subspace Clustering

    … proposes an inverse-free preconditioned Krylov subspace method, which uses preconditioning instead of shift-and-invert to accelerate the convergence. To compute several eigenvalues, Wielandt is used in a straightforward manner. However, the Wielandt deflation alters the structure of the problem …

    uky-thes Repository record for Singular Value Computation and Subspace Clustering (opens in a new tab)

  5. Subspace Clustering and Active Learning with Constraints

    … can be summarised well in a lower dimensional subspace or multiple lower dimensional subspaces. Subspace clustering addresses the problem of simultaneously uncovering multiple subspace structures in the data and grouping the data according to their underlying subspace structures. The first …

    lancaster Download PDF for Subspace Clustering and Active Learning with Constraints (opens in a new tab)

  6. Subspace Clustering with the Multivariate-t Distribution

    Clustering procedures suitable for the analysis of very high-dimensional data are needed for many modern data sets. One model-based clustering approach called high-dimensional data clustering (HDDC) uses a family of Gaussian mixture models to model the sub-populations of the observed data, i.e., to …

    mcmaster Repository record for Subspace Clustering with the Multivariate-t Distribution (opens in a new tab)

  7. Dual Principal Component Pursuit and Filtrated Algebraic Subspace Clustering

    … importance, i.e., dimensionality 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 …

    jhu Repository record for Dual Principal Component Pursuit and Filtrated Algebraic Subspace Clustering (opens in a new tab)

  8. AUGMENTED LAGRANGIAN BASED ALGORITHMS FOR NONCONVEX OPTIMIZATION WITH APPLICATIONS IN SUBSPACE CLUSTERING

    … from a machine learning application called subspace clustering. We show that the alternating direction method of multipliers (ADMM), which may roughly be described as an application of block-wise coordinate minimization of the AL function, is well suited for this machine learning task. …

    jhu Repository record for AUGMENTED LAGRANGIAN BASED ALGORITHMS FOR NONCONVEX OPTIMIZATION WITH APPLICATIONS IN SUBSPACE CLUSTERING (opens in a new tab)

  9. Improving k-nn search and subspace clustering based on local intrinsic dimensionality

    … algorithms, such as similarity search and clustering, that depend on them lose their effectiveness. One way to handle this challenge is by selecting the most important features, which is essential for providing compact object representations as well as improving the overall search and …

    njit Repository record for Improving k-nn search and subspace clustering based on local intrinsic dimensionality (opens in a new tab)

  10. An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm

    … literature review on high dimensional data clustering is conducted and a novel density-algorithm to perform high dimensional data clustering is developed.

    csusb Repository record for An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm (opens in a new tab)

  11. An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm

    … literature review on high dimensional data clustering is conducted and a novel density-algorithm to perform high dimensional data clustering is developed.

    csusb-retro Repository record for An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm (opens in a new tab)

  12. Unsupervised Feature Selection and Deep Subspace Clustering for Exploratory High-Dimensional Cluster Analysis

    … only within specific feature subsets, known as subspaces. In some cases, the original features may not be sufficient, requiring the generation of new ones to identify these subspaces. This research explores two strategies for handling high- dimensional data with few samples: (i) a novel …

    brazil-ufpe Repository record for Unsupervised Feature Selection and Deep Subspace Clustering for Exploratory High-Dimensional Cluster Analysis (opens in a new tab)

  13. Robust motion segmentation with subspace constraints

    … given, motion segmentation can be addressed as a subspace clustering problem under an affine camera model. In the first two parts of this thesis, we target the general subspace clustering problem and propose two novel methods, namely Efficient Dense Subspace Clustering (EDSC) and the Robust Shape …

    anu Repository record for Robust motion segmentation with subspace constraints (opens in a new tab)

  14. Robust learning with low-dimensional structure: theory,algorithms and applications

    … that are common in real problems: ?low-rank subspace model? that underlies matrix completion and Robust PCA, and ?union-of-subspace model? that arises in the problem of subspace clustering. In the upcoming chapters, we will present (i) stability of matrix factorization and its consequences in …

    nus Repository record for Robust learning with low-dimensional structure: theory,algorithms and applications (opens in a new tab) Download file for Robust learning with low-dimensional structure: theory,algorithms and applications (opens in a new tab)

  15. Unsupervised Learning from Shollow to Deep

    … learning to explore better representation for subspace clustering. This architecture is built upon deep auto-encoders, which non-linearly map the input data into a latent space. Our key idea is to introduce a novel self-expressive layer between the encoder and the decoder to mimic the …

    anu Repository record for Unsupervised Learning from Shollow to Deep (opens in a new tab)

  16. Robust, Scalable, and Provable Approaches to High Dimensional Unsupervised Learning

    … on three popular unsupervised learning problems: subspace clustering, robust PCA, and column sampling. For the subspace clustering problem, a new transformative idea is presented. The proposed approach, termed Innovation Pursuit, is a new geometrical solution to the subspace clustering problem …

    ucf Repository record for Robust, Scalable, and Provable Approaches to High Dimensional Unsupervised Learning (opens in a new tab)

  17. Low-Rank Clustering via LP1-PCA

    In recent years, subspace clustering has found many practical use cases which include, for example, image segmentation, motion segmentation, and facial clustering. The image and video data that is common to these types of applications often has high dimensionality. Rather than viewing high …

    rit Repository record for Low-Rank Clustering via LP1-PCA (opens in a new tab)

  18. Sparse Methods for Learning Multiple Subspaces from Large-scale, Corrupted and Imbalanced Data

    … of effectively learning multiple low-dimensional subspaces from such data. Multi-subspace learning methods based on sparse representation, such as sparse representation based classification (SRC) and sparse subspace clustering (SSC) have become very popular due to their conceptual simplicity and …

    jhu Repository record for Sparse Methods for Learning Multiple Subspaces from Large-scale, Corrupted and Imbalanced Data (opens in a new tab)

Page 1 of 4