返回
Parameter-Free Weighted Multi-View Projected Clustering with Structured Graph Learning
DOI:10.1109/TKDE.2019.2913377.png)
摘要
En 中文
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.
Keyword:
Clustering methods
Task analysis
Dimensionality reduction
Laplace equations
Visualization
Clustering algorithms
Biomedical optical imaging
Multi-view clustering
dimensionality reduction
structured graph learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Auto-Weighted Multi-View Learning for Image Clustering and Semi-Supervised Classification用于图像聚类和半监督分类的自动加权多视图学习
Crystalline‐State Reaction with Allosteric Effect in Spin‐Crossover, Interpenetrated Networks with Magnetic and Optical Bistability具有磁和光学双稳态的自旋交叉,互穿网络中具有变构效应的晶态反应

