We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

A Survey on Clustering Algorithms for Data in Spatial Database Management Systems

by Dr.Chandra.E, Anuradha.V.P
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 24 - Number 9
Year of Publication: 2011
Authors: Dr.Chandra.E, Anuradha.V.P
10.5120/2969-3975

Dr.Chandra.E, Anuradha.V.P . A Survey on Clustering Algorithms for Data in Spatial Database Management Systems. International Journal of Computer Applications. 24, 9 ( June 2011), 19-26. DOI=10.5120/2969-3975

@article{ 10.5120/2969-3975,
author = { Dr.Chandra.E, Anuradha.V.P },
title = { A Survey on Clustering Algorithms for Data in Spatial Database Management Systems },
journal = { International Journal of Computer Applications },
issue_date = { June 2011 },
volume = { 24 },
number = { 9 },
month = { June },
year = { 2011 },
issn = { 0975-8887 },
pages = { 19-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume24/number9/2969-3975/ },
doi = { 10.5120/2969-3975 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:10:32.185423+05:30
%A Dr.Chandra.E
%A Anuradha.V.P
%T A Survey on Clustering Algorithms for Data in Spatial Database Management Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 24
%N 9
%P 19-26
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Clustering is an essential task in data mining to group data into meaningful subsets to retrieve information from a given dataset of Spatial Data Base Management System (SDBMS). The information thus retrieved from the SDBMS helps to detect urban activity centers for consumer applications. Clustering algorithms group the data objects into clusters wherein the objects within a cluster are more similar to each other and are more dissimilar to objects in other clusters. Query processing is a data mining operation of SDBMS to retrieve the required information for consumer applications. There are several basic algorithms as well as advanced algorithms for clustering spatial data. The k-means algorithm is one of the basic clustering method in which an objective function has to be optimized. Extensions of k-means method are implemented for processing large datasets of a database. The clustering algorithms for grouping data in an SDBMS are based on such methods as partitioning methods, hierarchical clustering, and density based clustering. Hypergraphs and Delaunay triangulations are the enhanced features utilized in a spatial clustering algorithm. Each one of the clustering algorithm has advantages and limitations for processing multidimensional data and hence in spatial clustering process. This work makes an attempt at studying the feasibility of the algorithms for implementation in an SDBMS. Performance of the algorithms is studied with respect to various parameters.

References
  1. Ankerst, M., Breunig, M., Kreigel, H.-P. and Sander, J. 1999. OPTICS: Ordering Points To Identify the Clustering Structure. Proc. of ACM-SIGMOD International Conference on Management of Data, pp. 46-60.
  2. Beckmann N., Kriegel H.-P., Schneider R, and Seeger B. 1990. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proc. ACM SIGMOD Int. Conf. on Management of Data. Atlantic City, NJ, pp. 322-331.
  3. Bradley, P. S., Fayyad, U. M., and Reina, C. A., 1998. Scaling Clustering Algorithms to Large Databases. Proc. Fourth Int’l Conf. Knowledge Discovery and Data Mining, pp. 9-15.
  4. Chen Guang-xue, Li Xiao-zhou, Chen Qi-feng and Li Xiao-zhou, 2010. Clustering Algorithms for Area Geographical Entities in Spatial Data Mining. Seventh International Conference on Fuzzy Systems and Knowledge Discovery, pp. 1630-1633.
  5. Ester, M., Kriegel, H.P., Sander, J., Xu, X., 1996. A Density- based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining. AAAI Press, Portland, OR, pp.226-231.
  6. Faber, V., 1994. Clustering and Continuous k-means Algorithm. Los Almos Science. vol. 22, pp. 138-144.
  7. Gueting R.H., 1994. An Introduction to Spatial Database Systems. The VLDB Journal 3(4), pp. 357-399.
  8. Guha, S., Rastogi, R., Shim, K., 1998. CURE: An Efficient Clustering Algorithms for Large Databases. Proc. ACM SIGMOD Int. Conf. on Management of Data. Seattle, WA, pp.73-84.
  9. In-Soon Kang, Tae-wan Kim and Ki-Joune Li, 1997. A Spatial Data Mining Method by Delaunay Triangulation. Proceedings of the 5th ACM International Workshop on Advances in Geographic Information Systems.
  10. Jong-Sheng Cheng and Mei-Jung Lo, 2001. A Hypergraph Based Clustering Algorithm for Spatial Data Sets. IEEE, pp. 83-90.
  11. Jinxin Dong, Minyong Qi, 2009. K-means Optimization algorithm for Solving Clustering Problem. 2nd International Workshop on Knowledge Discovery and Data Mining, pp.52-55.
  12. Karypis, G., Han, E-H., and Kumar, V., 1999. CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling. IEEE Trans. On COMPUTER. vol. 32, pp. 68-75.
  13. MacQueen.J, 1967. Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of 5th Berkeley Symposium on Mathematical Statitics and Probablities. vol.1, pp.281-297.
  14. Tapas Kanungo, David M. Mount, Natha S. Netanyahu, Christine D. Paitko, Ruth Silverman and Angela Y. Wu, 2002. An Efficient k-Means Clustering Algorithm: Analysis and Implementation. IEEE Transactions on Pattern Analysis and Machine Interlligence. vol. 24, no. 7, pp. 881-892.
  15. Xiankun Yangand Weihong Cui, 2010. A Novel Spatial Clustering Algorithm Based on Delaunay Triangulation. Journal of Software Engineering and Applications. vol. 3, pp. 141-149.
  16. Yuan, F., Meng, Z. H., Zhang, H. X., Dong, C. R., 2004. A New Algorithm to Get The Initial Centroids. Proc. of the 3rd International Conference on Machine Learning and Cybernetics. pp. 1191-1193.
  17. Zhang, T., Ramakrishnan, R., Linvy, M., 1996. BIRCH: An Efficient Data Clustering Method for Very Large Databases. Proc. ACM SIGMOD Int. Conf. on Management of Data. ACM Press, New York, p.103-114.
Index Terms

Computer Science
Information Sciences

Keywords

Spatial data mining Clustering algorithms Spatial data Spatial clustering