References¶
See Also¶
hdbscan: https://hdbscan.readthedocs.io/en/latest/index.html
fast_hdbscan: https://fast-hdbscan.readthedocs.io/en/latest/index.html
genieclust: https://genieclust.gagolewski.com
Bibliography¶
Bentley, J.L. (1975). Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509–517. DOI: 10.1145/361002.361007.
Borůvka, O. (1926). O jistém problému minimálním. Práce Moravské Přírodovědecké Společnosti v Brně, 3:37–58.
Campello, R.J.G.B., Moulavi, D., and Sander, J. (2013). Density-based clustering based on hierarchical density estimates. Lecture Notes in Computer Science, 7819:160–172. DOI: 10.1007/978-3-642-37456-2_14.
Campello, R.J.G.B., Moulavi, D., Zimek, A., and Sander, J. (2015). Hierarchical density estimates for data clustering, visualization, and outlier detection. ACM Transactions on Knowledge Discovery from Data, 10(1):5:1–5:51. DOI: 10.1145/2733381.
Curtin, R.R., Edel, M., Lozhnikov, M., Mentekidis, Y., Ghaisas, S., and Zhang, S. (2018). Mlpack 3: A fast, flexible machine learning library. Journal of Open Source Software, 3(26):726. DOI: 10.21105/joss.00726.
Jarník, V. (1930). O jistém problému minimálním (z dopisu panu O. Borůvkovi). Práce Moravské Přírodovědecké Společnosti v Brně, 6:57–63.
Maneewongvatana, S. and Mount, D.M. (1999). It's okay to be skinny, if your friends are fat. In: The 4th CGC Workshop on Computational Geometry.
March, W.B., Parikshit, R., and Gray, A.G. (2010). Fast Euclidean minimum spanning tree: Algorithm, analysis, and applications. In: Proc. 16th ACM SIGKDD'10, pp. 603–612. DOI: 10.1145/1835804.1835882.
McInnes, L. and Healy, J. (2017). Accelerated hierarchical density-based clustering. In: IEEE Intl. Conf. Data Mining Workshops (ICMDW), pp. 33–42. DOI: 10.1109/ICDMW.2017.12.
McInnes, L., Healy, J., and Astels, S. (2017). hdbscan: Hierarchical density based clustering. The Journal of Open Source Software, 2(11):205. DOI: 10.21105/joss.00205.
Olson, C.F. (1995). Parallel algorithms for hierarchical clustering. Parallel Computing, 21:1313–1325. DOI: 10.1016/0167-8191(95)00017-I.
Prim, R.C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36(6):1389–1401. DOI: 10.1002/j.1538-7305.1957.tb01515.x.
Sample, N., Haines, M., Arnold, M., and Purcell, T. (2001). Optimizing search strategies in K-d trees. In: 5th WSES/IEEE Conf. on Circuits, Systems, Communications & Computers (CSCC'01).