Cart (Loading....) | Create Account
Close category search window
 

A new hybrid learning-based 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

2 Author(s)
Khoshdel, H. ; Dept. of Comput. Eng., Islamic Azad Univ., Shirvan, Iran ; Saman, B.

In this paper a new hybrid algorithm based on particle swarm optimization (PSO), k-means and learning automata (KPSOLA) is proposed for data clustering. In the proposed algorithm, learning automata acts as the thinking brain of the particles in PSO. In each of iterations of the proposed algorithm execution, corresponding learning automata of each particle decides whether next move of that particle to be with respect to PSO algorithm or with respect to k-means algorithm. The proposed algorithm and also 4 other clustering algorithms have been used for clustering 6 standard datasets and their efficiencies are compared with each other. Experimental results show that the proposed algorithm has an acceptable efficiency and robustness.

Published in:

Artificial Intelligence and Signal Processing (AISP), 2012 16th CSI International Symposium on

Date of Conference:

2-3 May 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.