메뉴 건너뛰기




Volumn 3, Issue , 2001, Pages 140-145

GDILC: A grid-based density-isoline clustering algorithm

Author keywords

Clustering; Data Mining; Density Isoline Clustering; Grid; Outlier

Indexed keywords


EID: 84964458218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICII.2001.983048     Document Type: Conference Paper
Times cited : (45)

References (6)
  • 3
    • 0030157145 scopus 로고    scopus 로고
    • BIRCH: An Efficient Data Clustering Method for Very Large Databases
    • T. Zhang, R. Ramakrishnan, M. Livny, BIRCH: An Efficient Data Clustering Method for Very Large Databases, ACM SIGMOD96
    • ACM SIGMOD96
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3
  • 5
    • 0000550189 scopus 로고    scopus 로고
    • A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise
    • M. Ester, H.P. Kriegel, J. Sander, et al., A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, KDD-96
    • KDD-96
    • Ester, M.1    Kriegel, H.P.2    Sander, J.3


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