Exemplar-based low-rank matrix decomposition for data clustering (Q1711222): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10618-014-0347-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110531972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of low-rank matrix approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum description length principle in coding and modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and applications for approximate nonnegative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Methods for Integral Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large graphs via the singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning the parts of objects by non-negative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative Updates for Nonnegative Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Less is More: Sparse Graph Mining with Compact Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community discovery using nonnegative matrix factorization / rank
 
Normal rank

Latest revision as of 21:25, 17 July 2024

scientific article
Language Label Description Also known as
English
Exemplar-based low-rank matrix decomposition for data clustering
scientific article

    Statements

    Exemplar-based low-rank matrix decomposition for data clustering (English)
    0 references
    0 references
    0 references
    17 January 2019
    0 references
    clustering
    0 references
    low-rank approximation
    0 references
    subspaces
    0 references
    matrix decomposition
    0 references

    Identifiers