Exemplar-based low-rank matrix decomposition for data clustering

DOI10.1007/s10618-014-0347-0zbMath1403.68217OpenAlexW2110531972MaRDI QIDQ1711222

Ming Dong, Li-Jun Wang

Publication date: 17 January 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-014-0347-0

zbMATH Keywords

clusteringmatrix decompositionlow-rank approximationsubspaces

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Canonical forms, reductions, classification (15A21)

Related Items

Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction

Uses Software

• Algorithm 844
• Colibri

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Community discovery using nonnegative matrix factorization
• Clustering large graphs via the singular value decomposition
• Algorithms and applications for approximate nonnegative matrix factorization
• Estimating the dimension of a model
• Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
• Principal component analysis.
• Fast computation of low-rank matrix approximations
• Computational Methods for Integral Equations
• The minimum description length principle in coding and modeling
• 10.1162/153244303321897735
• Less is More: Sparse Graph Mining with Compact Matrix Decomposition
• Learning the parts of objects by non-negative matrix factorization
• Multiplicative Updates for Nonnegative Quadratic Programming
• Algorithm 844
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition