Batch active learning for time-series classification with multi-mode exploration

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Sangho Lee , Chihyeon Choi , Hyungrok Do , Youngdoo Son
{"title":"Batch active learning for time-series classification with multi-mode exploration","authors":"Sangho Lee ,&nbsp;Chihyeon Choi ,&nbsp;Hyungrok Do ,&nbsp;Youngdoo Son","doi":"10.1016/j.ins.2025.122109","DOIUrl":null,"url":null,"abstract":"<div><div>Collecting a sufficient amount of labeled data is challenging in practice. To deal with this challenge, active learning, which selects informative instances for annotation, has been studied. However, for time series, the dataset quality is often quite poor, and its multi-modality makes it unsuited to conventional active learning methods. Existing time series active learning methods have limitations, such as redundancy among selected instances, unrealistic assumptions on datasets, and inefficient calculations. We propose a batch active learning method for time series (BALT), which efficiently selects a batch of informative samples. BALT performs efficient clustering and picks one instance with the maximum informativeness score from each cluster. Using this score, we consider in-batch diversity explicitly so as to effectively handle multi-modality by exploring unknown regions, even under an extreme lack of labeled data. We also apply an adaptive weighting strategy to emphasize exploration in the early stage of the algorithm but shift to exploitation as the algorithm proceeds. Through experiments on several time-series datasets under various scenarios, we demonstrate the efficacy of BALT in achieving superior classification performance with less computation time under a predetermined budget, compared to existing time-series active learning methods.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"711 ","pages":"Article 122109"},"PeriodicalIF":8.1000,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525002415","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Collecting a sufficient amount of labeled data is challenging in practice. To deal with this challenge, active learning, which selects informative instances for annotation, has been studied. However, for time series, the dataset quality is often quite poor, and its multi-modality makes it unsuited to conventional active learning methods. Existing time series active learning methods have limitations, such as redundancy among selected instances, unrealistic assumptions on datasets, and inefficient calculations. We propose a batch active learning method for time series (BALT), which efficiently selects a batch of informative samples. BALT performs efficient clustering and picks one instance with the maximum informativeness score from each cluster. Using this score, we consider in-batch diversity explicitly so as to effectively handle multi-modality by exploring unknown regions, even under an extreme lack of labeled data. We also apply an adaptive weighting strategy to emphasize exploration in the early stage of the algorithm but shift to exploitation as the algorithm proceeds. Through experiments on several time-series datasets under various scenarios, we demonstrate the efficacy of BALT in achieving superior classification performance with less computation time under a predetermined budget, compared to existing time-series active learning methods.
基于多模式探索的批量主动学习时序分类
收集足够数量的标记数据在实践中是具有挑战性的。为了应对这一挑战,主动学习研究了选择信息丰富的实例进行标注的方法。然而,对于时间序列来说,数据集质量往往很差,而且它的多模态使得它不适合传统的主动学习方法。现有的时间序列主动学习方法存在局限性,如所选实例之间的冗余,对数据集的不切实际的假设以及低效的计算。提出了一种时间序列的批量主动学习方法(BALT),该方法可以有效地选择一批信息样本。BALT执行有效的聚类,并从每个聚类中选择一个信息得分最大的实例。利用这个分数,我们明确地考虑了批内多样性,以便在极度缺乏标记数据的情况下,通过探索未知区域有效地处理多模态。我们还采用自适应加权策略,在算法的早期阶段强调探索,但随着算法的进行,转向利用。通过对多个时间序列数据集在不同场景下的实验,我们证明了与现有的时间序列主动学习方法相比,BALT在预定预算下以更少的计算时间获得了更好的分类性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
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学术官方微信