By Topic

Connectionist approach for 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)
Babu, G.P. ; Dept. of Comput. Sci. & Autom., Inst. of Sci., Bangalore, India ; Murty, M.N.

This paper presents a stochastic connectionist approach for cluster analysis. Clustering problem is formulated as a real-parameter function optimization problem and is solved using the proposed approach. As the proposed connectionist approach performs stochastic search, it avoids getting stuck in a local minimum, and guarantees asymptotic convergence to optimal solution. The amenability of connectionist approaches to massive parallelization enables one to obtain linear speedup with available parallel hardware. Several data sets are clustered using the proposed approach and the partitions obtained are (near) optimal in nature. Results pertaining to some important data sets are presented

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994