Hierarchical Feature Selection Based on Instance Correlation and Label Semantic Structure

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Yu Mao, Chunyu Shi, Zhiyi Cai, Hui Chen, Lei Guo
{"title":"Hierarchical Feature Selection Based on Instance Correlation and Label Semantic Structure","authors":"Yu Mao,&nbsp;Chunyu Shi,&nbsp;Zhiyi Cai,&nbsp;Hui Chen,&nbsp;Lei Guo","doi":"10.1002/cpe.70079","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Hierarchical classification learning aims to exploit the hierarchical relationship between data categories. Making full use of the hierarchical structure between class labels can effectively reduce the number of categories for each classification task and improve the accuracy of classification. For hierarchical feature selection, usually the more similar two labels are, the more features they share. However, existing hierarchical feature selection algorithms often ignore this. In addition, current hierarchical feature selection algorithms do not deeply consider the semantic structure between labels when exploiting label correlations. In this article, we propose a hierarchical feature selection based on instance correlation and label semantic structure. This algorithm expresses the correlation between instances with the help of Laplacian matrix. Then, the instance correlation is combined with the semantic relationship between labels in the hierarchical structure to construct a hierarchical feature selection model. To prove the effectiveness of the proposed algorithm, a large number of experiments are conducted on hierarchical datasets in different fields, and multiple hierarchical feature selection are compared. The experimental results demonstrate that the proposed algorithm has significant performance superiority.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 9-11","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70079","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Hierarchical classification learning aims to exploit the hierarchical relationship between data categories. Making full use of the hierarchical structure between class labels can effectively reduce the number of categories for each classification task and improve the accuracy of classification. For hierarchical feature selection, usually the more similar two labels are, the more features they share. However, existing hierarchical feature selection algorithms often ignore this. In addition, current hierarchical feature selection algorithms do not deeply consider the semantic structure between labels when exploiting label correlations. In this article, we propose a hierarchical feature selection based on instance correlation and label semantic structure. This algorithm expresses the correlation between instances with the help of Laplacian matrix. Then, the instance correlation is combined with the semantic relationship between labels in the hierarchical structure to construct a hierarchical feature selection model. To prove the effectiveness of the proposed algorithm, a large number of experiments are conducted on hierarchical datasets in different fields, and multiple hierarchical feature selection are compared. The experimental results demonstrate that the proposed algorithm has significant performance superiority.

基于实例关联和标签语义结构的分层特征选择
层次分类学习的目的是利用数据类别之间的层次关系。充分利用类标签之间的层次结构,可以有效地减少每个分类任务的类别数量,提高分类的准确率。对于分层特征选择,通常两个标签越相似,它们共享的特征越多。然而,现有的分层特征选择算法往往忽略了这一点。此外,目前的分层特征选择算法在利用标签相关性时没有深入考虑标签之间的语义结构。本文提出了一种基于实例关联和标签语义结构的分层特征选择方法。该算法借助拉普拉斯矩阵来表达实例之间的相关性。然后,将实例相关性与分层结构中标签之间的语义关系相结合,构建分层特征选择模型;为了证明本文算法的有效性,在不同领域的分层数据集上进行了大量的实验,并对多个分层特征选择进行了比较。实验结果表明,该算法具有显著的性能优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信