By Topic

A Clustering Algorithm Based on Square Inaccuracy Density

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

6 Author(s)
Jianxiao Chen ; Dept. of Math. & Inf. Technol., Hanshan Normal Univ., Chaozhou, China ; Renbiao Wang ; Le Huang ; Han Yin
more authors

This paper proposed a kind of clustering algorithm based on square inaccuracy density. This algorithm adopted Square Inaccuracy density Function to fix on the parameter in clustering algorithm in order to avoid the problem caused by the random and subjective setting of the initial center of mass. In addition, this algorithm also brought in backtrack strategy to avoid the questions caught by the local solution. The experiment suggested that this algorithm can get a better result when it meets that the clustering points congregate in the form of sphere.

Published in:

Intelligent Networks and Intelligent Systems (ICINIS), 2011 4th International Conference on

Date of Conference:

1-3 Nov. 2011