Name
Title | ||
|---|---|---|
A stochastic connectionist approach for global optimization withapplication to pattern clustering |
Abstract | ||
|---|---|---|
In this paper, a stochastic connectionist approach is proposed for solving function optimization problems with real-valued parameters. With the assumption of increased processing capability of a node in the connectionist network, we show how a broader class of problems can be solved. As the proposed approach is a stochastic search technique, it avoids getting stuck in local optima. Robustness of the approach is demonstrated on several multi-modal functions with different numbers of variables. Optimization of a well-known partitional clustering criterion, the squared-error criterion (SEC), is formulated as a function optimization problem and is solved using the proposed approach. This approach is used to cluster selected data sets and the results obtained are compared with that of the K-means algorithm and a simulated annealing (SA) approach. The amenability of the connectionist approach to parallelization enables effective use of parallel hardware |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/3477.826943 | IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics |
Keywords | DocType | Volume |
stochastic search technique,multi-modal function,squared-error criterion,connectionist network,function optimization problem,proposed approach,K-means algorithm,broader class,global optimization withapplication,stochastic connectionist approach,pattern clustering,connectionist approach | Journal | 30 |
Issue | ISSN | Citations |
1 | 1083-4419 | 5 |
PageRank | References | Authors |
2.22 | 24 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. P. Babu | 1 | 5 | 2.22 |
| N. M. Murty | 2 | 5 | 2.22 |
| S. Sathiya Keerthi | 3 | 4455 | 527.30 |