Learning Markov random walks for robust subspace clustering and estimation

DOI10.1016/J.NEUNET.2014.06.005zbMath1325.62124OpenAlexW2145326904WikidataQ38227403 ScholiaQ38227403MaRDI QIDQ889299

Zhouchen Lin, Risheng Liu, Zhi-Xun 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

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

Related Items (3)

Unnamed Item ⋮ Estimation of Graphical Models through Structured Norm Minimization ⋮ Sparse subspace clustering for data with missing entries and high-rank matrix completion

Cites Work

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

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