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 条
[21]   A Distributed Density-Grid Clustering Algorithm for Multi-Dimensional Data [J].
Brown, Daniel ;
Shi, Yong .
2020 10TH ANNUAL COMPUTING AND COMMUNICATION WORKSHOP AND CONFERENCE (CCWC), 2020, :1-7
[22]   Local gap density for clustering high-dimensional data with varying densities [J].
Li, Ruijia ;
Yang, Xiaofei ;
Qin, Xiaolong ;
Zhu, William .
KNOWLEDGE-BASED SYSTEMS, 2019, 184
[23]   Integrated constraint based clustering algorithm for high dimensional data [J].
Liu, Xinyue ;
Li, Menggang .
NEUROCOMPUTING, 2014, 142 :478-485
[24]   Online Clustering of Evolving Data Streams Using a Density Grid-Based Method [J].
Tareq, Mustafa ;
Sundararajan, Elankovan A. ;
Mohd, Masnizah ;
Sani, Nor Samsiah .
IEEE ACCESS, 2020, 8 :166472-166490
[25]   Literature Review on High Dimensional Data Clustering Techniques [J].
Selvavinayagam, G. ;
Loganathan, Venkateshwaran ;
Loheswaran, K. .
BIOSCIENCE BIOTECHNOLOGY RESEARCH COMMUNICATIONS, 2020, 13 (06) :183-187
[26]   A density-based clustering algorithm for high-dimensional data with feature selection [J].
Qi Xianting ;
Wang Pan .
2016 2ND INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS - COMPUTING TECHNOLOGY, INTELLIGENT TECHNOLOGY, INDUSTRIAL INFORMATION INTEGRATION (ICIICII), 2016, :114-118
[27]   Differential Privacy High-Dimensional Data Publishing Based on Feature Selection and Clustering [J].
Chu, Zhiguang ;
He, Jingsha ;
Zhang, Xiaolei ;
Zhang, Xing ;
Zhu, Nafei .
ELECTRONICS, 2023, 12 (09)
[28]   Density Conscious Subspace Clustering for High-Dimensional Data [J].
Chu, Yi-Hong ;
Huang, Jen-Wei ;
Chuang, Kun-Ta ;
Yang, De-Nian ;
Chen, Ming-Syan .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2010, 22 (01) :16-30
[29]   High-dimensional data clustering [J].
Bouveyron, C. ;
Girard, S. ;
Schmid, C. .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2007, 52 (01) :502-519
[30]   Clustering over data streams based on grid density and index tree [J].
Ren J. ;
Cai B. ;
Hu C. .
Journal of Convergence Information Technology, 2011, 6 (01) :83-93