https://orcid.org/0000-0001-8503-4354
References
- MacQueen J. Some methods for classification and analysis of multivariate observations. In: Proc. 5th Berkeley Symp. Math. Statistics and Probability. Vol. 1; 1967. p. 281–297.
- Pakhira MK. A linear time-complexity k-means algorithm using cluster shifting. In: 2014 International Conference on Computational Intelligence and Communication Networks. Bhopal; 2014. p. 1047–1051.
- Kumar R, Puran R, Dhar J. Enhanced K-Means clustering algorithm using red black tree and min-heap. Int J Innovation Manage Technol. 2011;2:49–54.
- Ester M, Kriegel H-P, Sander J, et al. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han J, Fayyad UM, editors. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96). AAAI Press; 1996. p. 226–231.
- Wang Y, Gu Y, Shun J. Theoretically-efficient and practical parallel DBSCAN. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data (SIGMOD '20). New York, NY, USA: Association for Computing Machinery; 2020. p. 2555–2571.
- Götz M, Bodenstein C, Riedel M. HPDBSCAN: highly parallel DBSCAN. 2015. p. 1–10.
- Zhang A, Yang B, Huang L. Feature extraction of EEG signals using power spectral entropy. 2008. p. 435–439.
- Braune C, Besecke S, Kruse R. Density based clustering: alternatives to DBSCAN. Springer; 2015. p. 193–213. (Partitional Clustering Algorithms).
- Giorli G, Goetz KT. Unknown beaked whale echolocation signals recorded off eastern New Zealand. J Acoust Soc Am. 2018;143:EL285–EL291.
- Ester M, Kriegel H-P, Sander J, et al. A density-based algorithm for discovering clusters in large spatial databases with noise. KDD'96: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. August 1996. p. 226–231.