메뉴 건너뛰기




Volumn , Issue , 2004, Pages 204-210

Cluster validity through graph-based boundary analysis

Author keywords

Cluster Validity; Clustering; Data Mining; Proximity Graph

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; HEURISTIC PROGRAMMING; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

EID: 12344290655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (17)
  • 3
    • 0023523514 scopus 로고
    • How many clusters are best? - An experiment
    • R. C. Dubes. How many clusters are best? - an experiment. Pattern Recognition, 20(6):645-663, 1987.
    • (1987) Pattern Recognition , vol.20 , Issue.6 , pp. 645-663
    • Dubes, R.C.1
  • 4
    • 0012834533 scopus 로고    scopus 로고
    • Why so many clustering algorithms - A position paper
    • V. Estivill-Castro. Why so many clustering algorithms - a position paper. SIGKDD Explorations, 4(1):65-75, 2002.
    • (2002) SIGKDD Explorations , vol.4 , Issue.1 , pp. 65-75
    • Estivill-Castro, V.1
  • 6
    • 84942907994 scopus 로고    scopus 로고
    • Criteria on proximity graphs for boundary extraction and spatial clustering
    • V. Estivill-Castro, I. Lee, and A. T. Murray. Criteria on proximity graphs for boundary extraction and spatial clustering. LNCS, 2035:348-347, 2001.
    • (2001) LNCS , vol.2035 , pp. 348-1347
    • Estivill-Castro, V.1    Lee, I.2    Murray, A.T.3
  • 8
    • 0033694641 scopus 로고    scopus 로고
    • A new clustering evaluation function using Renyi's information potential
    • R. O. Wells J. Tian, R. G. Baraniuk, D. M. Tan, and H. R. Wu, editors, Istanbul, Turkey
    • E. Gokcay and J. Principe. A new clustering evaluation function using Renyi's information potential. In R. O. Wells J. Tian, R. G. Baraniuk, D. M. Tan, and H. R. Wu, editors, Proc. of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2000), pages 3490-3493, Istanbul, Turkey, 2000.
    • (2000) Proc. of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2000) , pp. 3490-3493
    • Gokcay, E.1    Principe, J.2
  • 9
    • 0004161991 scopus 로고    scopus 로고
    • Prentice Hall International, New Jersey. Advanced Reference Series: Computer Science
    • A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall International, New Jersey, 1998. Advanced Reference Series: Computer Science.
    • (1998) Algorithms for Clustering Data
    • Jain, A.K.1    Dubes, R.C.2
  • 11
    • 0035514007 scopus 로고    scopus 로고
    • Resampling method for unsupervised estimation of cluster validity
    • E. Levine and E. Domany. Resampling method for unsupervised estimation of cluster validity. Neural Computation, 13:2573-2593, 2001.
    • (2001) Neural Computation , vol.13 , pp. 2573-2593
    • Levine, E.1    Domany, E.2
  • 15
    • 0031061864 scopus 로고    scopus 로고
    • Parametric and non-parametric unsupervised cluster analysis
    • S. J. Roberts. Parametric and non-parametric unsupervised cluster analysis. Pattern Recognition, 30(5):261-272, 1997.
    • (1997) Pattern Recognition , vol.30 , Issue.5 , pp. 261-272
    • Roberts, S.J.1


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