Fetching the paper…
Reading the bibliography…
Given full or partial information about a collection of points that lie close to a union of several subspaces, subspace clustering refers to the process of clustering the points according to their subspace and identifying the subspaces.
An elementary introduction to modern convex geometry
Keith Ball · 1997
Earlier work this paper cites.
A multibody factorization method for independently moving objects
João Paulo Costeira and Takeo Kanade · 1998
Earlier work this paper cites.
K-plane clustering
Paul Bradley and Olvi Mangasarian · 2000
Earlier work this paper cites.
Motion segmentation by subspace separation and model selection
Kenichi Kanatani · 2001
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
Andrew Ng, Michael Jordan, and Yair Weiss · 2002
Earlier work this paper cites.
Building text classifiers using positive and unlabeled examples
Bing Liu, Yang Dai, Xiaoli Li, Wee Sun Lee, and Philip Yu · 2003
Earlier work this paper cites.
Multibody factorization with uncertainty and missing data using the em algorithm
Amit Gruber and Yair Weiss · 2004
Earlier work this paper cites.
Motion segmentation with missing data using PowerFactorization and GPCA
René Vidal and Richard Hartley · 2004
Earlier work this paper cites.
Knowledge discovery from structured mammography reports using inductive logic programming
Elizabeth Burnside, Jesse Davis, Vítor Santos Costa, Inês de Castro Dutra, Charles Kahn Jr, Jason Fine, and David Page · 2005
Earlier work this paper cites.
Radii of regular polytopes
René Brandenberg · 2005
Earlier work this paper cites.
Generalized principal component analysis GPCA
Rene Vidal, Yi Ma, and Shankar Sastry · 2005
Earlier work this paper cites.
Multiscale hybrid linear models for lossy image representation
Wei Hong, John Wright, Kun Huang, and Yi Ma · 2006
Earlier work this paper cites.
Modelling distribution and abundance with presence-only data
Jennie Pearce and Mark Boyce · 2006
Cited alongside, same era.
A tutorial on spectral clustering
Ulrike Von Luxburg · 2007
Cited alongside, same era.
Learning classifiers from only positive and unlabeled data
Charles Elkan and Keith Noto · 2008
Cited alongside, same era.
Motion segmentation via robust subspace separation in the presence of outlying, incomplete, or corrupted trajectories
Shankar Rao, Roberto Tron, René Vidal, and Yi Ma · 2008
Cited alongside, same era.
Unsupervised segmentation of natural images via lossy data compression
Allen Yang, John Wright, Yi Ma, and Shankar Sastry · 2008
Cited alongside, same era.
Sparse subspace clustering
Ehsan Elhamifar and René Vidal · 2009
Cited alongside, same era.
A geometric analysis of subspace clustering with outliers
Mahdi Soltanolkotabi and Emmanuel Candés · 2012
Later among the works it cites.
Guess who rated this movie: Identifying users through subspace clustering
Amy Zhang, Nadia Fawaz, Stratis Ioannidis, and Andrea Montanari · 2012
Later among the works it cites.
Finite-sample equivalence in statistical models for presence-only data
William Fithian and Trevor Hastie · 2013
Later among the works it cites.
Robust subspace clustering
Mahdi Soltanolkotabi, Ehsan Elhamifar, and Emmanuel Candés · 2014
Later among the works it cites.
Sparse subspace clustering with missing entries
Congyuan Yang, Daniel Robinson, and René Vidal · 2015
Later among the works it cites.
High-rank matrix completion and clustering under self-expressive models
Ehsan Elhamifar · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Presence-only data and the em algorithm
Gill Ward, Trevor Hastie, Simon Barry, Jane Elith, and John Leathwick · 2009
Cited alongside, same era.
Templates for convex cone problems with applications to sparse signal recovery
Stephen R Becker, Emmanuel J Candès, and Michael C Grant · 2011
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein · 2011
Cited alongside, same era.
DomainImpute: Inferring unseen components in the internet
Brian Eriksson, Paul Barford, Joel Sommers, and Robert Nowak · 2011
Cited alongside, same era.
Exact matrix completion via convex optimization
Emmanuel Candès and Benjamin Recht · 2012
Cited alongside, same era.
High-rank matrix completion
Brian Eriksson, Laura Balzano, and Robert Nowak · 2012
Cited alongside, same era.
Later among the works it cites.
Group-sparse subspace clustering with missing data
Daniel Pimentel-Alarcón, Laura Balzano, Roummel Marcia, R Nowak, and Rebecca Willett · 2016
Later among the works it cites.
The information-theoretic requirements of subspace clustering with missing data
Daniel Pimentel-Alarcon and Robert Nowak · 2016
Later among the works it cites.
Noisy sparse subspace clustering
Yu-Xiang Wang and Huan Xu · 2016
Later among the works it cites.
Low algebraic dimension matrix completion
D. Pimentel-Alarcón, G. Ongie, L. Balzano, R. Willett, and R. Nowak · 2017
Closest in time.
Theoretical analysis of sparse subspace clustering with missing entries
Manolis C. Tsakiris and Rene Vidal · 2018
Closest in time.