Learning Markov random walks for robust subspace clustering and estimation

DOI10.1016/J.NEUNET.2014.06.005zbMATH Open1325.62124OpenAlexW2145326904WikidataQ38227403 ScholiaQ38227403MaRDI QIDQ889299FDOQ889299

Zhouchen Lin, Zhixun Su, Risheng Liu

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

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

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)

Cites Work

• Principal component analysis.
• Title not available (Why is that?)
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Title not available (Why is that?)
• Exact matrix completion via convex optimization
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Updating the Inverse of a Matrix
• Title not available (Why is that?)
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Title not available (Why is that?)
• Block-Sparse Recovery via Convex Optimization
• Robust algebraic segmentation of mixed rigid-body and planar motions from two views
• Title not available (Why is that?)

Cited In (3)

• Sparse subspace clustering for data with missing entries and high-rank matrix completion
• Title not available (Why is that?)
• Estimation of Graphical Models through Structured Norm Minimization

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)