Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
Medientyp:
E-Artikel
Titel:
Non-Convex Sparse and Low-Rank Based Robust Subspace Segmentation for Data Mining
Beteiligte:
Cheng, Wenlong;
Zhao, Mingbo;
Xiong, Naixue;
Chui, Kwok Tai
Erschienen:
MDPI AG, 2017
Erschienen in:
Sensors, 17 (2017) 7, Seite 1633
Sprache:
Englisch
DOI:
10.3390/s17071633
ISSN:
1424-8220
Entstehung:
Anmerkungen:
Beschreibung:
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.