Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/75698
Title: Robust dual clustering with adaptive manifold regularization
Authors: Zhao, NW
Zhang, LF
Du, B
Zhang, Q
You, J 
Tao, DC
Keywords: Clustering
Matrix factorization
Manifold regularization
Dimension reduction
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on knowledge and data engineering, 2017, v. 29, no. 11, p. 2498-2509 How to cite?
Journal: IEEE transactions on knowledge and data engineering 
Abstract: In recent years, various data clustering algorithms have been proposed in the data mining and engineering communities. However, there are still drawbacks in traditional clustering methods which are worth to be further investigated, such as clustering for the high dimensional data, learning an ideal affinity matrix which optimally reveals the global data structure, discovering the intrinsic geometrical and discriminative properties of the data space, and reducing the noises influence brings by the complex data input. In this paper, we propose a novel clustering algorithm called robust dual clustering with adaptive manifold regularization (RDC), which simultaneously performs dual matrix factorization tasks with the target of an identical cluster indicator in both of the original and projected feature spaces, respectively. Among which, the l(2,1)-norm is used instead of the conventional l(2)-norm to measure the loss, which helps to improve the model robustness by relieving the influences by the noises and outliers. In order to better consider the intrinsic geometrical and discriminative data structure, we incorporate the manifold regularization term on the cluster indicator by using a particularly learned affinity matrix which is more suitable for the clustering task. Moreover, a novel augmented lagrangian method (ALM) based procedure is designed to effectively and efficiently seek the optimal solution of the proposed RDC optimization. Numerous experiments on the representative data sets demonstrate the superior performance of the proposed method compares to the existing clustering algorithms.
URI: http://hdl.handle.net/10397/75698
ISSN: 1041-4347
EISSN: 1558-2191
DOI: 10.1109/TKDE.2017.2732986
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
Citations as of Nov 13, 2018

Page view(s)

25
Last Week
1
Last month
Citations as of Nov 11, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.