K-nearest neighbor intervals based AP clustering algorithm for large incomplete data
Summary: 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.
- Fuzzy \(c\)-means clustering of incomplete data using dimension-wise fuzzy variances of clusters
- Comparison of algorithms for clustering incomplete data
- Robust K-Median and K-means clustering algorithms for incomplete data
- Different approaches to fuzzy clustering of incomplete datasets
- Multi-objective clustering algorithm based on the nearest neighbor interval for incomplete gene expression data
- A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
- Adaptive affinity propagation clustering
- Clustering by passing messages between data points
- Clustering incomplete relational data using the non-Euclidean relational fuzzy c-means algorithm
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1834445 (Why is no real title available?)
- Robust K-Median and K-means clustering algorithms for incomplete data
- Application of interval-valued aggregation to optimization problem of \(k\)-NN classifiers for missing values case
- Multi-objective clustering algorithm based on the nearest neighbor interval for incomplete gene expression data
- scientific article; zbMATH DE number 7108501 (Why is no real title available?)
- Generalized density attractor clustering for incomplete data
This page was built for publication: \(K\)-nearest neighbor intervals based AP clustering algorithm for large incomplete data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665949)
