title: Information Theoretic Subspace Clustering.
abstract: This paper addresses the problem of grouping the data points sampled from a union of multiple subspaces in the presence of outliers. Information theoretic objective functions are proposed to combine structured low-rank representations (LRRs) to capture the global structure of data and information theoretic measures to handle outliers. In theoretical part, we point out that group sparsity-induced measures ( l2,1-norm, lα-norm, and correntropy) can be justified from the viewpoint of half-quadratic (HQ) optimization, which facilitates both convergence study and algorithmic development. In particular, a general formulation is accordingly proposed to unify HQ-based group sparsity methods into a common framework. In algorithmic part, we develop information theoretic subspace clustering methods via correntropy. With the help of Parzen window estimation, correntropy is used to handle either outliers under any distributions or sample-specific errors in data. Pairwise link constraints are further treated as a prior structure of LRRs. Based on the HQ framework, iterative algorithms are developed to solve the nonconvex information theoretic loss functions. Experimental results on three benchmark databases show that our methods can further improve the robustness of LRR subspace clustering and outperform other state-of-the-art subspace clustering methods.
authors.forename: Ran
authors.initials: R
authors.lastname: He
authors.forename: Liang
authors.initials: L
authors.lastname: Wang
authors.forename: Zhenan
authors.initials: Z
authors.lastname: Sun
authors.forename: Yingya
authors.initials: Y
authors.lastname: Zhang
authors.forename: Bo
authors.initials: B
authors.lastname: Li