4.7 Article

Parameter-Free Weighted Multi-View Projected Clustering with Structured Graph Learning

Journal

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume 32, Issue 10, Pages 2014-2025

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2019.2913377

Keywords

Clustering methods; Task analysis; Dimensionality reduction; Laplace equations; Visualization; Clustering algorithms; Biomedical optical imaging; Multi-view clustering; dimensionality reduction; structured graph learning

Funding

  1. National Natural Science Foundation of China [U1803263, 61772427, 61751202, 61871470]

Ask authors/readers for more resources

In many real-world applications, we are often confronted with high dimensional data which are represented by various heterogeneous views. How to cluster this kind of data is still a challenging problem due to the curse of dimensionality and effectively integration of different views. To address this problem, we propose two parameter-free weighted multi-view projected clustering methods which perform structured graph learning and dimensionality reduction simultaneously. We can use the obtained structured graph directly to extract the clustering indicators, without performing other discretization procedures as previous graph-based clustering methods have to do. Moreover, two parameter-free strategies are adopted to learn an optimal weight for each view automatically, without introducing a regularization parameter as previous methods do. Extensive experiments on several public datasets demonstrate that the proposed methods outperform other state-of-the-art approaches and can be used more practically.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available