skip to main content
10.1145/2480362.2480518acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
poster

Random rules from data streams

Published:18 March 2013Publication History

ABSTRACT

Existing works suggest that random inputs and random features produce good results in classification. In this paper we study the problem of generating random rule sets from data streams. One of the most interpretable and flexible models for data stream mining prediction tasks is the Very Fast Decision Rules learner (VFDR). In this work we extend the VFDR algorithm using random rules from data streams. The proposed algorithm generates several sets of rules. Each rule set is associated with a set of Natt attributes. The proposed algorithm maintains all properties required when learning from stationary data streams: online and any-time classification, processing each example once.

References

  1. L. Breiman. Random forests. Machine Learnin, 45(1):5--32, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Cendrowska. Prism: an algorithm for inducing modular rules. International Journal of Man-Machine Studies, pages 27(4): pp. 349--370, 1987.Google ScholarGoogle ScholarCross RefCross Ref
  3. J. Gama and P. Kosina. Learning decision rules from data streams. In IJCAI, pages 1255--1260. AAAI, Menlo Park, USA, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. A. Bramer. An information-theoretic approach to the pre-pruning of classification rules. In Intelligent Information Processing, pages pp. 201--212, Kluwer, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F. Stahl and M. Bramer. Random prism: An alternative to random forests. In ICITAAI, pages pp. 5--18. Cambridge, UK, 2011.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Random rules from data streams

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing
      March 2013
      2124 pages
      ISBN:9781450316569
      DOI:10.1145/2480362

      Copyright © 2013 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 18 March 2013

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      SAC '13 Paper Acceptance Rate255of1,063submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader