##plugins.themes.academic_pro.article.main##
Abstract
The word "cluster" is used broadly in computer networking to refer to a number of different implementations of shared computing resources. Typically, a cluster integrates the resources of two or more computing devices (that could otherwise function separately) together for some common purpose. In this paper we have presented brief introduction about cluster. We also presented document cluster, similarity measure and cosine similarity.
Keywords: -Cluster, Similarity Measure.##plugins.themes.academic_pro.article.details##
How to Cite
Mrs. AncyThomas**, D. G. (2014). Study on Framework for Efficient Document Clustering on Centralized System. International Journal of Emerging Trends in Science and Technology, 1(04). Retrieved from https://igmpublication.org/ijetst.in/index.php/ijetst/article/view/143
References
[1] M. Matteucci, “A Tutorial on Clustering Algorithmsâ€,Available:http://home.dei.polimi.it/matteucc/Clustering/tutorial_html/, 2008
[2] Y. Pen, G. Kou, Y. Shi, and Z. Chen, “Improving Clustering Analysis for Credit Card Accounts Classification,†LNCS 3516, pp. 548- 553, 2005
[3] A. Kalton, K. Wagstaff, and J. Yoo, “Generalized Clustering, Supervised Learning, and Data Assignment,†Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, ACM Press, 2001.
[4] M.R.ANDERBERG, “Cluster Analysis for Applicationsâ€, Academic Press, Inc., New York, NY, 1973
[5] A. K. Jain, R.C.Dubes, , “Algorithms for Clustering Dataâ€, Prentice-Hall advanced reference series. Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
[6] E.Diday, J.C.Simon, J. C, “Clustering analysisâ€, In Digital Pattern Recognition, K. S. Fu, Ed. Springer-Verlag, Secaucus, NJ,
47–94, 1976
[7] R.Michalski, R.E.Stepp, E.Diday, “Automated construction of classifications: conceptual clustering versus numerical taxonomyâ€, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-5, 5 (Sept.),pp. 396–409, 1983
[8] R.C.Dubes, “How many clusters are best?—an experimentâ€, Pattern Recogn. 20, 6,pp. 645–663, 1987
[9] C.H.Cheng, “A branch-and-bound clustering algorithmâ€, IEEE Trans. Syst. Man Cybern, Vol.25,pp. 895–898, 1995
[10] R.C. Dubber, “Cluster analysis and related issuesâ€, In Handbook of Pattern Recognition & Computer Vision, C. H. Chen, L. F. Pau, and P. S. P. Wang, Eds. World Scientific Publishing Co., Inc., River Edge, NJ, 3–32, 1993
[11] M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. “A density-based algorithm for discovering clusters in large spatial databases with noiseâ€, In Proceedings of 2nd International Conference on KDD, 1996.
[12] M. Eisenhardt, W. Muller, and A. Henrich, “Classifying documents by distributed P2P clustering.†in INFORMATIK, 2003
[13] S. Datta, C. R. Giannella, and H. Kargupta, “Kmeans Clustering over a Large, Dynamic Network,†Proc. SIAM Int’l Conf. Data Mining (SDM), 2006
[14] M. Steinbach, G. Karypis, and V. Kumar, “A Comparison of Document Clustering
Techniques,†Proc. KDD Workshop Text Mining, 2000
[15] G. Forman and B. Zhang, “Distributed Data Clustering Can Be Efficient and Exact,†SIGKDD Explorations Newsletter, vol. 2, no. 2, pp. 34-38, 2000
[16] S. Datta, K. Bhaduri, C. R. Giannella, R. Wolff and H. Kargupta, “ Distributed data mining in Peer-to-Peer network’sâ€, IEEE Internet Computing, vol.10 , no. 4, pp. 18-26, July 2006
[17] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,†Proc. SIGCOMM, 2001
[18] Aberer, Karl, et al. "P-Grid: a self-organizing structured P2P system." ACM SIGMOD Record 32.3, pp.29-33, 2003
[19] Rowstron, Antony, and Peter Druschel. "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems." Middleware 2001. Springer Berlin Heidelberg, 2001
[20] Datta, S., Bhaduri, K., Giannella, C., Wolff, R., & Kargupta, H., “Distributed data mining in peer-to-peer network’sâ€, Internet Computing, IEEE, Vol. 10(4), pp. 18-26, 2006
[2] Y. Pen, G. Kou, Y. Shi, and Z. Chen, “Improving Clustering Analysis for Credit Card Accounts Classification,†LNCS 3516, pp. 548- 553, 2005
[3] A. Kalton, K. Wagstaff, and J. Yoo, “Generalized Clustering, Supervised Learning, and Data Assignment,†Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, ACM Press, 2001.
[4] M.R.ANDERBERG, “Cluster Analysis for Applicationsâ€, Academic Press, Inc., New York, NY, 1973
[5] A. K. Jain, R.C.Dubes, , “Algorithms for Clustering Dataâ€, Prentice-Hall advanced reference series. Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
[6] E.Diday, J.C.Simon, J. C, “Clustering analysisâ€, In Digital Pattern Recognition, K. S. Fu, Ed. Springer-Verlag, Secaucus, NJ,
47–94, 1976
[7] R.Michalski, R.E.Stepp, E.Diday, “Automated construction of classifications: conceptual clustering versus numerical taxonomyâ€, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-5, 5 (Sept.),pp. 396–409, 1983
[8] R.C.Dubes, “How many clusters are best?—an experimentâ€, Pattern Recogn. 20, 6,pp. 645–663, 1987
[9] C.H.Cheng, “A branch-and-bound clustering algorithmâ€, IEEE Trans. Syst. Man Cybern, Vol.25,pp. 895–898, 1995
[10] R.C. Dubber, “Cluster analysis and related issuesâ€, In Handbook of Pattern Recognition & Computer Vision, C. H. Chen, L. F. Pau, and P. S. P. Wang, Eds. World Scientific Publishing Co., Inc., River Edge, NJ, 3–32, 1993
[11] M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. “A density-based algorithm for discovering clusters in large spatial databases with noiseâ€, In Proceedings of 2nd International Conference on KDD, 1996.
[12] M. Eisenhardt, W. Muller, and A. Henrich, “Classifying documents by distributed P2P clustering.†in INFORMATIK, 2003
[13] S. Datta, C. R. Giannella, and H. Kargupta, “Kmeans Clustering over a Large, Dynamic Network,†Proc. SIAM Int’l Conf. Data Mining (SDM), 2006
[14] M. Steinbach, G. Karypis, and V. Kumar, “A Comparison of Document Clustering
Techniques,†Proc. KDD Workshop Text Mining, 2000
[15] G. Forman and B. Zhang, “Distributed Data Clustering Can Be Efficient and Exact,†SIGKDD Explorations Newsletter, vol. 2, no. 2, pp. 34-38, 2000
[16] S. Datta, K. Bhaduri, C. R. Giannella, R. Wolff and H. Kargupta, “ Distributed data mining in Peer-to-Peer network’sâ€, IEEE Internet Computing, vol.10 , no. 4, pp. 18-26, July 2006
[17] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,†Proc. SIGCOMM, 2001
[18] Aberer, Karl, et al. "P-Grid: a self-organizing structured P2P system." ACM SIGMOD Record 32.3, pp.29-33, 2003
[19] Rowstron, Antony, and Peter Druschel. "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems." Middleware 2001. Springer Berlin Heidelberg, 2001
[20] Datta, S., Bhaduri, K., Giannella, C., Wolff, R., & Kargupta, H., “Distributed data mining in peer-to-peer network’sâ€, Internet Computing, IEEE, Vol. 10(4), pp. 18-26, 2006