2015•Unpublished venueRequires access

An effective and efficient grid-based data clustering algorithm using intuitive neighbor relationship for data mining

Cheng-Fa Tsai, Sheng-Chiang Huang

Open publisher page 11 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Cluster analysis, CURE data clustering algorithm, Data stream clustering, Canopy clustering algorithm, Computer science, Correlation clustering, Data mining, Fuzzy clustering

Related papers

Back to paper searchBrowse research topicsOriginal source
An effective and efficient grid-based data clustering algorithm using intuitive neighbor relationship for data mining — Research Paper | ScholarLens