Advertisement

Chain-detection Between Clusters

  • Janis Held
  • Anna BeerEmail author
  • Thomas Seidl
Schwerpunktbeitrag
  • 7 Downloads

Abstract

Chains connecting two or more different clusters are a well known problem of clustering algorithms like DBSCAN or Single Linkage Clustering. Since already a small number of points resulting from, e. g., noise can form such a chain and build a bridge between different clusters, it can happen that the results of the clustering algorithm are distorted: several disparate clusters get merged into one. This single-link effect is rather known but to the best of our knowledge there are no satisfying solutions which extract those chains, yet. We present a new algorithm detecting not only straight chains between clusters, but also bent and noisy ones. Users are able to choose between eliminating one dimensional and higher dimensional chains connecting clusters to receive the underlying cluster structure. Also, the desired straightness can be set by the user. As this paper is an extension of [8], we apply our technique not only in combination with DBSCAN but also with single link hierarchical clustering. On a real world dataset containing traffic accidents in Great Britain we were able to detect chains emerging from streets between cities and villages, which led to clusters composed of diverse villages. Additionally, we analyzed the robustness regarding the variance of chains in synthetic experiments.

Keywords

DBSCAN Agglomerative single link clustering Clustering Chain-detection Single link effect 

Notes

Acknowledgments

This work has been funded by the German Federal Ministry of Education and Research (BMBF) under Grant No. 01IS18036A. The authors of this work take full responsibilities for its content.

References

  1. 1.
    Balcan MF, Liang Y, Gupta P (2014) Robust hierarchical clustering. J Mach Learn Res 15(1):3831–3871MathSciNetzbMATHGoogle Scholar
  2. 2.
    Birant D, Kut A (2007) St-dbscan: an algorithm for clustering spatial-temporal data. Data Knowl Eng 60(1):208–221CrossRefGoogle Scholar
  3. 3.
    Day WH, Edelsbrunner H (1984) Efficient algorithms for agglomerative hierarchical clustering methods. J Classif 1(1):7–24CrossRefzbMATHGoogle Scholar
  4. 4.
    Ester M, Kriegel HP, Sander J, Xu X et al (1996a) A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 96:226–231Google Scholar
  5. 5.
    Glasbey C (1987) Complete linkage as a multiple stopping rule for single linkage clustering. J Classif 4(1):103–109CrossRefGoogle Scholar
  6. 6.
    Held J, Beer A, Seidl T (2019) Chain-detection for dbscan. In: BTW 2019–WorkshopbandGoogle Scholar
  7. 7.
    He Y, Tan H, Luo W, Mao H, Ma D, Feng S, Fan J (2011) Mr-dbscan: an efficient parallel density-based clustering algorithm using mapreduce. In: 2011 IEEE 17th International Conference on Parallel and Distributed Systems. IEEE, 2011. pp 473–480Google Scholar
  8. 8.
    Hyvärinen A, Karhunen J, Oja E (2004) Independent component analysis vol 46. John Wiley & Sons, HobokenGoogle Scholar
  9. 9.
    Jolliffe IT, Cadima J (2016) Principal component analysis: a review and recent developments. Philos Trans Royal Soc A 374(2065):20150202MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Murtagh F (1983) A survey of recent advances in hierarchical clustering algorithms. Comput J 26(4):354–359CrossRefzbMATHGoogle Scholar
  11. 11.
    Ruiz C, Spiliopoulou M, Menasalvas E (2007) C‑dbscan: Density-based clustering with constraints. In: International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing. Springer, Berlin, Heidelberg, 2007. pp 216–223Google Scholar
  12. 12.
    Sibson R (1973) Slink: an optimally efficient algorithm for the single-link cluster method. Comput J 16(1):30–34MathSciNetCrossRefGoogle Scholar

Copyright information

© Gesellschaft für Informatik e.V. and Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.LMU MunichMunichGermany

Personalised recommendations