<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Active Learning: Applications, Foundations and Emerging Trends (Tutorial)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Georg Krempl</string-name>
          <email>georg.krempl@ovgu.de</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vincent Lemaire</string-name>
          <email>vincent.lemaire@orange.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Edwin Lughofer</string-name>
          <email>edwin.lughofer@jku.at</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniel Kottke</string-name>
          <email>daniel.kottke@uni-kassel.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Orange Labs</institution>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University Kassel</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University Linz</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University Magdeburg</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>3</fpage>
      <lpage>4</lpage>
      <abstract>
        <p>Active learning optimizes the interaction between artificial data mining/machine learning systems and humans. For example, its techniques are used for selecting the most relevant information to be requested, or for determining the most informative experiment to be performed. With increasing volumes of data, contrasting limited human supervision capacities, the optimization of this interaction has become even more important. Hence, active sampling and data acquisition techniques could contribute to the design and modeling of highly intelligent learning systems. This tutorial presents the basic techniques for pool-based and on-line active learning for streams. It contains a summary of the common concepts like version space partitioning, uncertainty sampling and decision theoretic approaches, and shortly mentions the connection between reinforcement learning and active learning. We show how these concepts can be used in data streams and on-line applications, and discuss the main challenges of stream active learning. Finally, we evaluate frameworks for pool-based and stream-based active learning to validate if a method is applicable for a specific demand. Adaptive sampling [Sin06] and selective sampling [Roy01] are the two main scenarios to set active learning [Set12]. This tutorial focus on selective sampling. After defining the active learning problem in detail [Set12], we discuss three basic techniques: The selection criterion of methods using version space partitioning, is based on the disagreement between hypothesis [Ruf89], e.g., the disagreement within an ensemble of classifiers. Uncertainty sampling is an information theoretic approach, selecting instances based on the classifier's uncertainty, e.g., instances near the decision boundary. Decision theoretic approaches are among others expected error reduction, which simulate each label outcome for each label candidate, or probabilistic active learning [Kre14]. The latter uses local statistics of each candidate to estimate its gain in performance. (Online) Reinforcement learning tries to improve itself by interacting with the environment while active learning tries to solve the traditional supervised learning problem with a human in the loop. Seeing the human as a part of the environment, as an agent [Kap05], it/he has to find a policy that maps states of the world to the actions to be taken in those states. When the agent has to learn the action to pick the next label candidate, one way to do this is to consider the informativeness of this sample as a form of reward and the current set of labeled and unlabeled data as the observation [Set08].</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Active Learning: Applications, Foundations and Emerging Trends (Tutorial)</p>
    </sec>
    <sec id="sec-2">
      <title>On-line Active Learning for Streams</title>
      <p>In this section, we provide an overview on on-line active learning concepts for data streams. These algorithms
use different reliability concepts for instance selection, e.g., conflict and ignorance [Lug12]. We point out special
challenges for on-line algorithms and stream active learning and discuss possible solutions. Thereby, a specific
emphasis will be placed on active learning in connection with evolving (fuzzy) systems [Lug16], which are able
to expand their structure on the fly to properly react on ignorance cases and thus to reduce uncertainty in the
version space. A collection of some successful practical application examples, e.g., from quality control systems,
viscose production, or image classification systems, gives an idea of how to use these methods in practice.
5</p>
    </sec>
    <sec id="sec-3">
      <title>Evaluation of Active Learning</title>
      <p>Comparing active learning methods is challenging, as the results of common evaluation methodologies like 5- or
10-fold cross-validation are often not reliable and therefore insufficient. Hence, we propose to use an evaluation
framework using multiple randomly (seed-based) generated train and evaluation sets (typically 50 or more)
[Kre14], which also allow pairwise comparisons. The second part of this topic concentrates on stream evaluation
and shows why a separation of the temporal and spatial component of a stream active learner is mandatory in
order to compare two active approaches [Kot15]. Furthermore, we discuss different forms of visualization like
learning curves (performance vs. budget) and performance curves (performance vs. time) and show how the
definition of the target function can affect the evaluation.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [Kap05]
          <article-title>”Reinforcement learning for active model selection</article-title>
          .”
          <string-name>
            <given-names>A.</given-names>
            <surname>Kapoor</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Greiner</surname>
          </string-name>
          .
          <source>ACM SIGKDD Workshop on Utility-based Data Mining</source>
          ,
          <year>2005</year>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [Kre14]
          <article-title>”Optimised probabilistic active learning (OPAL)</article-title>
          .” Georg Krempl, Daniel Kottke,
          <source>Vincent Lemaire Machine Learning 100.2-3</source>
          (
          <year>2015</year>
          ):
          <fpage>449</fpage>
          -
          <lpage>476</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [Lug12]
          <article-title>”Single-pass active learning with conflict and ignorance</article-title>
          .”
          <source>Edwin Lughofer. Evolving Systems</source>
          <volume>3</volume>
          (
          <issue>4</issue>
          ),
          <fpage>251</fpage>
          -
          <lpage>271</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <source>[Lug16] ”Evolving Fuzzy Systems - Fundamentals</source>
          , Reliability, Interpretability and Useability.”
          <article-title>Edwin Lughofer</article-title>
          .
          <source>in: Handbook of Computational Intelligence</source>
          , World Scientific, pp.
          <fpage>67</fpage>
          -
          <lpage>135</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [Roy01]
          <article-title>”Toward optimal active learning through sampling estimation of error reduction” Roy</article-title>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>McCallum</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . In
          <source>: Proc. 18th International Conference on Machine Learning</source>
          , pp.
          <fpage>441</fpage>
          -
          <lpage>448</lpage>
          ,
          <year>2001</year>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [Ruf89]
          <article-title>”What good are experiments?” Ritchey A</article-title>
          .
          <string-name>
            <surname>Ruff</surname>
            ,
            <given-names>T. G.</given-names>
          </string-name>
          <string-name>
            <surname>Dietterich</surname>
          </string-name>
          .
          <source>Proceedings of the 6th International Workshop on Machine Learning</source>
          ,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [Set08]
          <article-title>”An Analysis of Active Learning Strategies for Sequence Labeling Tasks</article-title>
          .” Burr Settles,
          <source>Mark Craven Empirical Methods on Natural Language Processing (EMNLP) 2008</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [Set12]
          <article-title>”Active Learning</article-title>
          .”
          <source>Burr Settles. Number 18 in Synthesis Lectures on Artificial Intelligence and Machine Learning</source>
          . Morgan and Claypool Publishers, (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [Sin06]
          <article-title>”Active learning for adaptive mobile sensing networks”</article-title>
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nowak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramanathan</surname>
          </string-name>
          , P. in
          <source>International conference on Information processing in sensor networks</source>
          , pp.
          <fpage>60</fpage>
          -
          <lpage>68</lpage>
          ,
          <year>2006</year>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>