Robust Dimension Reduction for Clustering With Local Adaptive Learning

• Published in: IEEE transaction on neural networks and learning systems 2019-03, Vol.30 (3), p.657-669
• Main Authors: Wang, Xiao-Dong, Chen, Rung-Ching, Zeng, Zhi-Qiang, Hong, Chao-Qun, Yan, Fei
• Format: Article
• Language: English
• Subjects: <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">l ₂̦ ₁-norm; Adaptation models; Adaptive learning; Algorithms; Clustering; Clustering algorithms; Data mining; Data processing; Dimension reduction; Dimensionality reduction; Iterative methods; K-means; Learning; Linear programming; manifold learning; Manifolds; Pattern recognition; Robustness; Social networks; Social organization; State of the art; Subspaces
• ISSN: 2162-237X; 2162-2388
• DOI: 10.1109/TNNLS.2018.2850823

In pattern recognition and data mining, clustering is a classical technique to group matters of interest and has been widely employed to numerous applications. Among various clustering algorithms, K-means (KM) clustering is most popular for its simplicity and efficiency. However, with the rapid development of the social network, high-dimensional data are frequently generated, which poses a considerable challenge to the traditional KM clustering as the curse of dimensionality. In such scenarios, it is difficult to directly cluster such high-dimensional data that always contain redundant features and noises. Although the existing approaches try to solve this problem using joint subspace learning and KM clustering, there are still the following limitations: 1) the discriminative information in low-dimensional subspace is not well captured; 2) the intrinsic geometric information is seldom considered; and 3) the optimizing procedure of a discrete cluster indicator matrix is vulnerable to noises. In this paper, we propose a novel clustering model to cope with the above-mentioned challenges. Within the proposed model, discriminative information is adaptively explored by unifying local adaptive subspace learning and KM clustering. We extend the proposed model using a robust l_{2,1} -norm loss function, where the robust cluster centroid can be calculated in a weighted iterative procedure. We also explore and discuss the relationships between the proposed algorithm and several related studies. Extensive experiments on kinds of benchmark data sets demonstrate the advantage of the proposed model compared with the state-of-the-art clustering approaches.