Skip to main navigation Skip to search Skip to main content

An adaptive affinity propagation document clustering

  • Yancheng He*
  • , Qingcai Chen
  • , Xiaolong Wang
  • , Ruifeng Xu
  • , Xiaohua Bai
  • , Xianjun Meng
  • *Corresponding author for this work
  • Harbin Institute of Technology Shenzhen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The standard affinity propagation clustering algorithm suffers from one limitation that it is hard to know the value of the parameter "preference" which can yield an optimal clustering solution. To overcome this limitation, in this paper we proposes an adaptive affinity propagation method. The method first finds out the range of " preference", then searches the space of "preference" to find a good value which can optimize the clustering result. We apply the method to document clustering and compare it with the standard affinity propagation and K-Means clustering method in real data sets. Experimental results show that our proposed method can get better clustering result.

Original languageEnglish
Title of host publicationINFOS2010 - 2010 7th International Conference on Informatics and Systems
StatePublished - 2010
Externally publishedYes
Event2010 7th International Conference on Informatics and Systems, INFOS2010 - Cairo, Egypt
Duration: 28 Mar 201030 Mar 2010

Publication series

NameINFOS2010 - 2010 7th International Conference on Informatics and Systems

Conference

Conference2010 7th International Conference on Informatics and Systems, INFOS2010
Country/TerritoryEgypt
CityCairo
Period28/03/1030/03/10

Keywords

  • Adaptive clustering
  • Affinity propagation
  • Document clustering
  • Vector space model

Fingerprint

Dive into the research topics of 'An adaptive affinity propagation document clustering'. Together they form a unique fingerprint.

Cite this