Non-convex sparse and low-rank based robust subspace segmentation for data mining

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

18 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number1633
Journal / PublicationSensors (Switzerland)
Volume17
Issue number7
Publication statusPublished - 15 Jul 2017

Link(s)

Abstract

Parsimony, including sparsity and low-rank, has shown great importance for data mining in social networks, particularly in tasks such as segmentation and recognition. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with convex l1-norm or nuclear norm constraints. However, the obtained results by convex optimization are
usually suboptimal to solutions of original sparse or low-rank problems. In this paper, a novel robust subspace segmentation algorithm has been proposed by integrating lp-norm and Schatten p-norm constraints. Our so-obtained affinity graph can better capture local geometrical structure and the global information of the data. As a consequence, our algorithm is more generative, discriminative
and robust. An efficient linearized alternating direction method is derived to realize our model. Extensive segmentation experiments are conducted on public datasets. The proposed algorithm is revealed to be more effective and robust compared to five existing algorithms.

Research Area(s)

  • LADMAP, Low-rank representation, Non-convex, Subspace segmentation

Citation Format(s)

Non-convex sparse and low-rank based robust subspace segmentation for data mining. / Cheng, Wenlong; Zhao, Mingbo; Xiong, Naixue et al.
In: Sensors (Switzerland), Vol. 17, No. 7, 1633, 15.07.2017.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

Download Statistics

No data available