Cart (Loading....) | Create Account
Close category search window
 

A Fast Spectral Method to Solve Document Cluster Ensemble Problem

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

3 Author(s)
Sen Xu ; Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin ; Zhimao Lu ; Guochang Gu

The critical problem in cluster ensemble is how to combine clusterers to yield a final superior clustering result. In this paper, we introduce a spectral method to solve document cluster ensemble problem. Since spectral clustering inevitably needs to compute the eigenvalues and eigenvectors of a matrix, for large scale document datasets, itpsilas computationally intractable. By using algebraic transformation to similarity matrix we get a feasible algorithm. Experiments on TREC and Reuters document sets show that our spectral algorithm yields better clustering results than other typical cluster ensemble techniques without high computational cost.

Published in:

Computer and Computational Sciences, 2008. IMSCCS '08. International Multisymposiums on

Date of Conference:

18-20 Oct. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.