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 14 of 14 for “"Sparse Subspace"”.

  1. Discovery and Interpretation of Subspace Structures in Omics Data by Low-Rank Representation

    … data, such as gene expression levels. Detecting subspace structures in omics data and understanding the diversity of the biological processes is essential to the full comprehension of biological mechanisms and complicated biological systems. In this thesis, we are developing novel statistical …

    iupui Repository record for Discovery and Interpretation of Subspace Structures in Omics Data by Low-Rank Representation (opens in a new tab)

  2. 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)

  3. Similarity modeling for machine learning

    … learning method, then introduce two novel sparse similarity modeling methods for high dimensional data from the perspective of manifold learning and subspace learning. Our sparse similarity modeling methods learn sparse similarity and consequently generate a sparse graph over the data. The …

    uiuc Repository record for Similarity modeling for machine learning (opens in a new tab)

  4. MACHINE LEARNING FOR HEALTH MONITORING AND MANAGEMENT OF POWER PLANTS

    … data. We then propose a covariate-regulated sparse subspace learning model to analyze the multivariate data with complex cross-correlation. This model can be applied to the monitoring of multivariate process, which is common in power plant. The dissertation also propose an optimal multi-type …

    nus Repository record for MACHINE LEARNING FOR HEALTH MONITORING AND MANAGEMENT OF POWER PLANTS (opens in a new tab) Download file for MACHINE LEARNING FOR HEALTH MONITORING AND MANAGEMENT OF POWER PLANTS (opens in a new tab)

  5. Extracting biological insights from single molecule measurements of protein conformational dynamics using K-SVD algorithm

    … and analyzed after projecting the data to a sparse subspace determined by the learned dictionary. The approximations from the K-SVD allow accurate estimation of the number of conformations in the data and the respective smFRET efficiencies. The kinetic rate estimates are less reliable due to …

    colo-mines Repository record for Extracting biological insights from single molecule measurements of protein conformational dynamics using K-SVD algorithm (opens in a new tab)

  6. 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)

  7. Singular Value Computation and Subspace Clustering

    … or a few extreme singular values of a large and sparse matrix. The standard method of choice of computing a few extreme eigenvalues of a large symmetric matrix is the Lanczos or the implicitly restarted Lanczos method. These methods usually employ a shift-and-invert transformation to accelerate …

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

  8. Dual Principal Component Pursuit and Filtrated Algebraic Subspace 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 hypothesis that the subspaces …

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

  9. Regularization and Compression of Deep Neural Networks

    … These two problems could be mitigated by sparsely training large DNNs. Imposing sparsity constraints during training limits the capacity of the model to overfit to the training set while still being able to obtain good generalization. Sparse DNNs have most of their weights close to zero …

    sask Repository record for Regularization and Compression of Deep Neural Networks (opens in a new tab)

  10. Identifying cell types with single cell sequencing data

    … my study, I present a new method, named Learning Sparse Similarity Matrices (LSSM), to construct cell-cell similarity matrices, and then several clustering methods are used to identify cell populations respectively with scRNA-seq data. Firstly, based on sparse subspace theory, the relationship …

    sask Repository record for Identifying cell types with single cell sequencing data (opens in a new tab)

  11. Estimation and Clustering in Block Models

    … Adjusted Block Model (PABM) and introduce its sparse case, the Sparse Popularity Adjusted Block Model (SPABM). The SPABM is the only existing block model which allows to set some probabilities of connections to zero. For both the PABM and the SPABM, we produce the estimators of the probability …

    ucf Repository record for Estimation and Clustering in Block Models (opens in a new tab)

  12. Nonlinear Random Response of Large-Scale Sparse Finite Element Plate Bending Problems

    … loads. Efficient computational technologies like sparse storage schemes and parallel computation are proposed and incorporated to solve large-scale, nonlinear large deflection random vibration problems for both types of loading cases: (1) synchronized in time and (2) unsynchronized and …

    odu Repository record for Nonlinear Random Response of Large-Scale Sparse Finite Element Plate Bending Problems (opens in a new tab)

  13. Improving Deep Learning Models in Weakly Supervised Learning Paradigms

    Convolutional Neural Networks (CNNs) have provided promising achievements for image classification problems. However, training a CNN model relies on a large number of labeled data. Considering the vast amount of unlabeled data available on the web, it is important to make use of these data in …

    wvu Repository record for Improving Deep Learning Models in Weakly Supervised Learning Paradigms (opens in a new tab)