• DocumentCode
    2232973
  • Title

    GDILC: a grid-based density-isoline clustering algorithm

  • Author

    Yanchang, Zhao ; Junde, Song

  • Author_Institution
    Electron. Eng. Sch., Beijing Univ. of Aeronaut. & Astronaut., China
  • Volume
    3
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    140
  • Abstract
    A novel clustering algorithm, the grid-based density-isoline clustering (GDILC) algorithm is put forward in this paper. The central idea of GDILC is that the density-isoline figure depicts the distribution of data samples very well. We use a grid-based method to calculate the density of each data sample, and find relatively dense regions, which are just clusters. GDILC is capable of eliminating outliers and finding clusters of various shapes. It is an unsupervised clustering algorithm because it requires no human interaction. The high speed and accuracy of the GDILC clustering algorithm is shown in our experiments
  • Keywords
    data mining; pattern clustering; very large databases; GDILC; data mining; data sample distribution; dense regions; experiments; grid-based density-isoline clustering algorithm; large data samples; outliers; unsupervised clustering algorithm; Clustering algorithms; Clustering methods; Data mining; Density functional theory; Histograms; Humans; Partitioning algorithms; Shape;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on
  • Conference_Location
    Beijing
  • Print_ISBN
    0-7803-7010-4
  • Type

    conf

  • DOI
    10.1109/ICII.2001.983048
  • Filename
    983048