A Max‐Flow‐Based Similarity Measure for Spectral Clustering

• Published in: ETRI journal Vol. 35; no. 2; pp. 311 - 320
• Main Authors: Cao, Jiangzhong, Chen, Pei, Zheng, Yun, Dai, Qingyun
• Format: Journal Article
• Language: English
• Published: 한국전자통신연구원 01.04.2013
• Subjects: affinity graph; maximum flow; similarity measure; Spectral clustering; 전자/정보통신공학
• ISSN: 1225-6463; 2233-7326
• DOI: 10.4218/etrij.13.0112.0520

In most spectral clustering approaches, the Gaussian kernel‐based similarity measure is used to construct the affinity matrix. However, such a similarity measure does not work well on a dataset with a nonlinear and elongated structure. In this paper, we present a new similarity measure to deal with the nonlinearity issue. The maximum flow between data points is computed as the new similarity, which can satisfy the requirement for similarity in the clustering method. Additionally, the new similarity carries the global and local relations between data. We apply it to spectral clustering and compare the proposed similarity measure with other state‐of‐the‐art methods on both synthetic and real‐world data. The experiment results show the superiority of the new similarity: 1) The max‐flow‐based similarity measure can significantly improve the performance of spectral clustering; 2) It is robust and not sensitive to the parameters.