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
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.