Semi- supervised Affinity Propagation Clustering Algorithm Based on Mahalanobis Distance
A semi-supervised affinity propagation clustering algorithm based on Mahalanobis distance （SAPBM） is proposed to try to solve some problems， including that the limitations of the distance measurement of the affinity propagation （AP） clustering algorithm and the low accuracy of the clustering algorithm for some complex data sets. Considering that the Mahalanobis distance is not affected by the sample dimension， in the similarity measurement of samples， the SAPBM algorithm replaces the Euclidean distance with the Mahalanobis distance， reducing the mutual interference between samples due to the influence of sample dimension； combining pairwise constraint information to improve the similarity between the data， so that the obtained similarity matrix can more accurately reflect the relationship between the data. Experiments are carried out on the UCI standard data set， and the experimental results show that the SAPBM algorithm has better clustering performance than the traditional AP clustering algorithm and the SAP clustering algorithm that only uses pairwise constraint information.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Semi-Supervised Clustering via Dynamic Graph Structure Learning
Most existing semi-supervised graph-based clustering methods exploit the supervisory information by either refining the affinity matrix or directly constraining the low-dimensional representations of data points. The aff…
ClusteringGraph structure learningSemi-Supervised Subspace Clustering via Tensor Low-Rank Representation
In this letter, we propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. By representing t…
ClusteringLatent Geometry Inspired Graph Dissimilarities Enhance Affinity Propagation Community Detection in Complex Networks
Affinity propagation is one of the most effective unsupervised pattern recognition algorithms for data clustering in high-dimensional feature space. However, the numerous attempts to test its performance for community de…
ClusteringCommunity DetectionIncremental Affinity Propagation based on Cluster Consolidation and Stratification
Modern data mining applications require to perform incremental clustering over dynamic datasets by tracing temporal changes over the resulting clusters. In this paper, we propose A-Posteriori affinity Propagation (APP), …
ClusteringSemantics-Guided Clustering with Deep Progressive Learning for Semi-Supervised Person Re-identification
Person re-identification (re-ID) requires one to match images of the same person across camera views. As a more challenging task, semi-supervised re-ID tackles the problem that only a number of identities in training dat…
ClusteringImage RetrievalPerson Re-IdentificationRetrieval+1