By Topic

An improved PAM algorithm for optimizing initial cluster center

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)
Feng Bo ; Eng. Inst. of Corps of Eng., PLA Univ. of Sci. &Technol., Nanjing, China ; Hao Wenning ; Chen Gang ; Jin Dawei
more authors

To solve the inefficiency problem of traditional PAM algorithm for initial cluster center, a new improved PAM algorithm is proposed. The algorithm builds minimum spanning tree and then splits it to get k initial clusters with the relevant cluster centers. Theory analysis and experimental results show that the found initial centers are closed to the desired cluster centers, and the improved algorithm can achieve stable clustering results and higher cluster clustering accuracy.

Published in:

Software Engineering and Service Science (ICSESS), 2012 IEEE 3rd International Conference on

Date of Conference:

22-24 June 2012