By Topic

Network-based learning through particle competition 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
$33 $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)
Silva, T.C. ; Dept. of Comput. Sci., Univ. of Sao Paulo (USP), São Carlos, Brazil ; Liang Zhao

Complex network provides a general scheme for machine learning. In this paper, we propose a competitive learning mechanism realized on large scale networks, where several particles walk in the network and compete with each other to occupy as many nodes as possible. Each particle can perform a random walk by choosing any neighbor to visit, a deterministic walk by choosing to visit the node with the highest domination, or a combination of them. A computational complexity analysis is developed of the proposed algorithm. Computer simulations performed on several real-world data sets, including a large scale data set, reveal attractive results when the model is applied for data clustering problems.

Published in:

Neural Networks (IJCNN), The 2011 International Joint Conference on

Date of Conference:

July 31 2011-Aug. 5 2011