Determining Murder Prone Areas Using Modified Watershed Model

  • Joytu Khisha
  • Naushaba Zerin
  • Deboshree Choudhury
  • Rashedur M. Rahman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10448)


In this paper, we present an algorithm for cluster detection using modified Watershed model. The presented model for cluster detection works better than the k-means algorithm. The proposed algorithm is also computationally inexpensive compared to the k-means, agglomerative hierarchical clustering and DBSCAN algorithm. The clustering results can be considered as good as the results of DBSCAN and sometimes the result obtained by the proposed model is better than the DBSCAN results. The presented algorithm solves the conflicts faced by the DBSCAN in case of varying density. This paper also presents a way to reduce high dimensional data to low dimensional data with automatic association analysis. This algorithm can reduce high dimensional data to even a single dimension. Using this algorithm the challenges faced in multidimensional clustering by different algorithms such as DBSCSN is solved. This dimensionality reduction with automatic association algorithm is then applied to the Watershed model to detect cluster in Homicide Data and finding out murder prone zones and suggest a person with murder avoiding areas.


Cluster detection Watershed model Association analysis Murder prone area detection Homicide data Data reduction 


  1. 1.
    Drake, J., Hamerly, G.: Accelerated k-means with adaptive distance bounds. In: 5th NIPS Workshop on Optimization for Machine Learning, pp. 42–53 (2012)Google Scholar
  2. 2.
    Celebi, M.E., Kingravi, H.A., Vela, P.A.: A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst. Appl. 40(1), 200–210 (2013)CrossRefGoogle Scholar
  3. 3.
    Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: minimum spanning forests and the drop of water principle. IEEE Trans. Pattern Anal. Mach. Intell. 31(8), 1362–1374 (2009)CrossRefGoogle Scholar
  4. 4.
    Bellman, R.E.: Perturbation Techniques in Mathematics, Engineering and Physics. Courier Corporation, North Chelmsford (2003)zbMATHGoogle Scholar
  5. 5.
    Hahsler, M., Grün, B., Hornik, K.: A computational environment for mining association rules and frequent item sets (2005)Google Scholar
  6. 6.
    Kriegel, H.P., Schubert, E., Zimek, A.: The (black) art of runtime evaluation: are we comparing algorithms or implementations? Knowl. Inf. Syst. 52(2), 341–378 (2016)CrossRefGoogle Scholar
  7. 7.
    MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, no. 14, pp. 281–297, June 1967Google Scholar
  8. 8.
    Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53–65 (1987)CrossRefGoogle Scholar
  9. 9.
    Stevens, W.P., Myers, G.J., Constantine, L.L.: Structured design. IBM Syst. J. 13(2), 115–139 (1974)CrossRefGoogle Scholar
  10. 10.
    Jain, A.K.: Data clustering: 50 years beyond K-means. Pattern Recognit. Lett. 31(8), 651–666 (2010)CrossRefGoogle Scholar
  11. 11.
    Richards, P.: Homicide Statistics, Research Paper 99/56, Social And General Statistics Section, House Of Commons Library, 27 May 1999Google Scholar
  12. 12.
    Barnes, R., Lehman, C., Mulla, D.: Priority-flood: an optimal depression-filling and watershed-labeling algorithm for digital elevation models. Comput. Geosci. 62, 117–127 (2014)CrossRefGoogle Scholar
  13. 13.
    Pearson, K.: LIII. On lines and planes of closest fit to systems of points in space. Lond. Edinb. Dublin Philos. Mag. J. Sci. 2(11), 559–572 (1901)CrossRefGoogle Scholar
  14. 14.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Joytu Khisha
    • 1
  • Naushaba Zerin
    • 1
  • Deboshree Choudhury
    • 1
  • Rashedur M. Rahman
    • 1
  1. 1.Department of Electrical and Computer EngineeringNorth South UniversityDhakaBangladesh

Personalised recommendations