返回
Tri-partition cost-sensitive active learning through kNN
DOI:10.1007/s00500-017-2879-x.png)
摘要
En 中文
Active learning differs from the training-testing scenario in that class labels can be obtained upon request. It is widely employed in applications where the labeling of instances incurs a heavy manual cost. In this paper, we propose a new algorithm called tri-partition active learning through k-nearest neighbors (TALK). The optimization objective is to minimize the total teacher and misclassification costs. First, a k-nearest neighbors classifier is employed to divide unlabeled instances into three disjoint regions. Region I contains instances for which the expected misclassification cost is lower than the teacher cost, Region II contains instances to be labeled by human experts, and Region III contains the remaining instances. Various strategies are designed to determine which instances are in Region II. Second, instances in Regions I and II are labeled and added to the training set, and the tri-partition process is repeated until all instances have been labeled. Experiments are undertaken on eight University of California, Irvine, datasets using different cost settings. Compared with the state-of-the-art cost-sensitive classification and active learning algorithms, our new algorithm generally exhibits a lower total cost.
Keyword:
Active learning
Classification
Cost
k-Nearest neighbors
Tri-partition
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Training cost-sensitive neural networks with methods addressing the class imbalance problem用解决类不平衡问题的方法训练代价敏感的神经网络
Representative-based classification through covering-based neighborhood rough sets
APPLIED INTELLIGENCE
IF3.5
Fracture risk with use of liver enzyme inducing antiepileptic drugs in people with active epilepsy: Cohort study using the General Practice Research Database
Seizure
IF0

