By Topic

A Weighted Cluster Ensemble Algorithm Based on Graph

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

5 Author(s)
Fan Xiao-ping ; Coll. of Inf. Sci. & Eng., Central South Univ., Changsha, China ; Xie Yue-shan ; Liao Zhi-fang ; Li Xiao-qing
more authors

Cluster ensemble is an effective method to improve the effect in data clustering, but the results of the existing cluster ensemble algorithms are usually not so good when they process the mixed attributes datas, the main reason is that the results of the algorithms are still dispersed. To solve this problem, this paper presents a new weighted cluster ensemble algorithm based on graph theory. It first clusters the datasets and gets cluster members, and then sets weights to each data object with a proposed ensemble function, and determines the relationship between the data-pair by setting weights to the edges between them, so it can get a weighted nearest neighbor graph. At last it does a last-clustering based on graph theory. Experiments show that the accuracy and stability of this cluster ensemble algorithm is better than other clustering ensemble algorithms.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Date of Conference:

16-18 Nov. 2011