Incremental spatial clustering in data mining using genetic algorithm and R-tree

Authors:
Nam Nguyen Vinh;Bac Le
Affiliations:
Vietnam Informatics and Mapping Corporation, Vietnam;Faculty of Information Technology, University of Science / National University of Ho Chi Minh City, Vietnam
Venue:
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Year:
2012

Citing 4
Cited 0

R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Discovery of Spatial Association Rules in Geographic Information Databases

SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
FGKA: a Fast Genetic K-means Clustering Algorithm

Proceedings of the 2004 ACM symposium on Applied computing
A sweep-line algorithm for spatial clustering

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we present an algorithm based on genetic algorithm (GA) and R-tree structure to solve a clustering task in spatial data mining. The algorithm is applied to find a cluster for a new spatial object. Spatial objects that represent for each cluster computed dynamically and quickly according to a clustering object in the clustering process. This improves the speed and accuracy of the algorithm. The experimental results show that our algorithm yields the same result as any other algorithm and is accommodated to the clustering task in spatial data warehouses.