DP-Space: Bayesian Nonparametric Subspace Clustering with Small-Variance Asymptotics
Abstract
Subspace clustering separates data points approximately lying on union of affine subspaces into several clusters. This paper presents a novel nonparametric Bayesian subspace clustering model that infers both the number of subspaces and the dimension of each subspace from the observed data. Though the posterior inference is hard, our model leads to a very efficient deterministic algorithm, DP-space, which retains the nonparametric ability under a small-variance asymptotic analysis. DP-space monotonically minimizes an intuitive objective with an explicit tradeoff between data fitness and model complexity. Experimental results demonstrate that DP-space outperforms various competitors in terms of clustering accuracy and at the same time it is highly efficient.
Cite
Text
Wang and Zhu. "DP-Space: Bayesian Nonparametric Subspace Clustering with Small-Variance Asymptotics." International Conference on Machine Learning, 2015.Markdown
[Wang and Zhu. "DP-Space: Bayesian Nonparametric Subspace Clustering with Small-Variance Asymptotics." International Conference on Machine Learning, 2015.](https://mlanthology.org/icml/2015/wang2015icml-dpspace/)BibTeX
@inproceedings{wang2015icml-dpspace,
title = {{DP-Space: Bayesian Nonparametric Subspace Clustering with Small-Variance Asymptotics}},
author = {Wang, Yining and Zhu, Jun},
booktitle = {International Conference on Machine Learning},
year = {2015},
pages = {862-870},
volume = {37},
url = {https://mlanthology.org/icml/2015/wang2015icml-dpspace/}
}