Abstract
Spatial clustering is one of the very important spatial data mining techniques. So far, a lot of spatial clustering algorithms have been proposed. DBSCAN is one of the effective spatial clustering algorithms, which can discover clusters of any arbitrary shape and handle the noise effectively. However, it has also several disadvantages. First, it does based on only spatial attributes, does not consider non-spatial attributes in spatial databases. Secondly, when DBSCAN does handle large-scale spatial databases, it requires large volume of memory support and the I/O cost. In this paper, a novel spatial clustering algorithm with sampling (NSCAS) based on DBSCAN is developed, which not only clusters large-scale spatial databases effectively, but also considers spatial attributes and non-spatial attributes. Experimental results of 2-D spatial datasets show thatNSCAS is feasible and efficient.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Han, J., Kamber, M.: Data Mining Concepts and Techniques. Machine Press, Beijing, China (2001)
Ng, R.T., Han, J.: CLARANS: A Method for Clustering Objects for Spatial Data Mining. IEEE Transactions on Knowledge and Data Engineering 14(5), 1003–1016 (2002)
Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithm For Large Databases. SIGMOD Record 27(2), 73–84 (1998)
Zhang, T., Ramakrishna, R., Livny, M.: BIRCH: An Efficient Data Clustering Method For Very Large Databases. SIGMOD Record 25(2), 103–114 (1996)
Ester, M., Kriegel, H., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. of 2nd KDD, Portland, pp. 226–231 (1996)
Ankerst, M., Breunig, M., Kriegel, H., Sander, J.: OPTICS: Ordering Objects to Identify the Clustering Structure. In: Proc. 1999 ACM SIGMOD Int. Conf. Management of Data Mining, PA, pp. 49–60. ACM Press, New York (1999)
Sander, J., Ester, M., Kriegel, H., Xu, X.: Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery, vol. 2(2), pp. 169–194
Wang, X., Hamilton, H.J.: DBRS: A Density-Based Spatial Clustering Method with Random Sampling. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS (LNAI), vol. 2637, pp. 563–575. Springer, Heidelberg (2003)
Zhang, W., Yang, Y., Munta, R.: STING: An Statistical Information Grid Approach to Spatial Data Mining. In: Proc. of 23rd VLDB Conf., Seattle, WA, pp. 186–195
Sheikholeslami, G., Chatterjee, S., Zhang, A.: WaveCluster: A multi resolution clustering approach for very large spatial databases. In: Proceedings of the 24th Conference on VLDB, New York, NY, pp. 428–439.
Beckmann, N., Kriegel, H-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Objects and Rectangles[J]. SIGMOD Record 19(2), 322–331 (1990)
Zhou, S., Zhou, A., Jin, W., Fan, Y., Qian, W.: FDBSCAN: A Fast DBSCAN Algorithm. Journal of Software 11(6), 735–744 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, CP., Qin, XL., Zhang, J. (2007). A Novel Spatial Clustering Algorithm with Sampling. In: Torra, V., Narukawa, Y., Yoshida, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2007. Lecture Notes in Computer Science(), vol 4617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73729-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-73729-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73728-5
Online ISBN: 978-3-540-73729-2
eBook Packages: Computer ScienceComputer Science (R0)