Effective and Adaptive Refined Multi-metric Similarity Graph Fusion for Multi-view Clustering

Wentao Rong, Enhong Zhuo, Guihua Tao, Hongmin Cai

Abstract

Multi-view graph-based clustering aims to partition samples via fusing similarity graphs from different views into a unified graph. The clustering performance relies on the accuracy of similarity measurement. However, most existing methods utilize a single metric whose similarity measurement can be easily corrupted by noises thus lacking high accuracy and generalization capability. We propose an effective multi-metric similarity graph refinement and fusion method for multi-view clustering. We construct multiple similarity graphs for each view by different metric, exploit a novel refined similarity through symmetric conditional probability to preserve the important similarity information and finally adaptively fuse multiple refined similarity graphs to an informative unified one. Extensive experiments on eight benchmark datasets have validated the effectiveness and superiority of our proposed method comparing to thirteen state-of-the-art methods.
BibTeX
@inproceedings{rong2021effective,
  author = {Wentao Rong and Enhong Zhuo and Guihua Tao and Hongmin Cai},
  title = {{Effective and Adaptive Refined Multi-metric Similarity Graph Fusion for Multi-view Clustering}},
  booktitle = {PAKDD},
  year = {2021},
  doi = {10.1007/978-3-030-75765-6\_16},
}

Loading related content...

Figure