Next Article in Journal
A Multiscale Approach to the Smart Deployment of Micro-Sensors over Lightweight Structures
Next Article in Special Issue
Constrained Active Learning for Anchor Link Prediction Across Multiple Heterogeneous Social Networks
Previous Article in Journal
Design and Implementation of a Smart Home System Using Multisensor Data Fusion Technology
Previous Article in Special Issue
Node Scheduling Strategies for Achieving Full-View Area Coverage in Camera Sensor Networks
Article Menu
Issue 7 (July) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(7), 1633;

Non-Convex Sparse and Low-Rank Based Robust Subspace Segmentation for Data Mining

School of Information Science & Technology, Donghua University, Shanghai 200051, China
Department of Electronic Engineering, City University of Hong Kong, Kowloon 999077, Hong Kong, China
School of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK 74464, USA
Author to whom correspondence should be addressed.
Received: 16 June 2017 / Revised: 8 July 2017 / Accepted: 10 July 2017 / Published: 15 July 2017
Full-Text   |   PDF [2241 KB, uploaded 17 July 2017]   |  


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. View Full-Text
Keywords: subspace segmentation; low-rank representation; non-convex; LADMAP subspace segmentation; low-rank representation; non-convex; LADMAP

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Cheng, W.; Zhao, M.; Xiong, N.; Chui, K.T. Non-Convex Sparse and Low-Rank Based Robust Subspace Segmentation for Data Mining. Sensors 2017, 17, 1633.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top