.png){kind=icon}
Return
Adaptive Projected Matrix Factorization method for data clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2018.04.031.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data clustering aims to group the data samples into clusters, and has attracted many researchers in a variety of multidisciplinary fields, such as machine learning and data mining. In order to capture the geometry structure, many methods perform clustering according to a predefined affinity graph. So the clustering performance is largely determined by the graph quality. Unfortunately, the graph quality cannot be guaranteed in various real-world applications. In this paper, an Adaptive Projected Matrix Factorization (APMF) method is proposed for data clustering. Our contributions are threefold: (1) instead of keeping the graph fixed, graph learning is taken as a part of the clustering procedure; (2) the clustering is performed in the projected subspace, so the noise in the input data space is alleviated; (3) an efficient and effective algorithm is developed to solve the proposed problem, and its convergence is proved. Extend experiments on nine real-world benchmarks validate the effectiveness of the proposed method, and verify its superiority against the state-of-the-art competitors. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Clustering
Graph learning
Subspace learning
Matrix factorization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
.png){kind=icon}
Ability of troponin I to predict cardiac events in patients admitted from the emergency department
PREAI
ShareSaveShareSave
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients
PREAI
ShareSaveShareSave
View more