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 5 of 5 for “"Constrained low rank approximation"”.

  1. Scalable Data Mining via Constrained Low Rank Approximation

    Matrix and tensor approximation methods are recognised as foundational tools for modern data analytics. Their strength lies in their long history of rigorous and principled theoretical foundations, judicious formulations via various constraints, along with the availability of fast computer …

    gatech Repository record for Scalable Data Mining via Constrained Low Rank Approximation (opens in a new tab)

  2. Algorithms for Data Fusion, Representation Learning, and Scalable Clustering based on Constrained Low-Rank Approximation

    … challenges in modern data analysis through novel Constrained Low-Rank Approximation (CLRA) algorithms. Contemporary datasets often exhibit complex characteristics: multi-type heterogeneity with interconnected entities, information from diverse sources, inherent sparsity, and massive scale. …

    gatech Repository record for Algorithms for Data Fusion, Representation Learning, and Scalable Clustering based on Constrained Low-Rank Approximation (opens in a new tab)

  3. Nonnegative matrix factorization for text, graph, and hybrid data analytics

    Constrained low rank approximation is a general framework for data analysis, which usually has the advantage of being simple, fast, scalable and domain general. One of the most known constrained low rank approximation methods is nonnegative matrix factorization (NMF). This research studies the …

    gatech Repository record for Nonnegative matrix factorization for text, graph, and hybrid data analytics (opens in a new tab)

  4. Weighted Low-Rank Approximation of Matrices:Some Analytical and Numerical Aspects

    … and numerical aspects of a problem of weighted low-rank approximation of matrices. We propose and solve two different versions of weighted low-rank approximation problems. We demonstrate, in addition, how these formulations can be efficiently used to solve some classic problems in computer …

    ucf Repository record for Weighted Low-Rank Approximation of Matrices:Some Analytical and Numerical Aspects (opens in a new tab)

  5. Scalable and distributed constrained low rank approximations

    Low rank approximation is the problem of finding two low rank factors W and H such that the rank(WH) << rank(A) and A ≈ WH. These low rank factors W and H can be constrained for meaningful physical interpretation and referred as Constrained Low Rank Approximation (CLRA). Like most of the …

    gatech Repository record for Scalable and distributed constrained low rank approximations (opens in a new tab)