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.

      Batch-Incremental Learning for Mining Data Streams

      Holmes, Geoffrey; Kirkby, Richard Brendon; Bainbridge, David
      Thumbnail
      Files
      Batch-Incremental Learning for Mining Data Streams.pdf
      183.7Kb
      Citation
      Export citation
      Holmes, G., Kirkby, R. & Bainbridge, D.(2004). Batch-Incremental Learning for Mining Data Streams. Working papers, University of Waikato, Department of Computer science 2004, Hamilton, New Zealand: University of Waikato.
      Permanent Research Commons link: https://hdl.handle.net/10289/1749
      Abstract
      The data stream model for data mining places harsh restrictions on a learning algorithm. First, a model must be induced incrementally. Second, processing time for instances must keep up with their speed of arrival. Third, a model may only use a constant amount of memory, and must be ready for prediction at any point in time. We attempt to overcome these restrictions by presenting a data stream classification algorithm where the data is split into a stream of disjoint batches. Single batches of data can be processed one after the other by any standard non-incremental learning algorithm. Our approach uses ensembles of decision trees. These tree ensembles are iteratively merged into a single interpretable model of constant maximal size. Using benchmark datasets the algorithm is evaluated for accuracy against state-of-the-art algorithms that make use of the entire dataset.
      Date
      2004
      Type
      Working Paper
      Report No.
      Department of Computer Science Working Papers
      Publisher
      University of Waikato
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

      Downloads, last 12 months
      42
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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