By Topic

Approximate distributed clustering by learning the confidence radius on Fisher discriminant ratio

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 $31
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)
Shen, X.J. ; Sch. of Comput. Sci. & Commun. Eng., Jiangsu Univ., Zhenjiang, China ; Zha, Z.J. ; Zhu, Q. ; Yang, H.B.
more authors

Presented is a new clustering algorithm with approximate distributed clustering over a peer-to-peer (P2P) network. The Fisher discriminant ratio is used to dynamically learn the confidence radius based on the data distribution in every local peer. Experimental results show that the proposed approach can achieve better clustering accuracies than the DFEKM algorithm while preserving much lower bandwidth consumptions.

Published in:

Electronics Letters  (Volume:48 ,  Issue: 14 )