<hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold">Ester, </hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold">Martin</hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold"> / Kriegel </hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold">Hans-Peter /</hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold"> Sander, </hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold">Jörg</hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold"> / Xu, </hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold">Xiaowei</hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="bold"> et al.</hi> (1996): „A density-based algorithm for discovering clusters in large spatial databases with noise.“, in <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">KDD</hi>, volume 96, pages 226–231.