Multilink Constrained k-means Clustering Algorithm for Information Retrieval
 |
International Journal of Engineering Trends and Technology (IJETT) |  |
| © 2014 by IJETT Journal | ||
| Volume-13 Number-3 |
||
| Year of Publication : 2014 | ||
| Authors : M.Parvathavarthini , E.Ramaraj |
||
 10.14445/22315381/IJETT-V13P230 |
Citation
M.Parvathavarthini , E.Ramaraj. "Multilink Constrained k-means Clustering Algorithm for Information Retrieval", International Journal of Engineering Trends and Technology (IJETT), V13(3),140-143 July 2014. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
Abstract
Clustering is traditionally viewed as an unsupervised method for data analysis. However, in some cases information about the problem domain is available in addition to the data instances themselves. In this paper, the popular k-means clustering algorithm can be profitably modified to make use of information with available instances is demonstrated. We can also apply this method to the real-world applications such as University database, hospital database etc. for information retrieval. In this proposed method the University data are collected to perform the k-means clustering algorithm to information retrieval. Information retrieval is the activity of obtaining information resources relevant to an information need from a collection of information resources. Many universities and public libraries use IR systems to provide access to books, journals and other documents. An information retrieval process begins when a user enters a query into the system.
References
[1] Bellot, P., & El-Beze, M. (1999). A clustering method for information retrieval (Technical Report IR-0199). Laboratoire d`Informatique d`Avignon, France.
[2] Bradley, P. S., Bennett, K. P., & Demiriz, A. (2000).
[3] Constrained k-means clustering (Technical Report MSR-TR-2000-65). Microsoft Research, Redmond, WA.
[4] Cardie, C. (1993). A case-based approach to knowledge acquisition for domain-speci_c sentence analysis. Proceedings of the Eleventh National Conference on Arti_cial Intelligence (pp. 798{803). Washington, DC: AAAI Press / MIT Press.
[5] Ferligoj, A., & Batagelj, V. (1983). Some types of clustering with relational constraints. Psychometrika, 48, 541{552.
[6] Jain, A. K., & Dubes, R. C. (1988). Algorithms for clustering data. Prentice Hall.
[7] Lefkovitch, L. P. (1980). Conditional clustering. Biometrics, 36, 43-58.
[8] MacQueen, J. B. (1967). Some methods for classi_cation and analysis of multivariate observations. Proceedings of the Fifth Symposium on Math, Statistics, and Probability (pp. 281{297). Berkeley, CA: University of California Press.
[9] Marroquin, J., & Girosi, F. (1993). Some extensions of the k-means algorithm for image segmentation and pattern recognitionAI Memo 1390). Massachusetts Institute of Technology, Cambridge, MA.
[10] Rand, W. M. (1971). Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66, 846-850.
Keywords
Clustering, Information Retrieval, k-means algorithm, Database.