By Topic

Sign-based spectral clustering

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
$31 $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

2 Author(s)
Kung, H.T. ; Harvard Sch. of Eng. & Appl. Sci., Cambridge, MA, USA ; Vlah, D.

Sign-based spectral clustering performs data grouping based on signs of components in the eigenvectors of the input. This paper introduces the concept of sign-based clustering, proves some of its basic properties and describes its use in applications. It is shown that for certain applications where a relatively small number of clusters are sought the sign-based approach can greatly simplify clustering by just examining the signs of components in the eigenvectors, while improving the speed and robustness of the clustering process. For other such applications, it can provide useful initial approximations in improving the performance of cluster searching heuristics such as k-means.

Published in:

Communications (QBSC), 2010 25th Biennial Symposium on

Date of Conference:

12-14 May 2010