Performance Evaluation of Affinity Propagation Approaches on Data Clustering

Abstract

Classical techniques for clustering, such as k-means clustering, are very sensitive to the initial set of data centers, so it need to be rerun many times in order to obtain an optimal result. A relatively new clustering approach named Affinity Propagation (AP) has been devised to resolve these problems. Although AP seems to be very powerful it still has several issues that need to be improved. In this paper several improvement or development are discussed in , i.e. other four approaches: Adaptive Affinity Propagation, Partition Affinity Propagation, Soft Constraint Affinity propagation, and Fuzzy Statistic Affinity Propagation. and those approaches are be implemented and compared to look for the issues that AP really deal with and need to be improved. According to the testing results, Partition Affinity Propagation is the fastest one among four other approaches. On the other hand Adaptive Affinity Propagation is much more tolerant to errors, it can remove the oscillation when it occurs where the occupance of oscillation will bring the algorithm to fail to converge. Adaptive Affinity propagation is more stable than the other since it can deal with error which the other can not. And Fuzzy Statistic Affinity Propagation can produce smaller number of cluster compared to the other since it produces its own preferences using fuzzy iterative methods.

Authors and Affiliations

R. Refianti, A. B. Mutiara, A. A. Syamsudduha

Keywords

Related Articles

Adaptive Equalization Algorithms: An Overview

The recent digital transmission systems impose the application of channel equalizers with short training time and high tracking rate. Equalization techniques compensate for the time dispersion introduced by communication...

Cultural Dimensions of Behaviors Towards E-Commerce in a Developing Country Context

Customers prefer to shop online for various reasons such as saving time, better prices, convenience, selection, and availability of products and services. The accessibility and the ubiquitous nature of the Internet facil...

The Criteria for Software Quality in Information System: Rasch Analysis

Most of the organization uses information system to manage the information and provide better decision making in order to deliver high quality services. Due to that the information system must be reliable and fulfill the...

A Novel Architecture for Intrusion Detection in Mobile Ad hoc Network

Today’s wireless networks are vulnerable in many ways including illegal use, unauthorized access, denial of service attacks, eavesdropping so called war chalking. These problems are one of the main issues for wider uses...

An Analysis of Security Challenges in Cloud Computing

Vendors offer a pool of shared resources to their users through the cloud network. Nowadays, shifting to cloud is a very optimal decision as it provides pay-as-you-go services to users. Cloud has boomed high in business...

Download PDF file
  • EP ID EP112286
  • DOI 10.14569/IJACSA.2016.070357
  • Views 82
  • Downloads 0

How To Cite

R. Refianti, A. B. Mutiara, A. A. Syamsudduha (2016). Performance Evaluation of Affinity Propagation Approaches on Data Clustering. International Journal of Advanced Computer Science & Applications, 7(3), 420-429. https://europub.co.uk/articles/-A-112286