\(K\)-nearest neighbor intervals based AP clustering algorithm for large incomplete data (Q1665949): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2015/535932 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1702150715 / rank | |||
Normal rank |
Revision as of 03:27, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(K\)-nearest neighbor intervals based AP clustering algorithm for large incomplete data |
scientific article |
Statements
\(K\)-nearest neighbor intervals based AP clustering algorithm for large incomplete data (English)
0 references
27 August 2018
0 references
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.
0 references