KIDBSCAN: a new efficient data clustering algorithm

Authors:
Cheng-Fa Tsai;Chih-Wei Liu
Affiliations:
Department of Management Information Systems, National Pingtung University of Science and Technology, Pingtung, Taiwan;Department of Management Information Systems, National Pingtung University of Science and Technology, Pingtung, Taiwan
Venue:
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 6
Cited 7

BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
CURE: an efficient clustering algorithm for large databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Chameleon: Hierarchical Clustering Using Dynamic Modeling

Computer
STING: A Statistical Information Grid Approach to Spatial Data Mining

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
ROCK: A Robust Clustering Algorithm for Categorical Attributes

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Survey of clustering algorithms

IEEE Transactions on Neural Networks

Unsupervised Anomaly Detection Using HDG-Clustering Algorithm

Neural Information Processing
Discovering potential musical instruments teachers using data clustering approach

NN'09 Proceedings of the 10th WSEAS international conference on Neural networks
NPUST: An Efficient Clustering Algorithm Using Partition Space Technique for Large Databases

IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
The investigation of discovering potential musical instruments teachers by effective data clustering scheme

WSEAS Transactions on Computers
EIDBSCAN: An Extended Improving DBSCAN algorithm with sampling techniques

International Journal of Business Intelligence and Data Mining
ANGEL: a new effective and efficient hybrid clustering technique for large databases

PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
PHD: an efficient data clustering scheme using partition space technique for knowledge discovery in large databases

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spatial data clustering plays an important role in numerous fields. Data clustering algorithms have been developed in recent years. K-means is fast, easily implemented and finds most local optima. IDBSCAN is more efficient than DBSCAN. IDBSCAN can also find arbitrary shapes and detect noisy points for data clustering. This investigation presents a new technique based on the concept of IDBSCAN, in which K-means is used to find the high-density center points and then IDBSCAN is used to expand clusters from these high-density center points. IDBSCAN has a lower execution time because it reduces the execution time by selecting representative points in seeds. The simulation indicates that the proposed KIDBSCAN yields more accurate clustering results. Additionally, this new approach reduces the I/O cost. KIDBSCAN outperforms DBSCAN and IDBSCAN.