Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Clustering based active learning for evolving data streams

      Ienco, Dino; Bifet, Albert; Žliobaitė, Indrė; Pfahringer, Bernhard
      Thumbnail
      Files
      4212b50736fc3a8ba468d6034590886fbbc9.pdf
      Accepted version, 371.4Kb
      DOI
       10.1007/978-3-642-40897-7_6
      Find in your library  
      Citation
      Export citation
      Ienco, D., Bifet, A., Žliobaitė, I., & Pfahringer, B. (2013). Clustering Based Active Learning for Evolving Data Streams. (pp. 79-93). In J. Fürnkranz, E. H¨ullermeier, and T. Higuchi (Eds.): DS 2013, LNAI 8140(pp. 79–93). Springer-Verlag Berlin Heidelberg.
      Permanent Research Commons link: https://hdl.handle.net/10289/8516
      Abstract
      Data labeling is an expensive and time-consuming task. Choosing which labels to use is increasingly becoming important. In the active learning setting, a classifier is trained by asking for labels for only a small fraction of all instances. While many works exist that deal with this issue in non-streaming scenarios, few works exist in the data stream setting. In this paper we propose a new active learning approach for evolving data streams based on a pre-clustering step, for selecting the most informative instances for labeling. We consider a batch incremental setting: when a new batch arrives, first we cluster the examples, and then, we select the best instances to train the learner. The clustering approach allows to cover the whole data space avoiding to oversample examples from only few areas. We compare our method w.r.t. state of the art active learning strategies over real datasets. The results highlight the improvement in performance of our proposal. Experiments on parameter sensitivity are also reported.
      Date
      2013
      Type
      Conference Contribution
      Publisher
      Springer
      Rights
      © 2013 Springer-Verlag Berlin Heidelberg. This is the author's accepted version. The final publication is available at Springer via dx.doi.org/10.1007/978-3-642-40897-7_6
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

      Downloads, last 12 months
      103
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement