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: Liang, Baohuaa; b; c; * | Lu, Zhengyua; b
Affiliations: [a] Key Lab of Education Blockchain and Intelligent Technology, Ministry of Education, Guangxi Normal University, Guilin, Chain | [b] Guangxi Key Lab of Multi-Source Information Mining and Security, Guangxi Normal University, Guilin, China | [c] Institute of Computer and Artifical Intelligence, Chaohu University, Hefei, China
Correspondence: [*] Corresponding author. Baohua Liang, Tel.: +86 13675652623; E-mail: lbh730426@163.com.
Abstract: Attribute reduction is a widely used technique in data preprocessing, aiming to remove redundant and irrelevant attributes. However, most attribute reduction models only consider the importance of attributes as an important basis for reduction, without considering the relationship between attributes and the impact on classification results. In order to overcome this shortcoming, this article firstly defines the distance between samples based on the number of combinations formed by comparing the samples in the same sub-division. Secondly, from the point of view of clustering, according to the principle that the distance between each point in the cluster should be as small as possible, and the sample distance between different clusters should be as large as possible, the combined distance is used to define the importance of attributes. Finally, according to the importance of attributes, a new attribute reduction mechanism is proposed. Furthermore, plenty of experiments are done to verify the performance of the proposed reduction algorithm. The results show that the data sets reduced by our algorithm has a prominent advantage in classification accuracy, which can effectively reduce the dimensionality of high-dimensional data, and at the same time provide new methods for the study of attribute reduction models.
Keywords: Rough sets, attribute reduction, clustering, combined distance
DOI: 10.3233/JIFS-222666
Journal: Journal of Intelligent & Fuzzy Systems, vol. 45, no. 1, pp. 1481-1496, 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