An Affinity Propagation Clustering Method Using Hybrid Kernel Function With LLE

Cluster analysis is important in data mining and clustering algorithms and has gained much attention during the last decade. However, it is a challenge to extract significant features from high-dimensional data and to rapidly provide satisfactory clustering results. This paper presents a new affinit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2018, Vol.6, p.68892-68909
Hauptverfasser: Sun, Lin, Liu, Ruonan, Xu, Jiucheng, Zhang, Shiguang, Tian, Yun
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Cluster analysis is important in data mining and clustering algorithms and has gained much attention during the last decade. However, it is a challenge to extract significant features from high-dimensional data and to rapidly provide satisfactory clustering results. This paper presents a new affinity propagation (AP) clustering method based on a hybrid kernel function with locally linear embedding, called LLE-HKAP, for the classification of gene expression datasets and standard UCI datasets. First, the locally linear embedding algorithm is used to reduce the dimension of the original dataset. Then, a novel AP clustering method based on a similarity measure with the hybrid kernel function is proposed. In this method, a new global kernel is defined that has high generalization ability. Meanwhile, a hybrid kernel function that linearly combines the proposed global kernel and the Gaussian kernel is defined to further enhance the learning ability of the global kernel. Moreover, the novel hybrid kernel is introduced to define a similarity measure and construct a similarity matrix of the AP clustering. Finally, the improved AP clustering algorithm is implemented on eight public gene expression datasets and eight standard UCI datasets for comparison with other related algorithms. The experimental results validate that our proposed clustering algorithm is efficient in terms of clustering accuracy and outperforms the currently available approaches with which it is compared.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2880271