Clustering using simulated annealing with probabilistic redistribution

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 15, Issue 2, 2001, Pages 269-285

  Bandyopadhyay, Sanghamitra ^a   Maulik, Ujjwal ^b   Pakhira, Malay Kumar ^b  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b KALYANI GOVERNMENT ENGINEERING COLLEGE   (India)

Author keywords

Euclidean distance; K means algorithm; Partitional clustering; Pattern recognition; Simulated annealing; Temperature scheduling

Indexed keywords

COMBINATORIAL MATHEMATICS; GENETIC ALGORITHMS; PATTERN RECOGNITION; PROBABILITY DISTRIBUTIONS; THERMOANALYSIS;

PARTITIONAL CLUSTERING; PROBABILISTIC REDISTRIBUTIONS;

SIMULATED ANNEALING;

EID: 0035273381     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001401000927     Document Type: Article

References (25)

1. Simulated annealing based pattern classification
2. Some new indexes of cluster validity
3. The use of multiple measurements in taxonomic problems
4. A self organizing network for hyperellipsoidal clustering (HEC)
5. Optimization by simulated annealing
6. A branch and bound clustering algorithm
7. A graph theoretic approach to nonparametric cluster analysis
8. In search of optimal clusters using genetic algorithms
9. Fuzzy sets and decision making approaches in vowel and speaker recognition
10. K-means type algorithms: A generalized convergence theorem and characterization of local optimality
11. Fast simulated annealing
12. A cost minimization approach to edge detection using simulated annealing
13. Pattern clustering by multivariate mixture analysis
14. Clustering merging based weighted mahalanobis distance with application in digital mamograph