Enhancing grid-density based clustering for high dimensional data

被引:21
|
作者
Zhao, Yanchang
Cao, Jie [1 ]
Zhang, Chengqi [2 ]
Zhang, Shichao [3 ]
机构
[1] Nanjing Univ Finance & Econ, Jiangsu Prov Key Lab E Business, Nanjing 210003, Peoples R China
[2] Univ Technol Sydney, Ctr Quantum Computat & Intelligent Syst, Fac Engn & Informat Technol, Sydney, NSW 2007, Australia
[3] Guangxi Normal Univ, Coll CS & IT, Guilin, Australia
关键词
Clustering; Subspace clustering; High dimensional data; ALGORITHM;
D O I
10.1016/j.jss.2011.02.047
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We propose an enhanced grid-density based approach for clustering high dimensional data. Our technique takes objects (or points) as atomic units in which the size requirement to cells is waived without losing clustering accuracy. For efficiency, a new partitioning is developed to make the number of cells smoothly adjustable; a concept of the ith-order neighbors is defined for avoiding considering the exponential number of neighboring cells; and a novel density compensation is proposed for improving the clustering accuracy and quality. We experimentally evaluate our approach and demonstrate that our algorithm significantly improves the clustering accuracy and quality. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:1524 / 1539
页数:16
相关论文
共 50 条
  • [1] A Kind of Data Stream Clustering Algorithm Based on Grid-Density
    Zhong Zhishui
    ADVANCES IN COMPUTER SCIENCE, ENVIRONMENT, ECOINFORMATICS, AND EDUCATION, PT II, 2011, 215 : 418 - 423
  • [2] A density-grid-based method for clustering k-dimensional data
    Kashani, Elham S.
    Shouraki, Saeed Bagheri
    Norouzi, Yaser
    De Baets, Bernard
    APPLIED INTELLIGENCE, 2023, 53 (09) : 10559 - 10573
  • [3] Improving K-Means Algorithm by Grid-Density Clustering for Distributed WSN Data Stream
    Alghamdi, Yassmeen
    Abdullah, Manal
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2018, 9 (11) : 583 - 588
  • [4] Robust Local Triangular Kernel Density-based Clustering for High-dimensional Data
    Musdholifah, Aina
    Hashim, Siti Zaiton Mohd
    2013 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CSIT), 2013, : 24 - 32
  • [5] Density-connected subspace clustering for high-dimensional data
    Kailing, K
    Kriegel, HP
    Kröger, P
    PROCEEDINGS OF THE FOURTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2004, : 246 - 256
  • [6] Grid-Density Based Feature Classification For Speaker Recognition
    Li, Lin
    Wang, Wei
    He, Shan
    2012 INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY AND IDENTIFICATION (ASID), 2012,
  • [7] A density-grid-based method for clustering k-dimensional data
    Elham S. Kashani
    Saeed Bagheri Shouraki
    Yaser Norouzi
    Bernard De Baets
    Applied Intelligence, 2023, 53 : 10559 - 10573
  • [8] Accelerating Density-Based Subspace Clustering in High-Dimensional Data
    Prinzbach, Juergen
    Lauer, Tobias
    Kiefer, Nicolas
    21ST IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS ICDMW 2021, 2021, : 474 - 481
  • [9] A grid-density based technique for finding clusters in satellite image
    Sarmah, Sauravjyoti
    Bhattacharyya, Dhruba K.
    PATTERN RECOGNITION LETTERS, 2012, 33 (05) : 589 - 604
  • [10] Clustering High-Dimensional Data: A Survey on Subspace Clustering, Pattern-Based Clustering, and Correlation Clustering
    Kriegel, Hans-Peter
    Kroeger, Peer
    Zimek, Arthur
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2009, 3 (01)