A divide-and-conquer approach to geometric sampling for active learning

被引:5
|
作者
Cao, Xiaofeng [1 ]
机构
[1] Univ Technol Sydney, Adv Analyt Inst, Blackfriars St, Chippendale, NSW 2008, Australia
关键词
Active learning; Uncertainty evaluation; Geometric sampling; Cluster boundary;
D O I
10.1016/j.eswa.2019.112907
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Active learning (AL) repeatedly trains the classifier with the minimum labeling budget to improve the current classification model. The training process is usually supervised by an uncertainty evaluation strategy. However, the uncertainty evaluation always suffers from performance degeneration when the initial labeled set has insufficient labels. To completely eliminate the dependence on the uncertainty evaluation sampling in AL, this paper proposes a divide-and-conquer idea that directly transfers the AL sampling as the geometric sampling over the clusters. By dividing the points of the clusters into cluster boundary and core points, we theoretically discuss their margin distance and hypothesis relationship. With the advantages of cluster boundary points in the above two properties, we propose a Geometric Active Learning (GAL) algorithm by knight's tour. Experimental studies of the two reported experimental tasks including cluster boundary detection and AL classification show that the proposed GAL method significantly outperforms the state-of-the-art baselines. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:14
相关论文
共 50 条
  • [31] MULTIDIMENSIONAL DIVIDE-AND-CONQUER
    BENTLEY, JL
    [J]. COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229
  • [32] HEADINGS, OR DIVIDE-AND-CONQUER
    DOLLE, R
    [J]. JOURNAL OF ENVIRONMENTAL HEALTH, 1990, 53 (03) : 56 - 56
  • [33] A divide-and-conquer approach for content replication in WMNs
    Al-Arnaout, Zakwan
    Fu, Qiarig
    Frean, Marcus
    [J]. COMPUTER NETWORKS, 2013, 57 (18) : 3914 - 3928
  • [34] A divide-and-conquer approach to compressed sensing MRI
    Sun, Liyan
    Fan, Zhiwen
    Ding, Xinghao
    Cai, Congbo
    Huang, Yue
    Paisley, John
    [J]. MAGNETIC RESONANCE IMAGING, 2019, 63 : 37 - 48
  • [35] A Divide-and-Conquer Approach to the Summarization of Long Documents
    Gidiotis, Alexios
    Tsoumakas, Grigorios
    [J]. IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2020, 28 : 3029 - 3040
  • [36] Random sampling of contingency tables via probabilistic divide-and-conquer
    Stephen DeSalvo
    James Zhao
    [J]. Computational Statistics, 2020, 35 : 837 - 869
  • [37] Random sampling of contingency tables via probabilistic divide-and-conquer
    DeSalvo, Stephen
    Zhao, James
    [J]. COMPUTATIONAL STATISTICS, 2020, 35 (02) : 837 - 869
  • [38] A Divide-and-Conquer Approach for Large-scale Multi-label Learning
    Zhang, Wenjie
    Wang, Xiangfeng
    Yan, Junchi
    Zha, Hongyuan
    [J]. 2017 IEEE THIRD INTERNATIONAL CONFERENCE ON MULTIMEDIA BIG DATA (BIGMM 2017), 2017, : 398 - 401
  • [39] A Divide-and-Conquer Method for Scalable Robust Multitask Learning
    Pan, Yan
    Xia, Rongkai
    Yin, Jian
    Liu, Ning
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2015, 26 (12) : 3163 - 3175
  • [40] Iteratively Divide-and-Conquer Learning for Nonlinear Classification and Ranking
    Wu, Ou
    Mao, Xue
    Hu, Weiming
    [J]. ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2018, 9 (02)