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

A Tool Design of Cobit Roadmap Implementation

Over the last two decades, the role of information technology in organizations has changed from primarily a supportive and transactional function to being an essential prerequisite for strategic value generation. The org...

Impact of External Disturbance and Discontinuous Input on the Redundant Manipulator Robot Behaviour using the Linear Parameter Varying Modelling Approach

This paper is concerned with the synthesis of dynamic model of the redundant manipulator robot based on Linear Parameter Varying approach. To evaluate its behavior and in presence of external disturbance several motions...

Fuzzy Gains-Scheduling of an Integral Sliding Mode Controller for a Quadrotor Unmanned Aerial Vehicle

This paper investigates an Adaptive Fuzzy Gains-Scheduling Integral Sliding Mode Controller (AFGS-ISMC) design approach to deal with the attitude and altitude stabilization problem of an Unmanned Aerial Vehicles (UAV) pr...

Spatial-Temporal Variations of Turbidity and Ocean Current Velocity of the Ariake Sea Area, Kyushu, Japan Through Regression Analysis with Remote Sensing Satellite Data

Regression analysis based method for turbidity and ocean current velocity estimation with remote sensing satellite data is proposed. Through regressive analysis with MODIS data and measured data of turbidity and ocean cu...

Improving K-Means Algorithm by Grid-Density Clustering for Distributed WSN Data Stream

At recent years, Wireless Sensor Networks (WSNs) had a widespread range of applications in many fields related to military surveillance, monitoring health, observing habitat and so on. WSNs contain individual nodes that...

Download PDF file
  • EP ID EP112286
  • DOI 10.14569/IJACSA.2016.070357
  • Views 105
  • 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