Online multi-label streaming feature selection by affinity significance, affinity relevance and affinity redundancy

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jianhua Dai, Duo Xu, Chucai Zhang
{"title":"Online multi-label streaming feature selection by affinity significance, affinity relevance and affinity redundancy","authors":"Jianhua Dai,&nbsp;Duo Xu,&nbsp;Chucai Zhang","doi":"10.1016/j.patcog.2025.111990","DOIUrl":null,"url":null,"abstract":"<div><div>Multi-label streaming feature selection has applied to various fields to deal with the applications that features arrive dynamically. However, most exist multi-label streaming feature selection methods ignore that a feature tends to provide more classification information for part of labels, rather than equal information for all labels. This phenomenon results part of labels get more information from selected features, while other labels lack information. In order to address the issue, we propose a novel multi-label streaming feature selection method. Firstly, we come up with the concept of affinity between features and labels. Secondly, we propose the concepts of affinity significance, affinity relevance and affinity redundancy to evaluate streaming features in three dimensions. Thirdly, we propose a novel multi-label streaming feature selection method named OMFS-FA. OMFS-FA has three phases to retain affinity significant features, remove affinity irrelevant features and remove affinity redundant features respectively. Finally, experiments on performance analysis, statistic analysis, number of selected features and running time analysis are conducted, verifying that OMFS-FA significantly outperforms other eleven methods in terms of effectiveness and efficiency.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"170 ","pages":"Article 111990"},"PeriodicalIF":7.5000,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325006508","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Multi-label streaming feature selection has applied to various fields to deal with the applications that features arrive dynamically. However, most exist multi-label streaming feature selection methods ignore that a feature tends to provide more classification information for part of labels, rather than equal information for all labels. This phenomenon results part of labels get more information from selected features, while other labels lack information. In order to address the issue, we propose a novel multi-label streaming feature selection method. Firstly, we come up with the concept of affinity between features and labels. Secondly, we propose the concepts of affinity significance, affinity relevance and affinity redundancy to evaluate streaming features in three dimensions. Thirdly, we propose a novel multi-label streaming feature selection method named OMFS-FA. OMFS-FA has three phases to retain affinity significant features, remove affinity irrelevant features and remove affinity redundant features respectively. Finally, experiments on performance analysis, statistic analysis, number of selected features and running time analysis are conducted, verifying that OMFS-FA significantly outperforms other eleven methods in terms of effectiveness and efficiency.
基于亲和性显著性、亲和性相关性和亲和性冗余的在线多标签流特征选择
多标签流特征选择已应用于各个领域,以处理特征动态到达的应用。然而,大多数现有的多标签流特征选择方法忽略了一个特征倾向于为部分标签提供更多的分类信息,而不是为所有标签提供相同的信息。这种现象导致部分标签从所选特征中获得更多的信息,而其他标签则缺乏信息。为了解决这个问题,我们提出了一种新的多标签流特征选择方法。首先,我们提出了特征与标签之间的关联概念。其次,我们提出了亲和重要性、亲和相关性和亲和冗余的概念,对流特征进行三维评价。第三,提出了一种新的多标签流特征选择方法OMFS-FA。OMFS-FA分为三个阶段,分别保留亲和性重要特征、去除亲和性无关特征和去除亲和性冗余特征。最后进行了性能分析、统计分析、特征选择数和运行时间分析等实验,验证了OMFS-FA在有效性和效率上明显优于其他11种方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Pattern Recognition
Pattern Recognition 工程技术-工程:电子与电气
CiteScore
14.40
自引率
16.20%
发文量
683
审稿时长
5.6 months
期刊介绍: The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信