Abstract
In recent years, one of the serious challenges envisaged by experts in the field of data science is dealing with the gigantic volume of data, piling up at a high speed. Apart from collecting this avalanche of data, another major problem is extracting useful information from it. Clustering is a highly powerful data mining tool capable of finding hidden information from a totally unlabelled dataset. Complete Linkage Clustering is a distance-based Hierarchical clustering algorithm, well-known for providing highly compact clusters. The algorithm because of its high convergence time is unsuitable for large datasets, and hence our paper proposes a preclustering method that not only reduces the convergence time of the algorithm but also makes it suitable for partial clustering of streaming data. The proposed preclustering algorithm uses triangle inequality to take a clustering decision without comparing a pattern with all the members of a cluster, unlike the classical Complete Linkage algorithm. The preclusters are then subjected to an efficient Complete Linkage algorithm for getting the final set of compact clusters in a relatively shorter time in comparison to all those existing variants where the pairwise distance between all the patterns are required for the Clustering process.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
T.S. Madhulatha, An overview on clustering methods. IOSR Journal of Engineering 2(4), 719–725 (2012)
Dunham M.H.: Data Mining: Introductory and Advanced Topics, New Delhi, Prentice Hall/Pearson Education. (2003) Ch.5-Clustering, 125–128
Hartigan J.A.: Clustering Algorithms, New York, USA, John Wiley & Sons, Inc., (1975), Ch.1-Introduction, 1–7
A.K. Jain, M.N. Murty, P.J. Flynn, Data clustering: a review. ACM Comput. Surv. 31(3), 264–323 (1999)
Patel, S., Sihmar, S. and Jatain, A.: A Study of Hierarchical Clustering Algorithms, In: 2nd International Conference on Computing for Sustainable Global Development (INDIACom), (2015) 537–541
Jain A.K and Dubes R.C.: Algorithms for Clustering Data, Englewood Cliffs, NJ, Prentice-Hall, (1988), Ch-3- Clustering Methods and Applications, 58–80
Elkan, C., Using the Triangle Inequality to Accelerate K-Means, In: Proceedings of the Twentieth International Conference on Machine Learning (ICML), (2003) 147–153
Kryszkiewicz, M. and Lasek, P.: TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality, In: 7th International Conference, RSCTC, Warsaw, Poland, Lecture Notes in Computer Science, Vol. 6086, (2010) 60–69, Springer, Berlin, Heidelberg
B.K. Patra, N. Hubballi, S. Biswas, S. Nandi, Distance based fast hierarchical clustering method for large datasets, in 7th International Conference, RSCTC, Warsaw, Poland, Lecture Notes in Computer Science, vol. 6086 (Springer, Heidelberg, 2010), pp. 50–59
Patra, B.K., Nandi, S. and Viswanath, P.: A distance based clustering method for arbitrary shaped clusters in large datasets. Pattern Recognit. 44(12), 2862–2870 (2011)
W.H.E. Day, H. Edelsbrunner, Efficient algorithms for agglomerative hierarchical clustering methods. J. Classif. 1(1), 7–24 (1984)
D. Defays, An efficient algorithm for a complete link method. Comput. J. British Comput. Soc. 20(4), 364–366 (1977)
R. Sibson, SLINK: an optimally efficient algorithm for the single-link cluster method. Comput. J. British Comput. Soc. 16(1), 30–34 (1973)
E. Althaus, A. Hildebrandt, A.K. Hildebrandt, A greedy algorithm for hierarchical complete linkage clustering, in International Conference on Algorithms for Computational Biology, Tarragona, Spain. Lecture Notes in Computer Science, vol. 8542 (Springer, Cham, 2014), pp. 25–34
I. Davidson, S.S Ravi, Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results, Knowledge Discovery in Databases, Lecture Notes in Computer Science, vol. 3721, (Springer, Heidelberg, 2005), pp. 59–70
J.A. Hartigan, Clustering Algorithms (Wiley, New York, 1975), Chap.3−Quick Partition Algorithms, pp. 74–78
A. Agarwal, V. Pardesi, N. Agarwal, A new approach to sorting: min-max sorting algorithm. Int. J. Eng. Res. Technol. 2(5), 445–448 (2013). ISSN: 2278-0181
C.L. Blake, C.J. Merz, UCI Repository of Machine Learning Databases (University of California, 1998). Available from: http://www.ics.uci.edu/~mlearn/MLRepository.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Banerjee, P., Chakrabarti, A., Ballabh, T.K. (2021). An Efficient Algorithm for Complete Linkage Clustering with a Merging Threshold. In: Sharma, N., Chakrabarti, A., Balas, V.E., Martinovic, J. (eds) Data Management, Analytics and Innovation. Advances in Intelligent Systems and Computing, vol 1175. Springer, Singapore. https://doi.org/10.1007/978-981-15-5619-7_10
Download citation
DOI: https://doi.org/10.1007/978-981-15-5619-7_10
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-5618-0
Online ISBN: 978-981-15-5619-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)