메뉴 건너뛰기




Volumn 24, Issue 12, 2002, Pages 1650-1654

Performance evaluation of some clustering algorithms and validity indices

Author keywords

Euclidean distance; K means algorithm; Simulated annealing; Single linkage algorithm; Unsupervised classification; Validity index

Indexed keywords

DATA PROCESSING; DATA STRUCTURES; FUZZY SETS; GRAPH THEORY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SIMULATED ANNEALING;

EID: 0036937614     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2002.1114856     Document Type: Article
Times cited : (1178)

References (17)
  • 3
    • 0032650370 scopus 로고    scopus 로고
    • A robust competitive clustering algorithm with application in computer vision
    • Jan.
    • H. Frigui and R. Krishnapuram, "A Robust Competitive Clustering Algorithm with Application in Computer Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 1 pp. 450-465, Jan. 1999.
    • (1999) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.21 , Issue.1 , pp. 450-465
    • Frigui, H.1    Krishnapuram, R.2
  • 5
    • 0033715579 scopus 로고    scopus 로고
    • Genetic algorithm based clustering technique
    • U. Maulik and S. Bandyopadhyay, "Genetic Algorithm Based Clustering Technique," Pattern Recognition, vol. 33, pp. 1455-1465, 2000.
    • (2000) Pattern Recognition , vol.33 , pp. 1455-1465
    • Maulik, U.1    Bandyopadhyay, S.2
  • 6
    • 34250115918 scopus 로고
    • An examination of procedures for determining the number of clusters in a data set
    • G.W. Milligan and C. Cooper, "An Examination of Procedures for Determining the Number of Clusters in a Data Set," Psychometrika, vol. 50, no. 2, pp. 159-179, 1985.
    • (1985) Psychometrika , vol.50 , Issue.2 , pp. 159-179
    • Milligan, G.W.1    Cooper, C.2
  • 8
    • 0032269108 scopus 로고    scopus 로고
    • How many clusters? Which clustering method? Answers via model-based cluster analysis
    • C. Fraley and A.E. Raftery, "How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis," The Computer J., vol. 41, no. 8, pp. 578-588, 1998.
    • (1998) The Computer J. , vol.41 , Issue.8 , pp. 578-588
    • Fraley, C.1    Raftery, A.E.2
  • 11
    • 0015644825 scopus 로고
    • A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters
    • J.C. Dunn, "A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters," J. Cybernetics, vol. 3, pp. 32-57, 1973.
    • (1973) J. Cybernetics , vol.3 , pp. 32-57
    • Dunn, J.C.1
  • 12
    • 84972893020 scopus 로고
    • A dendrite method for cluster analysis
    • R.B. Calinski and J. Harabasz, "A Dendrite Method for Cluster Analysis," Comm. in Statistics, vol. 3, pp. 1-27, 1974.
    • (1974) Comm. in Statistics , vol.3 , pp. 1-27
    • Calinski, R.B.1    Harabasz, J.2
  • 13
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrik, C. Gelatt, and M. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, pp. 671-680, 1983.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrik, S.1    Gelatt, C.2    Vecchi, M.3
  • 16
    • 84941155240 scopus 로고
    • Well separated clusters and optimal fuzzy partitions
    • J.C. Dunn, "Well Separated Clusters and Optimal Fuzzy Partitions," J. Cybernetics, vol. 4, pp. 95-104, 1974.
    • (1974) J. Cybernetics , vol.4 , pp. 95-104
    • Dunn, J.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.