Held, JanisBeer, AnnaSeidl, ThomasMeyer, HolgerRitter, NorbertThor, AndreasNicklas, DanielaHeuer, AndreasKlettke, Meike2019-04-152019-04-152019978-3-88579-684-8https://dl.gi.de/handle/20.500.12116/21804Chains connecting two or more different clusters are a well known problem of the probably most famous density-based clustering algorithm DBSCAN. 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 DBSCAN 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 by DBSCAN. Also, the desired straightness can be set by the user. We tested our efficient algorithm on a dataset containing traffic accidents in Great Britain and were able to detect chains emerging from streets between cities and villages, which led to clusters composed of diverse villages.enDBSCANclusteringchain-detectionsingle link effect10.18420/btw2019-ws-181617-5468