A New Data Clustering Approach for Data Mining in Large Databases

Authors:
Affiliations:
Venue:
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
2002

Citing 0
Cited 6

Mining association rules through integration of clustering analysis and ant colony system for health insurance database in Taiwan

Expert Systems with Applications: An International Journal
Dynamic parameter optimization of evolutionary computation for on-line prediction of time series with changing dynamics

Applied Soft Computing
Unsupervised Anomaly Detection Using HDG-Clustering Algorithm

Neural Information Processing
Image-mapped data clustering: An efficient technique for clustering large data sets

Intelligent Data Analysis
An ontological Proxy Agent with prediction, CBR, and RBR techniques for fast query processing

Expert Systems with Applications: An International Journal
Application of ant K-means on clustering analysis

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clustering is the unsupervised classification of patterns (data items, feature vectors, or observations) into groups (clusters). Clustering in data mining is very useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based similarity measure in order to partition the database such that data points in the same partition are more similar than points in different partitions. In this paper, we present a new data clustering method for data mining in large databases. Our simulation results show that the proposed novel clustering method performs better than the Fast SOM combines K-means approach (FSOM+K-means) and Genetic K-Means Algorithm (GKA). In addition, in all the cases we studied, our method produces much smaller errors than both the FSOM+K-means approach and GKA.