An effective and efficient grid-based data clustering algorithm using intuitive neighbor relationship for data mining
Cheng-Fa Tsai, Sheng-Chiang Huang
Abstract
Cheng-Fa Tsai, Sheng-Chiang Huang
Abstract
This paper presents a new data clustering technique. It is a new grid-based clustering scheme by intuitive neighbor relationship for enhancing data clustering performance. Compared to other algorithms, this improved grid-based clustering algorithm substantially decreases repetitive clustering checks of neighboring grids and greatly improve the efficiency of data processing. Our simulations demonstrate that the proposed data clustering technique delivers better performance, in terms of clustering correctness rate and noise filtering rate, than perform other well-known existing algorithms, GOD-CS, CLIQUE and TING. To our best knowledge, the proposed data clustering technique may be the rapid method in the world currently.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents a new data clustering technique. It is a new grid-based clustering scheme by intuitive neighbor relationship for enhancing data clustering performance. Compared to other algorithms, this improved grid-based clustering algorithm substantially decreases repetitive clustering checks of neighboring grids and greatly improve the efficiency of data processing. Our simulations demonstrate that the proposed data clustering technique delivers better performance, in terms of clustering correctness rate and noise filtering rate, than perform other well-known existing algorithms, GOD-CS, CLIQUE and TING. To our best knowledge, the proposed data clustering technique may be the rapid method in the world currently.
Key concepts: Cluster analysis, CURE data clustering algorithm, Data stream clustering, Canopy clustering algorithm, Computer science, Correlation clustering, Data mining, Fuzzy clustering