AN EFFICIENT TEXT CLUSTERING ALGORITHM USING AFFINITY PROPAGATION
Journal Title: Indian Journal of Computer Science and Engineering - Year 2013, Vol 4, Issue 1
Abstract
The objective is to find among all partitions of the data set, best publishing according to some quality measure. Affinity propagation is a low error, high speed, flexible, and remarkably simple clustering algorithm that may be used in forming teams of participants for business simulations and experiential exercises, and in organizing participants preferences for the parameters of simulations.This paper proposes an efficient Affinity Propagation algorithm that guaranteesthe same clustering result as the original algorithm after convergence. The heart of our approach is (1) to prune unnecessary message exchanges in the iterations and (2) to compute the convergence values of pruned messages after the iterations to determine clusters.
Authors and Affiliations
Kumar Vasantha , Jagadeesh Majji
Keywords
Related Articles
- EP ID EP156478
- DOI -
- Views 134
- Downloads 0
DEVELOPMENT OF HASH TABLE BASED WEB-READY DATA MINING ENGINE
This paper focus on analysis and implementation of a hash table based data mining engine used to discover knowledge from transaction database for electronic commerce industry. Apriori algorithm is analyzed and implemente...
ESTIMATION OF THE BURST LENGTH IN OBS NETWORKS
This paper presents an overview of the optical burst switching (OBS) and discusses the major components. In OBS, the length of the burst arriving at a particular node is unknown, and hence, node design is very complex. I...
AN EFFICIENT APPROACH TO PERFORM PRE-PROCESSING
Nowadays, WWW (World Wide Web) becomes more popular and user friendly for transferring information. Therefore people are more interested in analyzing log files which can offer more useful insight into web site usage. Web...
PERFORMANCE EVALUATION OF CONTENT BASED IMAGE RETRIEVAL FOR MEDICAL IMAGES
Content-based image retrieval (CBIR) technology benefits not only large image collections management, but also helps clinical care, biomedical research, and education. Digital images are found in X-Rays, MRI, CT which ar...
AUTOMATIC WEB SERVICE SELECTION BY OPTIMIZING COST OF COMPOSITION IN SLAKY COMPOSER USING ASSIGNMENT MINIMIZATION APPROACH
Web service composition is a means of building enterprises virtually by knitting relevant web services on the fly. Automatic web service composition is done dynamically at runtime. Extensive research has been done in the...