DBRS: A Density-Based Spatial Clustering Method with Random Sampling (original) (raw)

Abstract

In this paper, we propose a novel density-based spatial clustering method called DBRS. The algorithm can identify clusters of widely varying shapes, clusters of varying densities, clusters which depend on non-spatial attributes, and approximate clusters in very large databases. DBRS achieves these results by repeatedly picking an unclassified point at random and examining its neighborhood. A theoretical comparison of DBRS and DBSCAN, a well-known density-based algorithm, is also given in the paper.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ester, M., Kriegel, H., and Sander, J.: Spatial Data Mining: A Database Approach. In: Proc. 5th Int’l Symp. on Large Spatial Databases (SSD’97), Berlin (1997) 47–66.
    Google Scholar
  2. Koperski, K. and Han, J.: Discovery of Spatial Association Rules in Geographic Information Databases. In: Proc. 4th Int’l Symp. on Large Spatial Databases (SSD95), Maine, USA (1995) 47–66.
    Google Scholar
  3. Koperski, K., Adhikary, J. and Han, J.: Spatial Data Mining: Progress and Challenges. In: SIGMOD’96 Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD’96), Montreal, Canada (1996) 55–70.
    Google Scholar
  4. Jain, A.K., Murty, M.N., and Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys, 31(3) (1999) 264–323.
    Article Google Scholar
  5. Guha, S., Rastogi, R., and Shim, K.: CURE: An efficient clustering algorithm for large databases. In: Proc. of ACM SIGMOD, New York (1998) 73–84.
    Google Scholar
  6. Ester, M., Kriegel, H., Sander, J., and Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. of 2nd Int’l Conf. On Knowledge Discovery and Data Mining, Portland, OR (1996) 226–231.
    Google Scholar
  7. Ng, R. and Han, J.: Efficient and Effective Clustering Method for Spatial Data Mining. In: Proc. of 1994 Int’l Conf. on Very Large Data Bases, Chile (1994) 144–155.
    Google Scholar
  8. Beckermann, N., Kriegel, H., and Schneider, R.: The R *-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM SIGMOD Int’l Conf. on Management of Data, Atlantic City, USA (1990) 322–331.
    Google Scholar
  9. Cramariuc B., Gabbouj M., and Astola J., Clustering Based Region Growing Algorithm for Color Image Segmentation, In: Proc. Digital Signal Processing, Stockholm, Sweden (1997) 857–860.
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, SK, Canada, S4S 0A2
    Xin Wang & Howard J. Hamilton

Authors

  1. Xin Wang
  2. Howard J. Hamilton

Editor information

Editors and Affiliations

  1. Computer Science Department, Korea Advanced Institute of Science and Technology, 373-1 Koo-Sung Dong, Yoo-Sung Ku, Daejeon, 305-701, Korea
    Kyu-Young Whang
  2. Department of Statistics, Seoul National University, Sillimdong Kwanakgu, Seoul, 151-742, Korea
    Jongwoo Jeon
  3. School of Electrical Engineering and Computer Science, Seoul National University, Kwanak P.O. Box 34, Seoul, 151-742, Korea
    Kyuseok Shim
  4. Department of Computer Science and Engineering, University of Minnesota, 200 Union St SE, Minneapolis, MN, 55455, USA
    Jaideep Srivastava

Rights and permissions

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, X., Hamilton, H.J. (2003). DBRS: A Density-Based Spatial Clustering Method with Random Sampling. In: Whang, KY., Jeon, J., Shim, K., Srivastava, J. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2003. Lecture Notes in Computer Science(), vol 2637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36175-8\_56

Download citation

Publish with us