arrow
返回

Discrete Optimal Graph Clustering

delete2020-04-01
delete45
delete
OA
AI
Y
Yudong Han
L
Lei Zhu *
程
程志勇 (Zhiyong Cheng)
J
Jingjing Li
X
Xiaobai Liu
DOI:10.1109/TCYB.2018.2881539delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Graph-based clustering is one of the major clustering methods. Most of it works in three separate steps: 1) similarity graph construction; 2) clustering label relaxing; and 3) label discretization with k-means (KM). Such common practice has three disadvantages: 1) the predefined similarity graph is often fixed and may not be optimal for the subsequent clustering; 2) the relaxing process of cluster labels may cause significant information loss; and 3) label discretization may deviate from the real clustering result since KM is sensitive to the initialization of cluster centroids. To tackle these problems, in this paper, we propose an effective discrete optimal graph clustering framework. A structured similarity graph that is theoretically optimal for clustering performance is adaptively learned with a guidance of reasonable rank constraints. Besides, to avoid the information loss, we explicitly enforce a discrete transformation on the intermediate continuous label, which derives a tractable optimization problem with a discrete solution. Furthermore, to compensate for the unreliability of the learned labels and enhance the clustering accuracy, we design an adaptive robust module that learns the prediction function for the unseen data based on the learned discrete cluster labels. Finally, an iterative optimization strategy guaranteed with convergence is developed to directly solve the clustering results. Extensive experiments conducted on both real and synthetic datasets demonstrate the superiority of our proposed methods compared with several state-of-the-art clustering approaches.
Keyword:
Discrete label learning
information loss
optimal graph
out-of-sample
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

Q
Qilu University of Technology
学者数:
1.1W
论文数: 8.9K
被引数: 16
California State University System 封面图
California State University System
学者数:
2.8W
论文数: 2.4W
被引数: 457
S
shandong normal university
学者数:
1.0W
论文数: 8.2K
被引数: 3
学者 查看更多机构
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
Supervised discrete discriminant hashing for image retrieval
err2018-06-01
err28
errOAAI
errCui, Yan; Jiang, Jielin; Lai, Zhihui; Hu, Zuojin; Wong, WaiKeung
err分享
err收藏
Heterogeneous Domain Adaptation Through Progressive Alignment
err2019-05-01
err169
PREAI
errLi, Jingjing; Lu, Ke; Huang, Zi; Zhu, Lei; Shen, Heng Tao
err分享
err收藏
Learning Discriminative Binary Codes for Large-scale Cross-modal Retrieval
err2017-05-01
err382
PREAI
errXu, Xing; Shen, Fumin; Yang, Yang; Shen, Heng Tao; Li, Xuelong
err分享
err收藏
err分享
err收藏
学者 查看更多内容