K -Nearest Neighbor Intervals Based AP Clustering Algorithm for Large Incomplete Data

الملخص EN

The Affinity Propagation (AP) algorithm is an effective algorithm for clustering analysis, but it can not be directly applicable to the case of incomplete data.

In view of the prevalence of missing data and the uncertainty of missing attributes, we put forward a modified AP clustering algorithm based on K-nearest neighbor intervals (KNNI) for incomplete data.

Based on an Improved Partial Data Strategy, the proposed algorithm estimates the KNNI representation of missing attributes by using the attribute distribution information of the available data.

The similarity function can be changed by dealing with the interval data.

Then the improved AP algorithm can be applicable to the case of incomplete data.

Experiments on several UCI datasets show that the proposed algorithm achieves impressive clustering results.