By Topic

Multiscale Spectral Clustering Using Random Walk Based Similarity Measure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Haixia Xu ; Sch. of Comput. Sci., Northwestern Polytech. Univ., Xi'an, China ; Zheng Tian ; Mingtao Ding ; Xianbin Wen

This paper presents a new concept on characterizing the similarity between nodes of a weighted undirected graph with application to multiscale spectral clustering. The contribution may be divided into three parts. First, the generalized mean first-passage time (GMFPT) and the generalized mean recurrence time (GMRT) are proposed based on the multi-step transition probability of the random walk on graph. The GMFPT can capture similarities at different scales in data sets as the number of step of transition probability varies. Second, an efficient computational technique is proposed to present the GMFPT in term of the element of the generalized fundamental matrix. Third, a multiscale algorithm is derived based on the weight matrix-based spectral clustering. Finally, Experimental results demonstrate the effectiveness of the proposed method.

Published in:

Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on  (Volume:1 )

Date of Conference:

14-16 Aug. 2009