.png){kind=icon}
返回
Annotation cost-sensitive active learning by tree sampling
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-019-05781-7.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Active learning is an important machine learning setup for reducing the labelling effort of humans. Although most existing works are based on a simple assumption that each labelling query has the same annotation cost, the assumption may not be realistic. That is, the annotation costs may actually vary between data instances. In addition, the costs may be unknown before making the query. Traditional active learning algorithms cannot deal with such a realistic scenario. In this work, we study annotation cost-sensitive active learning algorithms, which need to estimate the utility and cost of each query simultaneously. We propose a novel algorithm, the cost-sensitive tree sampling algorithm, that conducts the two estimation tasks together and solve it with a tree-structured model motivated from hierarchical sampling, a famous algorithm for traditional active learning. Extensive experimental results using datasets with simulated and true annotation costs validate that the proposed method is generally superior to other annotation cost-sensitive algorithms.
Keyword:
Annotation cost-sensitive
Active learning
Clustering
Decision tree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
.png){kind=icon}
分享收藏Specific character of objective methods for determining weights of criteria in MCDM problems: Entropy, CRITIC and SD确定MCDM问题中标准权重的客观方法的特定特征: 熵，批评家和SD
OAAI
OAAI分享收藏
查看更多内容