粒度
特征选择
计算机科学
关系(数据库)
数据挖掘
模式识别(心理学)
特征(语言学)
人工智能
粗集
相似性(几何)
选择(遗传算法)
k-最近邻算法
集合(抽象数据类型)
嵌入
贪婪算法
相关性
机器学习
数学
算法
图像(数学)
语言学
哲学
几何学
程序设计语言
操作系统
作者
Yilin Wu,Jinghua Liu,Xiehua Yu,Yaojin Lin,Shaozi Li
摘要
Summary Neighborhood rough set (NRS) is considered as an effective tool for feature selection and has been widely used in processing high‐dimensional data. However, most of the existing methods are difficult to deal with multi‐label data and are lack of considering label correlation (LC), which is an important issue in multi‐label learning. Therefore, in this article, we introduce a new NRS model with considering LC. First, we explore LC by calculating the similarity relation between labels and divide the related labels into several label subsets. Then, a new neighborhood relation is proposed, which can solve the problem of neighborhood granularity selection by using the nearest neighbor information distribution of instances under the related labels. On this basis, the NRS model is reconstructed by embedding LC information, and the related properties of the model are discussed. Moreover, we design a new feature significance function to evaluate the quality of features, which can well capture the specific relationship between features and labels. Finally, a greedy forward feature selection algorithm is designed. Extensive experiments which are conducted on different types of datasets verify the effectiveness of the proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI