By Topic

Spectral clustering algorithm based on adaptive neighbor distance sort order

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

3 Author(s)
Yifei Zhang ; School of Software University of Electronic Science and Technology of China, Chengdu 610054, P. R. China ; Junlin Zhou ; Yan Fu

Spectral clustering has been widely used in data mining in the past years. The performance of spectral clustering is very sensitive to the selection of scale parameter. Especially, when data has multi-scale it is very difficult to find a proper value for the scale parameter. To solve the problem, an improved method based on adaptive neighbor distance sort order has been proposed in this paper. The method enlarges the affinity between two points in the same cluster and reduces that in different clusters. Our experiments on the synthetic and real life datasets have shown promising results comparing with tradition method and k-means.

Published in:

Information Sciences and Interaction Sciences (ICIS), 2010 3rd International Conference on

Date of Conference:

23-25 June 2010