基于邻域粗糙集的交互式流媒体特征选择

IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
{"title":"基于邻域粗糙集的交互式流媒体特征选择","authors":"","doi":"10.1016/j.engappai.2024.109479","DOIUrl":null,"url":null,"abstract":"<div><div>Feature streams refer to features that arrive continuously over time without changing the number of samples. Such data is commonly encountered in various practical application scenarios. Stream feature selection is a technique designed to select relevant features from high-dimensional stream data, thereby reducing its overall size. Feature interaction plays a crucial role in influencing the results of feature selection. Most existing methods address stream feature selection primarily by focusing on irrelevance and redundancy, often overlooking the important interactions between features. Additionally, these methods typically assume that all samples and features are known, which contradicts the fundamental nature of streaming data. This study introduces an interactive feature selection approach for stream feature selection, utilizing the neighborhood rough set. First, we provide a basic explanation of multi-neighbor entropy, which measures the amount of information related to neighborhood classes. It is used to measure how the amount of information about neighborhood classes. Next, we propose a feature evaluation method based on correlation, redundancy, and interaction analysis. Finally, we elaborate on functions for feature evaluation criteria, aiming to design streaming feature selection algorithms that integrate correlation, redundancy, and interactivity. The proposed algorithm is compared with six other representative feature selection algorithms across 14 public datasets. Experimental results demonstrate the validity of our proposed solution.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":7.5000,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interactive streaming feature selection based on neighborhood rough sets\",\"authors\":\"\",\"doi\":\"10.1016/j.engappai.2024.109479\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Feature streams refer to features that arrive continuously over time without changing the number of samples. Such data is commonly encountered in various practical application scenarios. Stream feature selection is a technique designed to select relevant features from high-dimensional stream data, thereby reducing its overall size. Feature interaction plays a crucial role in influencing the results of feature selection. Most existing methods address stream feature selection primarily by focusing on irrelevance and redundancy, often overlooking the important interactions between features. Additionally, these methods typically assume that all samples and features are known, which contradicts the fundamental nature of streaming data. This study introduces an interactive feature selection approach for stream feature selection, utilizing the neighborhood rough set. First, we provide a basic explanation of multi-neighbor entropy, which measures the amount of information related to neighborhood classes. It is used to measure how the amount of information about neighborhood classes. Next, we propose a feature evaluation method based on correlation, redundancy, and interaction analysis. Finally, we elaborate on functions for feature evaluation criteria, aiming to design streaming feature selection algorithms that integrate correlation, redundancy, and interactivity. The proposed algorithm is compared with six other representative feature selection algorithms across 14 public datasets. Experimental results demonstrate the validity of our proposed solution.</div></div>\",\"PeriodicalId\":50523,\"journal\":{\"name\":\"Engineering Applications of Artificial Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2024-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Applications of Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0952197624016373\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0952197624016373","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

特征流指的是在不改变样本数量的情况下随时间连续到达的特征。在各种实际应用场景中,经常会遇到这样的数据。数据流特征选择是一种技术,旨在从高维数据流中选择相关特征,从而缩小数据流的总体规模。特征交互对特征选择结果的影响至关重要。大多数现有方法主要通过关注无关性和冗余性来解决流特征选择问题,但往往忽略了特征之间的重要交互作用。此外,这些方法通常假设所有样本和特征都是已知的,这与流数据的基本性质相矛盾。本研究介绍了一种利用邻域粗糙集进行流特征选择的交互式特征选择方法。首先,我们对多邻类熵进行了基本解释。它用于衡量邻域类的信息量。接下来,我们提出了一种基于相关性、冗余性和交互性分析的特征评估方法。最后,我们阐述了特征评估标准的函数,旨在设计出整合相关性、冗余性和交互性的流特征选择算法。我们将所提出的算法与其他六种具有代表性的特征选择算法在 14 个公共数据集上进行了比较。实验结果证明了我们提出的解决方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interactive streaming feature selection based on neighborhood rough sets
Feature streams refer to features that arrive continuously over time without changing the number of samples. Such data is commonly encountered in various practical application scenarios. Stream feature selection is a technique designed to select relevant features from high-dimensional stream data, thereby reducing its overall size. Feature interaction plays a crucial role in influencing the results of feature selection. Most existing methods address stream feature selection primarily by focusing on irrelevance and redundancy, often overlooking the important interactions between features. Additionally, these methods typically assume that all samples and features are known, which contradicts the fundamental nature of streaming data. This study introduces an interactive feature selection approach for stream feature selection, utilizing the neighborhood rough set. First, we provide a basic explanation of multi-neighbor entropy, which measures the amount of information related to neighborhood classes. It is used to measure how the amount of information about neighborhood classes. Next, we propose a feature evaluation method based on correlation, redundancy, and interaction analysis. Finally, we elaborate on functions for feature evaluation criteria, aiming to design streaming feature selection algorithms that integrate correlation, redundancy, and interactivity. The proposed algorithm is compared with six other representative feature selection algorithms across 14 public datasets. Experimental results demonstrate the validity of our proposed solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信