CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Experimental Survey on Single Linkage Clustering

by Krishna K. Mohbey, G. S. Thakur
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 76 - Number 17
Year of Publication: 2013
Authors: Krishna K. Mohbey, G. S. Thakur
10.5120/13337-0327

Krishna K. Mohbey, G. S. Thakur . An Experimental Survey on Single Linkage Clustering. International Journal of Computer Applications. 76, 17 ( August 2013), 6-11. DOI=10.5120/13337-0327

@article{ 10.5120/13337-0327,
author = { Krishna K. Mohbey, G. S. Thakur },
title = { An Experimental Survey on Single Linkage Clustering },
journal = { International Journal of Computer Applications },
issue_date = { August 2013 },
volume = { 76 },
number = { 17 },
month = { August },
year = { 2013 },
issn = { 0975-8887 },
pages = { 6-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume76/number17/13337-0327/ },
doi = { 10.5120/13337-0327 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:48:38.921994+05:30
%A Krishna K. Mohbey
%A G. S. Thakur
%T An Experimental Survey on Single Linkage Clustering
%J International Journal of Computer Applications
%@ 0975-8887
%V 76
%N 17
%P 6-11
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Clusters are useful to identify required object from the huge amount of datasets. There are lots of clustering methods, used to create clusters. Single linkage clustering method is an example of hierarchical agglomerative clustering which is used to merge objects in a cluster, based on minimum distance. In this paper we performed an experiment on two dimensional spaces where multiple objects are available and combine in clusters by Euclidean distance. In this paper, MATLAB is used to calculate the distance between two objects and constructing distance matrix. After completing the whole single linage clustering method dendogram has been prepared. This dendogram is similar to minimum spanning tree because it is prepared using minimum distance of objects. These prepared clusters and dendogram are useful for finding different knowledge from the huge data.

References
  1. Rui Xu, Student Member, IEEE and Donald Wunsch II, Fellow, IEEE, "Survey of Clustering Algorithms", IEEE Transactions on Neural Networks Vol. 16, No. 3, May 2005.
  2. Bidyut kr. Patra, Sukumar Nandi, P. Viswanath, "A distance based clustering method for arbitrary shaped clusters in large datasets", Pattern Recognition, 44 (2011), 2862-2870.
  3. M. Anderberg, "Cluster Analysis for Applications", New York: Academic,1973.
  4. R. Duda, P. Hart, and D. Stork, "Pattern Classification", 2nd ed. NewYork: Wiley, 2001.
  5. Jin Chen, Alan M. MacEachren and Donna J. Peuquet, "Constructing Overview + Detail Dendrogram-Matrix Views ", IEEE Transactions on Visualization and Computer Graphics, Vol . 15, No. 6 , Nov 2009.
  6. B. Duran and P. Odell, "Cluster Analysis: A Survey", New York: Springer-Verlag, 1974.
  7. B. Everitt, S. Landau and M. Leese, "Cluster Analysis", London: Arnold, 2001.
  8. P. Hansen and B. Jaumard, "Cluster analysis and Math- ematical programming", Math. Program. , vol. 79, pp. 191–215, 1997.
  9. A. Jain and R. Dubes, "Algorithms for Clustering Data", Englewood Cliffs, NJ: Prentice-Hall, 1988.
  10. E. Backer and A. Jain, "A clustering performance measure based on fuzzy set decomposition", IEEE Trans. Pattern Anal. Mach. Intell. , vol. PAMI-3, no. 1, pp. 66–75, Jan. 1981.
  11. C. Bishop, "Neural Networks for Pattern Recognition", New York: Oxford Univ. Press, 1995.
  12. V. Cherkassky and F. Mulier, "Learning From Data: Concepts, Theory, and Methods", New York: Wiley, 1998.
  13. A. Baraldi and E. Alpaydin, "Constructive feedforward ART clustering networks" -Part I and II, IEEE Trans. Neural Network , vol. 13, no. 3, pp. 645–677, May 2002.
  14. D. S Rajput, R. S. Thakur, G. S. Thakur, "Rule Generation from Textual Data by using Graph Based Approach", Published in International Journal of Computer Application (IJCA) 0975 – 8887, New york USA, ISBN: 978-93-80865-11-8, Volume 31– No. 9, October 2011.
  15. D. S Rajput, R. S. Thakur, Neeraj Sahu, G. S. Thakur, "Analysis of Social networking sites using K-mean Clustering algorithm", Presented in International Conference on Computer Science and Information Technology (CSIT 2012) March 3rd, 2012
  16. Ghanshyam Thakur, Rekha Thakur and R. C. Jain, "Association Rule Generation from Textual Document", International Journal of Soft Computing, 2: 2007, pp. 346-348.
  17. R. S. Thakur, R. C. Jain, K. R. Pardasani , "Graph Theoretic Based Alogorihtm for mining frequent Pattern" International Joint Conference on Neural Networks (IJCNN 2008), pp 628-632.
  18. R. Balaji And R. B. Bapat, "Block Distance Matrices" , Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 16, pp. 435-443, December 2007.
  19. http://en. wikipedia. org/wiki/Distance_matrix.
Index Terms

Computer Science
Information Sciences

Keywords

Single Link clustering Similarity measurements Dendogram

Powered by PhDFocusTM