• Mar 27, 2019 News!Good News! All papers from Volume 9, Number 1 have been indexed by Scopus!   [Click]
  • May 07, 2019 News!Vol.9, No.3 has been published with online version.   [Click]
  • Mar 30, 2019 News!Vol.9, No.2 has been published with online version.   [Click]
Search
General Information
    • ISSN: 2010-3700
    • Abbreviated Title: Int. J. Mach. Learn. Comput.
    • DOI: 10.18178/IJMLC
    • Editor-in-Chief: Dr. Lin Huang
    • Executive Editor:  Ms. Cherry L. Chen
    • Abstracing/Indexing: Scopus(since 2017), EI (INSPEC, IET), Google Scholar, Crossref, ProQuest, Electronic Journals Library.
    • E-mail: ijmlc@ejournal.net
Editor-in-chief
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2018 Vol.8(5): 423-427 ISSN: 2010-3700
DOI: 10.18178/ijmlc.2018.8.5.723

A Hybrid Active Learning and Progressive Sampling Algorithm

Amr ElRafey and Janusz Wojtusiak
Abstract—Sampling techniques for data mining applications can be broadly categorized into Random Sampling (RS), Active Learning (AL) and Progressive Sampling (PS). Progressive Sampling techniques grow an initial sample up to the point beyond which model accuracy no longer significantly improves. These methods have been shown to be computationally efficient. The sampling schedule to be used with progressive sampling techniques is still an ongoing issue of research due to the fact that available sampling schemes may either overshoot, resulting in a final sample which is larger than necessary, or they may grow the sample too slowly thus requiring many iterations of the algorithm before convergence is reached. We demonstrate how using Batch Mode Uncertainty Sampling from the domain of active learning, to progressively grow the sample, can significantly improve the performance of progressive sampling. Through a series of trials on both simulated and real data, we show that our proposed Progressive Batch Mode Uncertainty Sampling (PBMUS) algorithm converges with a comparable or smaller number of data points at higher accuracy and in some cases, less computational time.

Index Terms—Active learning, uncertainty sampling, progressive sampling, linear regression with local sampling, random sampling, sampling, machine learning.

The authors are with George Mason University, Fairfax, VA 22030, USA (e-mail: aelrafey@gmu.edu, jwojtusi@gmu.edu).

[PDF]

Cite: Amr ElRafey and Janusz Wojtusiak, "A Hybrid Active Learning and Progressive Sampling Algorithm," International Journal of Machine Learning and Computing vol. 8, no. 5, pp. 423-427, 2018.

Copyright © 2008-2019. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net