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: Cao, Maojuna | Hu, Yingdaa; * | Yue, Lizhub
Affiliations: [a] Business Administration Department, Liaoning Technical University, Huludao, China | [b] Economics and Management Department, Huangshan University, Huangshan, Anhui, China
Correspondence: [*] Corresponding author. Yingda Hu, Business Administration Department, Liaoning Technical University, Huludao 125100, China. E-mail: 1476072426@qq.com.
Note: [1] This work was supported in part by the Liaoning Provincial Department of Education Fund under Grant LJ2020JCL028.
Abstract: The uncertainty of weight makes the weight density between samples not fixed. Aiming at the problem that the existing CLIQUE clustering algorithm does not consider the weight of object features, which leads to low accuracy, an improved weighted method combined with the thought of posets is proposed. In addition, this method does not need accurate weight assignment, only the weight order can run efficiently. First, the weight order of object features is obtained, and then the partial order weight is applied to the original data to obtain weighted data with weights. Then the traditional CLIQUE algorithm is used to cluster according to weighted data, and finally the partial order weighted CLIQUE model is obtained. Through the experiment of six groups of data, the results show that: under the given weight sequence constraints, the clustering quality of the weighted CLIQUE model is significantly higher than that of the unweighted model, and the clustering accuracy and other aspects are significantly improved. In this method model, weight information is effectively integrated into the algorithm when only the feature weight order is obtained, and the function of feature weight is fully played to enhance the robustness of clustering results. At the same time, the idea of poset can effectively integrate expert information, and the representation of the nearest neighbor elements in Hasse graph can show the effect intuitively. It is an effective improvement method of CLIQUE clustering algorithm.
Keywords: Clustering, proposed, CLIQUE algorithm, feature weight, Hasse graph
DOI: 10.3233/JIFS-224214
Journal: Journal of Intelligent & Fuzzy Systems, vol. 44, no. 6, pp. 9461-9473, 2023
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
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
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl