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.

      Cache Hierarchy Inspired Compression: a Novel Architecture for Data Streams

      Holmes, Geoffrey; Pfahringer, Bernhard; Kirkby, Richard Brendon
      Thumbnail
      Files
      cache hierarchy inspired compression.pdf
      222.9Kb
      Link
       www.fcsit.unimas.my
      Find in your library  
      Citation
      Export citation
      Holmes, G., Pfahringer, B., Kirkby, R. (2006). Cache Hierarchy Inspired Compression: a Novel Architecture for Data Streams, Journal of Information Technology in Asia, 2.
      Permanent Research Commons link: https://hdl.handle.net/10289/1457
      Abstract
      We present an architecture for data streams based on structures typically found in web cache hierarchies. The main idea is to build a meta level analyser from a number of levels constructed over time from a data stream. We present the general architecture for such a system and an application to classification. This architecture is an instance of the general wrapper idea allowing us to reuse standard batch learning algorithms in an inherently incremental learning environment. By artificially generating data sources we demonstrate that a hierarchy containing a mixture of models is able to adapt over time to the source of the data. In these experiments the hierarchies use an elementary performance based replacement policy and unweighted voting for making classification decisions.
      Date
      2006
      Type
      Journal Article
      Rights
      This article has been published in the journal: Journal of Information Technology in Asia. Used with permission.
      Collections
      • Computing and Mathematical Sciences Papers [1452]
      Show full item record  

      Usage

      Downloads, last 12 months
      118
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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