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 条
  • [41] Divide-and-Conquer Learning with Nystrom: Optimal Rate and Algorithm
    Yin, Rong
    Liu, Yong
    Lu, Lijing
    Wang, Weiping
    Meng, Dan
    [J]. THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 6696 - 6703
  • [42] Privacy-Preserving and Secure Divide-and-Conquer Learning
    Brown, Lewis C. L.
    Li, Qinghua
    [J]. 2022 IEEE/ACM 7TH SYMPOSIUM ON EDGE COMPUTING (SEC 2022), 2022, : 510 - 515
  • [43] PairRank: Online Pairwise Learning to Rank by Divide-and-Conquer
    Jia, Yiling
    Wang, Huazheng
    Guo, Stephen
    Wang, Hongning
    [J]. PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, : 146 - 157
  • [44] A divide-and-conquer approach for genomic prediction in rubber tree using machine learning
    Aono, Alexandre Hild
    Francisco, Felipe Roberto
    Souza, Livia Moura
    Goncalves, Paulo de Souza
    Scaloppi Junior, Erivaldo J.
    Le Guen, Vincent
    Fritsche-Neto, Roberto
    Gorjanc, Gregor
    Quiles, Marcos Goncalves
    de Souza, Anete Pereira
    [J]. SCIENTIFIC REPORTS, 2022, 12 (01)
  • [45] A Divide-and-Conquer Approach Towards Understanding Deep Networks
    Fu, Weilin
    Breininger, Katharina
    Schaffert, Roman
    Ravikumar, Nishant
    Maier, Andreas
    [J]. MEDICAL IMAGE COMPUTING AND COMPUTER ASSISTED INTERVENTION - MICCAI 2019, PT I, 2019, 11764 : 183 - 191
  • [46] A divide-and-conquer approach for genomic prediction in rubber tree using machine learning
    Alexandre Hild Aono
    Felipe Roberto Francisco
    Livia Moura Souza
    Paulo de Souza Gonçalves
    Erivaldo J. Scaloppi Junior
    Vincent Le Guen
    Roberto Fritsche-Neto
    Gregor Gorjanc
    Marcos Gonçalves Quiles
    Anete Pereira de Souza
    [J]. Scientific Reports, 12
  • [47] JuliusC: A practical approach for the analysis of divide-and-conquer algorithms
    D'Alberto, P
    Nicolau, A
    [J]. LANGUAGES AND COMPILERS FOR HIGH PERFORMANCE COMPUTING, 2005, 3602 : 117 - 131
  • [48] A divide-and-conquer approach to analyze underdetermined biochemical models
    Kotte, Oliver
    Heinemann, Matthias
    [J]. BIOINFORMATICS, 2009, 25 (04) : 519 - 525
  • [49] SAR processing in small pieces - a divide-and-conquer approach
    Larsen, Yngvar
    Engen, Geir
    [J]. 10TH EUROPEAN CONFERENCE ON SYNTHETIC APERTURE RADAR (EUSAR 2014), 2014,
  • [50] EIGENVALUES OF A SYMMETRICAL TRIDIAGONAL MATRIX - A DIVIDE-AND-CONQUER APPROACH
    KRISHNAKUMAR, AS
    MORF, M
    [J]. NUMERISCHE MATHEMATIK, 1986, 48 (03) : 349 - 368