Similarity-based clustering by left-stochastic matrix factorization

MaRDI QIDQ2933863zbMATH OpenFDO

Authors Raman Arora, Amol Kapila, Maryam Fazel, Maya R. Gupta

Publication date 8 December 2014

Full work available at URL http://jmlr.csail.mit.edu/papers/v14/arora13a.html

zbMATH Keywords

completely positiveindefinite kernelnon-negative matrix factorizationrotationsimilarity

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Low-rank doubly stochastic matrix decomposition for cluster analysis
• SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
• Nonnegative matrix factorization with local similarity learning
• Non-negative and sparse spectral clustering
• scientific article; zbMATH DE number 2062544

Cited in

(8)

• SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
• On some transformations of high dimension, low sample size data for nearest neighbor classification
• Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering
• Low-rank doubly stochastic matrix decomposition for cluster analysis
• Similarity matrix learning algorithm based on -norm and rank constraints
• Graph refinement via simultaneously low-rank and sparse approximation
• A Bregman–Kaczmarz method for nonlinear systems of equations
• A fast block nonlinear Bregman-Kaczmarz method with averaging for nonlinear sparse signal recovery

Describes a project that uses

Uses Software

• Multilinear Engine

This page was built for publication: Similarity-based clustering by left-stochastic matrix factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933863)