Label Expansion for Multi-label Classification

A. Rivolli, C. Soares, A. Carvalho
{"title":"Label Expansion for Multi-label Classification","authors":"A. Rivolli, C. Soares, A. Carvalho","doi":"10.1109/BRACIS.2018.00078","DOIUrl":null,"url":null,"abstract":"In multi-label classification tasks, instances are simultaneously associated with multiple labels, representing different and, possibly, related concepts from a domain. One characteristic of these tasks is a high class-label imbalance. In order to obtain improved predictive models, several algorithms either have explored the label dependencies or have dealt with the problem of imbalanced labels. This work proposes a label expansion approach which combines both alternatives. For such, some labels are expanded with data from a related class label, making the labels more balanced and representative. Preliminary experiments show the effectiveness of this approach to improve the Binary Relevance strategy. Particularly, it reduced the number of labels that were never predicted in the test instances. Although the results are preliminary, they are potentially attractive, considering the scale and consistency of the improvement obtained, as well as the broad scope of the proposed approach.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2018.00078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In multi-label classification tasks, instances are simultaneously associated with multiple labels, representing different and, possibly, related concepts from a domain. One characteristic of these tasks is a high class-label imbalance. In order to obtain improved predictive models, several algorithms either have explored the label dependencies or have dealt with the problem of imbalanced labels. This work proposes a label expansion approach which combines both alternatives. For such, some labels are expanded with data from a related class label, making the labels more balanced and representative. Preliminary experiments show the effectiveness of this approach to improve the Binary Relevance strategy. Particularly, it reduced the number of labels that were never predicted in the test instances. Although the results are preliminary, they are potentially attractive, considering the scale and consistency of the improvement obtained, as well as the broad scope of the proposed approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多标签分类的标签扩展
在多标签分类任务中,实例同时与多个标签相关联,代表来自一个领域的不同的(可能是相关的)概念。这些任务的一个特点是阶级标签的高度不平衡。为了获得改进的预测模型,一些算法要么探索标签依赖关系,要么处理标签不平衡的问题。这项工作提出了一种结合两种替代方案的标签扩展方法。对于这种情况,一些标签会使用来自相关类标签的数据进行扩展,从而使标签更加平衡和具有代表性。初步实验表明,该方法可以有效地改进二值相关策略。特别是,它减少了测试实例中从未预测过的标签的数量。虽然结果是初步的,但考虑到所获得的改进的规模和一致性,以及拟议方法的广泛范围,它们可能具有吸引力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Exploring the Data Using Extended Association Rule Network SPt: A Text Mining Process to Extract Relevant Areas from SW Documents to Exploratory Tests Gene Essentiality Prediction Using Topological Features From Metabolic Networks Bio-Inspired and Heuristic Methods Applied to a Benchmark of the Task Scheduling Problem A New Genetic Algorithm-Based Pruning Approach for Optimum-Path Forest
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1