Learning Markov random walks for robust subspace clustering and estimation

DOI10.1016/J.NEUNET.2014.06.005MaRDI QIDQ889299zbMATH OpenOpenAlexWikidataFDO

Authors Risheng Liu, Zhouchen Lin, Zhixun Su

Publication date 6 November 2015

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.neunet.2014.06.005

zbMATH Keywords

dimensionality reductionspectral clusteringMarkov random walkssubspace clustering and estimationtransition probability learning

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Estimation in multivariate analysis (62H12) Sums of independent random variables; random walks (60G50)

Recommendations

• Multiple kernel low-rank representation-based robust multi-view subspace clustering
• A similarity graph construction method based on Markov random walker for spectral clustering
• An efficient matrix factorization based low-rank representation for subspace clustering
• Learning transformations for clustering and classification
• Block diagonal representation learning for robust subspace clustering

Cites work

• scientific article; zbMATH DE number 5693526 (Why is no real title available?)
• scientific article; zbMATH DE number 2061729 (Why is no real title available?)
• scientific article; zbMATH DE number 5019925 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A Singular Value Thresholding Algorithm for Matrix Completion
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• Block-Sparse Recovery via Convex Optimization
• Exact matrix completion via convex optimization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Principal component analysis.
• Robust algebraic segmentation of mixed rigid-body and planar motions from two views
• Robust principal component analysis?
• Updating the Inverse of a Matrix

Cited in

(3)

• Estimation of graphical models through structured norm minimization
• scientific article; zbMATH DE number 7370572 (Why is no real title available?)
• Sparse subspace clustering for data with missing entries and high-rank matrix completion

This page was built for publication: Learning Markov random walks for robust subspace clustering and estimation

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