Learning Markov random walks for robust subspace clustering and estimation
type: Item
instance of: scholarly article
title: Learning Markov random walks for robust subspace clustering and estimation
zbMATH Open document ID: 1325.62124
author: Risheng Liu
author: Zhouchen Lin
author: Zhixun Su
published in: Neural Networks
publication date: 2015-11-06T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 62H12
Mathematics Subject Classification ID: 60J20
Mathematics Subject Classification ID: 60G50
zbMATH DE Number: 6505394
zbMATH Keywords: spectral clustering
zbMATH Keywords: dimensionality reduction
zbMATH Keywords: Markov random walks
zbMATH Keywords: transition probability learning
zbMATH Keywords: subspace clustering and estimation
MaRDI profile type: Publication
full work available at URL: j.neunet.2014.06.005
OpenAlex ID: W2145326904
Wikidata QID: Q38227403
cites work: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Robust principal component analysis?
cites work: Exact matrix completion via convex optimization
cites work: Q5691133
cites work: Q4457477
cites work: Block-Sparse Recovery via Convex Optimization
cites work: Updating the Inverse of a Matrix
cites work: Principal component analysis.
cites work: Robust algebraic segmentation of mixed rigid-body and planar motions from two views
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Q3161693
cites work: Q5290281
cites work: Q3551221
DOI: 10.1016/J.NEUNET.2014.06.005
description: scientific article; zbMATH DE number 6505394