CFP last date
20 May 2024
Reseach Article

An Efficient Text Clustering Approach using Biased Affinity Propagation

by Isha Sharma, Mahak Motwani
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 96 - Number 1
Year of Publication: 2014
Authors: Isha Sharma, Mahak Motwani
10.5120/16755-6273

Isha Sharma, Mahak Motwani . An Efficient Text Clustering Approach using Biased Affinity Propagation. International Journal of Computer Applications. 96, 1 ( June 2014), 1-4. DOI=10.5120/16755-6273

@article{ 10.5120/16755-6273,
author = { Isha Sharma, Mahak Motwani },
title = { An Efficient Text Clustering Approach using Biased Affinity Propagation },
journal = { International Journal of Computer Applications },
issue_date = { June 2014 },
volume = { 96 },
number = { 1 },
month = { June },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume96/number1/16755-6273/ },
doi = { 10.5120/16755-6273 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:20:37.845916+05:30
%A Isha Sharma
%A Mahak Motwani
%T An Efficient Text Clustering Approach using Biased Affinity Propagation
%J International Journal of Computer Applications
%@ 0975-8887
%V 96
%N 1
%P 1-4
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Based on an effective clustering algorithm Seeds affinity propagation- in this paper an efficient clustering approach is presented which uses one dimension for the group of the words representing the similar area of interest with that we have also considered the uneven weighting of each dimension depending upon the categorical bias during clustering. After creating the vector the clustering is performed using seeds-affinity clustering technique. Finally to study the performance of the presented algorithm, it is applied to the benchmark data set Reuters-21578 and compared it for F-measure, with k-means algorithm and the original AP (affinity propagation) algorithm the results shows that the presented algorithm outperforms the others by acceptable margin.

References
  1. Shifei Ding and Hui Li "Quotient Space Granularity Selection Based A?nity Propagation Clustering Algorithm", Journal of Computational Information Systems 10: 6 (2014) 2425–2433
  2. Erik Cambria, Bjo?rn Schuller, Yunqing Xia and Catherine Havasi "New Avenues in Opinion Mining and Sentiment Analysis", Knowledge-Based approaches toconcept-level sentiment analysis.
  3. Chen Yang and Renchu Guan "A Feature-Metric-Based Affinity Propagation Technique for Feature Selection in Hyper-spectral Image Classification", Geoscience and Remote Sensing Letters, IEEE,Sept. 2013.
  4. Qingyao Wu, Michael K. Ng and Yunming Ye "Co-Transfer Learning Using Coupled Markov Chains withRestart", IEEE Intelligent Systems, 08 March 2013. IEEE computer Society Digital Library.
  5. Wei Chen, Qichong Tian, Xiaorong Jiang, Zhibo Tang, Caihua Guo, Xinzheng Xu, Hong Zhuand Shifei Ding "Domain Knowledge Blended Af?nity Propagation", Appl. Math. Inf. Sci. 7, No. 2, 717-723 (2013).
  6. Vicenc Quera, FrancescS. Beltran, InmarE. Givoni and Ruth Dolado "Determining shoal membership using affnity propagation", Behavioural Brain Research 241 (2013) 38–49.
  7. Stevan Rudinac, Alan Hanjalic and Martha Larson "Generating Visual Summaries of Geographic AreasUsing Community-Contributed Images", IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 15, NO. 4, JUNE 2013.
  8. Teng Li,Bin Cheng, Xinyu Wu and Jun Wu "Low-Rank Affinity Based Local-Driven Multilabel Propagation", Mathematical Problems in EngineeringVolume 2013, Article ID 323481.
  9. Renchu Guan, Xiaohu Shi, Maurizio Marchese, Chen Yang, and Yanchun Liang "Text Clustering with Seeds Affinity Propagation", IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 23, NO. 4, APRIL 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Affinity Propagation Text Mining Clustering.