Adaptive batch mode active learning with deep similarity

被引:1
作者
Zhang, Kaiyuan [1 ]
Qian, Buyue [2 ]
Wei, Jishang [3 ]
Yin, Changchang [1 ]
Cao, Shilei [1 ]
Li, Xiaoyu [1 ]
Cao, Yanjun [4 ]
Zheng, Qinghua [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[2] Capital Med Univ, Beijing Chaoyang Hosp, Beijing 100020, Peoples R China
[3] HP Labs, 1501 Page Mill Rd, Palo Alto, CA 94304 USA
[4] Northwest Univ, Biomed Key Lab Shaanxi Prov, Xian 710069, Peoples R China
基金
中国国家自然科学基金;
关键词
Active learning; Adaptive batch mode active learning; Classification model; Deep neural network; Deep learning; CLASSIFICATION;
D O I
10.1016/j.eij.2023.100412
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Active learning is usually used in scenarios where few labels are available and manual labeling is expensive. To improve model performance, it is necessary to find the most valuable instance among all instances and label it to maximize the benefits of labeling. In practical scenarios, it is often more efficient to query a group of instances instead of a individual instance during each iteration. To achieve this goal, we need to explore the similarities between instances to ensure the informativeness and diversity. Many ad-hoc algorithms are proposed for batch mode active learning, and there are generally two major issues. One is that similarity measurement among in-stances often only relies on the expression of features but it is not well integrated with the classification algo-rithm model. This will cut down the precise measurement of diversity. The other is that in order to explore the decision boundary, these algorithms often choose the instance near the boundary. It is difficult to get the true boundary when there are few labeled instances. As a large number of instances continue to be labeled, infor-mation between instances is less used, and the performance will be greatly improved if it is properly used. In our work, we propose an adaptive algorithm based on deep neural networks to solve the two problems mentioned above. During the training phase, we established a paired network to improve the accuracy of the classification model, and the network can project the instance to a new feature space for more accurate similarity measure-ment. When batch labeling instances, we use the adaptive algorithm to select the instance by balancing the maximum uncertainty (exploration) and diversity (exploitation). Our algorithm has been validated for heart failure prediction tasks in real-world EHR datasets. Due to the no public of EHR data, we also conducted vali-dation on two other classic classification tasks. Our algorithm is superior to the baseline method in both accuracy and convergence rate.
引用
收藏
页数:11
相关论文
共 39 条
  • [1] Baram Y, 2004, J MACH LEARN RES, V5, P255
  • [2] Bondu A, 2010, IEEE IJCNN
  • [3] Brinker K., 2003, P 20 INT C MACHINE L, P59
  • [4] Active learning for object classification: from exploration to exploitation
    Cebron, Nicolas
    Berthold, Michael R.
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2009, 18 (02) : 283 - 299
  • [5] Batch Mode Active Sampling Based on Marginal Probability Distribution Matching
    Chattopadhyay, Rita
    Wang, Zheng
    Fan, Wei
    Davidson, Ian
    Panchanathan, Sethuraman
    Ye, Jieping
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2013, 7 (03)
  • [6] Dasarathy G., 2015, C LEARN THEOR, P503
  • [7] Selective sampling using the query by committee algorithm
    Freund, Y
    Seung, HS
    Shamir, E
    Tishby, N
    [J]. MACHINE LEARNING, 1997, 28 (2-3) : 133 - 168
  • [8] Fast R-CNN
    Girshick, Ross
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 1440 - 1448
  • [9] Guo Y, 2007, Adv Neural Inf Proces Syst
  • [10] Active Rare Class Discovery and Classification Using Dirichlet Processes
    Haines, Tom S. F.
    Xiang, Tao
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 2014, 106 (03) : 315 - 331