An Implementation of the HDBSCAN* Clustering Algorithm
Source abstract
Abstract
An implementation of the HDBSCAN* clustering algorithm, Tribuo Hdbscan, is presented in this work. The implementation is developed as a new feature of the Java machine learning library Tribuo. This implementation leverages concurrency and achieves better performance than the reference Java implementation. Tribuo Hdbscan provides prediction functionality, which is a novel technique to make fast predictions for unseen data points using an HDBSCAN* clustering model. Tribuo Hdbscan cluster results and performance measurements are also compared with the state-of-the-art HDBSCAN* implementation, the Python module hdbscan.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Anomaly Detection Techniques and Applications · Advanced Clustering Algorithms Research · Data Stream Mining Techniques
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Engineering, Computing and Mathematical Sciences, Lewis University, Romeoville, IL 60446, USA
Department of Computer Engineering, Yarmouk University, Irbid 21163, Jordan
References (20)
Show source-provided references
1. Detecting and tracking community structure in temporal networks: A low-rank+ sparse estimation based evolutionary clustering approach10.1109/TSIPN.2019.2942176 ↗
2. Al-Sharoa, E., Al-khassaweneh, M., and Aviyente, S. (2019, January 12–17). Low-rank estimation based evolutionary clustering for community detection in temporal networks. Proceedings of the ICASSP 2019–2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brighton, UK.10.1109/ICASSP.2019.8682987 ↗
3. Pei, J., Tseng, V.S., Cao, L., Motoda, H., and Xu, G. (2013). Density-based Clustering Based on Hierarchical Density Estimates. Advances in Knowledge Discovery and Data Mining, Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer.
4. hdbscan: Hierarchical density based clustering10.21105/joss.00205 ↗
5. (2021, July 24). Machine Learning in Java—Tribuo. Available online: https://tribuo.org/.
6. (2022, January 22). HDBSCAN* Clustering Tutorial. Available online: https://tribuo.org/learn/4.2/tutorials/clustering-hdbscan-tribuo-v4.html.
7. Ester, M., Kriegel, H., and Sander, J. (1996, January 2). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, OR, USA.
8. Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection
9. Ankerst, M., Breunig, M., Kriegel, H., and Sander, J. (1999, January 1–3). OPTICS: Ordering Points To Identify the Clustering Structure. Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, United States, Philadelphia, PA, USA.10.1145/304182.304187 ↗
10. Maimon, O., and Rokach, L. (2006). Clustering methods. Data Mining and Knowledge Discovery Handbook, Springer. [2nd ed.].10.1007/b107408 ↗
11. Chen, J., Huynh, V., Nguyen, G.N., and Tang, X. (2019). Estimating the Optimal Number of Clusters in Categorical Data Clustering by Silhouette Coefficient. KSS 2019: Knowledge and Systems Sciences, Springer. Communications in Computer and Information Science.
12. McInnes, L., and Healy, J. (2017, January 18–21). Accelerated Hierarchical Density Based Clustering. Proceedings of the 2017 IEEE International Conference on Data Mining Workshops (ICDMW), New Orleans, LA, USA.10.1109/ICDMW.2017.12 ↗
13. (2021, September 15). JavaVsPythonMLlibs. Available online: https://github.com/geoffreydstewart/JavaVsPythonMLlibs.
14. Scikit-learn: Machine Learning in Python
15. Sia, W., and Lazarescu, M. (2005). Clustering Large Dynamic Datasets Using Exemplar Points. Machine Learning and Data Mining in Pattern Recognition, Proceedings of the 4th International Conference on Machine Learning and Data Mining in Pattern Recognition, Leipzig, Germany, 18–20 July 2005, Springer.10.1007/11510888_17 ↗
16. (2021, November 10). TribuoHdbscan. Available online: https://github.com/geoffreydstewart/TribuoHdbscan.
17. (2021, September 22). IJava. Available online: https://github.com/SpencerPark/IJava.
18. (2021, September 10). Credit Card Dataset for Clustering. Available online: https://www.kaggle.com/arjunbhasin2013/ccdata.
19. Curtin, R., March, W., Ram, P., Anderson, D., Gray, A., and Isbell, C. (2013, January 17). Tree-Independent Dual-Tree Algorithms. Proceedings of the 30th International Conference on Machine Learning, Atlanta, GA, USA.
20. March, W., Ram, P., and Gray, A. (2010). Fast Euclidean Minimum Spanning tree: Algorithm, Analysis, and Applications. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, 24–27 July 2010, Association for Computing Machinery.10.1145/1835804.1835882 ↗