Using Multi-Vector DBSCAN Algorithm to Cluster the Distribution of Urban Water Point

(*) Corresponding author

Authors' affiliations

DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)


Spatial clustering is an important method for spatial data mining and knowledge discovery. According to the deficiency existing in density-based clustering algorithm DBSCAN ,such as the I/O overhead, memory consumption etc. This paper improves the DBSCAN algorithm ,which proposed directional density algorithm, the algorithm reduces lots of points which  need to be queried. By taking Geographic Information System for the application background, we successfully applied to forecast the distribution of urban water points. Compared with the traditional DBSCAN algorithm, the results conformed to the actual situation, and efficiency increased by 20%.
Copyright © 2013 Praise Worthy Prize - All rights reserved.


Spatial Data Mining; Density Clustering; Dbscan Algorithm; Distribution Of Urban Water Point

Full Text:



A. R. Shafighy, S. M. Hassan Hosseini, H. Chahkandi Nejad, R. Jahani, S. Zarrabian, V. Karimpoor, Applying SVM and RBF Networks for Classifying Disturbances in Synchronous Generators Based on Fuzzy Characteristic Extraction of Time Zone Information, International Review on Modelling and Simulations (IREMOS), Vol. 3, n. 5, pp. 827-832, 2010.

Borah, B. and D.K. Bhattacharyya, An improved sampling-based DBSCAN for large spatial databases. Proceedings Of International Conference On Intelligent Sensing And Information Processing, 2004: p. 92-96.

Reza Rasoolinezhad, Reza Ebrahimpour, Mohammad Bagher Menhaj, Clustering Based World Modelling in Highways, International Review on Modelling and Simulations (IREMOS), Vol. 3, n. 5, pp. 997-1001, 2010.

Gheorghe Grigoras, Marcel Istrate, An Efficient Clustering Method in Evaluation of the Electric Energy Consumption from Water Hydrophore Stations, International Review on Modelling and Simulations (IREMOS), Vol.4, n. 2, pp. 813-818, 2011.

Zhang, J., W. Hsu and M. Lee, Clustering in dynamic spatial databases. Journal Of Intelligent Information Systems, 2005. 24(1): p. 5-27.

Brecheisen, S., H.P. Kriegel and M. Pfeifle, Multi-step density-based clustering. Knowledge And Information Systems, 2006. 9(3): p. 284-308.

Tsai, C.F. and C.W. Liu, KIDBSCAN: A new efficient data clustering algorithm. 2006. p. 702-711.

Li, X.Y. and D.R. Li, Discovery of rules in urban public facility distribution based on DBSCAN clustering algorithm - art. no. 67902E. 2007. p. E7902-E7902.

Tsai, C.F. and C.C. Yen, ANGEL: A new effective and efficient hybrid clustering technique for large databases. 2007. p. 817-824.

Zhao, W.X., P.K. Hopke and K.A. Prather, Comparison of two cluster analysis methods using single particle mass spectra. Atmospheric Environment, 2008. 42(5): p. 881-892.

Folino, G., A. Forestiero and G. Spezzano, An adaptive flocking algorithm for performing approximate clustering. Information Sciences, 2009. 179(18): p. 3059-3078.

Rehman, S.U. and M. Khan, An Incremental Density-Based Clustering Technique for Large Datasets. 2010. p. 3-11.

Ren, Y., X.D. Liu and W.Q. Liu, DBCAMM: A novel density based clustering algorithm via using the Mahalanobis metric. Applied Soft Computing, 2012. 12(5): p. 1542-1554.

Zhao, W.Z., et al., Effective semi-supervised document clustering via active learning with instance-level constraints. Knowledge And Information Systems, 2012. 30(3): p. 569-587.


  • There are currently no refbacks.

Please send any question about this web site to
Copyright © 2005-2024 Praise Worthy Prize