Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ren, Chunhuaa; b; c; * | Sun, Linfua; c | Gao, Yunhuia; c | Yu, Yanga; c
Affiliations: [a] School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China | [b] Department of Artificial Intelligence and Big Data, Yibin University, Yibin, China | [c] Sichuan Provincial Key Laboratory of Manufacturing Industry Chains Collaboration and Information Support Technology, Southwest Jiaotong University, Chengdu, China
Correspondence: [*] Corresponding author. Chunhua Ren, School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, 611756, China. E-mail: [email protected].
Abstract: The density peaks clustering algorithm (DPC) has been widely concerned since it was proposed in 2014. There is no need to specify in advance and only one parameter required. However, some disadvantages are still witnessed in DPC: (1) Requiring repeated experiments for choosing a suitable calculation method of the local density due to the variations in the scale of the dataset, which will lead to additional time cost. (2) Difficulty in finding an optimal cutoff distance threshold, since different parameters not only impact the selection of cluster centers but also directly affect the quality of clusters. (3) Poor fault tolerance of the allocation strategy, especially in manifold datasets or datasets with uneven density distribution. Targetting solutions to these problems, a density peaks clustering based on local fair density and fuzzy k-nearest neighbors membership allocation strategy (LF-DPC) is proposed in this paper. First, to obtain a more balanced local density, two classic local density calculation methods are combined in the algorithm to calculate the local fair density through the optimization function with the smallest local density difference. Second, a robust two stage remaining points allocation strategy is designed. In the first stage, k-nearest neighbors are used to quickly and accurately allocate points from the cluster center. In the second stage, to further improve the accuracy of allocation, a fuzzy k-nearest neighbors membership method is designed to allocate the remaining points. Finally, the LF-DPC algorithm has been experimented based on several synthetic and real-world datasets. The results prove that the proposed algorithm has obvious advantages compared with the other five ones.
Keywords: Density peaks clustering, local fair density, fuzzy k-nearest neighbors, membership allocation strategy
DOI: 10.3233/JIFS-202449
Journal: Journal of Intelligent & Fuzzy Systems, vol. 43, no. 1, pp. 21-34, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]