Journal
IEEE ACCESS
Volume 6, Issue -, Pages 68892-68909Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2018.2880271
Keywords
Granular computing; cluster; reduction; affinity propagation; kernel function
Categories
Funding
- National Natural Science Foundation of China [61772176, 61402153, 61370169, 61472042]
- China Postdoctoral Science Foundation [2016M602247]
- Plan for Scientific Innovation Talent of Henan Province [184100510003]
- Key Scientific and Technological Project of Henan Province [182102210362, 182102210078]
- Young Scholar Program of Henan Province [2017GGJS041]
- Key Scientific and Technological Project of Xinxiang City [CXGG17002]
- Natural Science Foundation of Henan Province [182300410130, 182300410368]
- Ph.D. Research Foundation of Henan Normal University [qd15132, qd15129]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available