By Topic

A robust deterministic annealing algorithm for data 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

3 Author(s)
Xulei Yang ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Qing Song ; Sheng Liu

In this paper, a new robust deterministic annealing (RDA) clustering algorithm is proposed. This method takes advantages of conventional noise clustering (NC) and deterministic annealing (DA) algorithms in terms of independence of data initialization, ability to avoid poor local optima, better performance for unbalanced data, and robustness against noise. The superiority of the proposed RDA clustering algorithm is supported by simulation results.

Published in:

Neural Networks, 2005. IJCNN '05. Proceedings. 2005 IEEE International Joint Conference on  (Volume:3 )

Date of Conference:

31 July-4 Aug. 2005