We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

An Efficient Kernel Affinity Propagation Method for Document Clustering

by S. Rathinaparimalam, G. Srinitya
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 66 - Number 2
Year of Publication: 2013
Authors: S. Rathinaparimalam, G. Srinitya
10.5120/11058-5968

S. Rathinaparimalam, G. Srinitya . An Efficient Kernel Affinity Propagation Method for Document Clustering. International Journal of Computer Applications. 66, 2 ( March 2013), 34-38. DOI=10.5120/11058-5968

@article{ 10.5120/11058-5968,
author = { S. Rathinaparimalam, G. Srinitya },
title = { An Efficient Kernel Affinity Propagation Method for Document Clustering },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 66 },
number = { 2 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 34-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume66/number2/11058-5968/ },
doi = { 10.5120/11058-5968 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:21:18.263908+05:30
%A S. Rathinaparimalam
%A G. Srinitya
%T An Efficient Kernel Affinity Propagation Method for Document Clustering
%J International Journal of Computer Applications
%@ 0975-8887
%V 66
%N 2
%P 34-38
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Semi-supervised learning method is a new interesting direction of machine learning approach. It gives the computer a learning ability and makes good use of the obtained knowledge in the application. Semi-supervised learning performs the process of data analysis and mining effectively with the help of few exemplars or little pre-known information. A new Non-Euclidean Space similarity measurement contains the structure information, which is proposed in the Tri-Set computation method. The new similarity measurement not only attentions on the Euclidean Space constraint, but also gives the basic information about the text files. This method is named as Kernel Affinity Propagation (KAP). The method is applied to the benchmark data set Reuters-21578. Further the result is compared with the k-means algorithm and original Affinity Propagation algorithm. The comparison result shows that KAP improves the clustering execution time and provides the better clustering output.

References
  1. Nicholas O. Andrews and Edward A. Fox "Recent Developments in Document Clustering", International Journal of Information Technology and Computer Science(IJITCS) , Vol. 2, No. 2, pages:1-25, Dec. 2010.
  2. Y. J. Li, C. Luo, and S. M. Chung, "Text Clustering with Feature Selection by Using Statistical Data," IEEE Trans. Knowledge and Data Eng. , vol. 20, no. 5, pp. 641-652, May 2008.
  3. C. Buckley and A. F. Lewit, "Optimizations of Inverted Vector Searches," Proc. Ann. ACM SIGIR, pp. 97-110, 1985.
  4. G. Salton and M. J. McGill," Introduction to Modern Information Retrieval". McGraw Hill Book Co. , 1983.
  5. G. Salton, "Dynamic Information and Library Processing". Prentice Hall, Inc. , 1975.
  6. N. Jardin and C. J. van Rijsbergen, "The Use of Hierarchic Clustering in Information Retrieval," Information Storage and Retrieval, vol. 7, no. 5, pp. 217-240, 1971.
  7. Renchu Guan , Xiaohu Shi , Maurizio Marchese , ChenYang and Yanchun Liang , "Text Clustering with Seeds Affinity Propagation '' , IEEE Transactions on Knowledge and Data Engineering, Vol. 23 , No. 4 ,pges. 627-637,APRIL,2011.
Index Terms

Computer Science
Information Sciences

Keywords

Document Clustering – Semi supervised learning-Smilarity measurement- Message Matrix Computation-Kernel Affinity Propagation method