Heterogeneous Feature Selection Based on Neighborhood Combination Entropy

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS(2024)

引用 15|浏览34
暂无评分
摘要
Feature selection aims to remove irrelevant or redundant features and thereby remain relevant or informative features so that it is often preferred for alleviating the dimensionality curse, enhancing learning performance, providing better readability and interpretability, and so on. Data that contain numerical and categorical representations are called heterogeneous data, and they exist widely in many real-world applications. Neighborhood rough set (NRS) can effectively deal with heterogeneous data by using neighborhood binary relation, which has been successfully applied to heterogeneous feature selection. In this article, the NRS model as a unified framework is used to design a feature selection method to handle categorical, numerical, and heterogeneous data. First, the concept of neighborhood combination entropy (NCE) is presented. It can reflect the probability of pairs of the neighborhood granules that are probably distinguishable from each other. Then, the conditional neighborhood combination entropy (cNCE) based on NCE is proposed under the condition of considering decision attributes. Moreover, some properties and relationships between cNCE and NCE are derived. Finally, the functions of inner and outer significances are constructed to design a feature selection algorithm based on cNCE (FScNCE). The experimental results show the effectiveness and superiority of the proposed algorithm.
更多
查看译文
关键词
Feature extraction,Entropy,Measurement uncertainty,Uncertainty,Heuristic algorithms,Rough sets,Information systems,Combination entropy,feature selection,heterogeneous data,neighborhood rough set (NRS)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要