• DocumentCode
    3128115
  • Title

    FAARM: Frequent Association Action Rules Mining Using FP-Tree

  • Author

    Difallah, Djellel Eddine ; Benton, Ryan G. ; Raghavan, Vijay ; Johnsten, Tom

  • Author_Institution
    eXascale Infolab, Univ. of Fribourg, Fribourg, Switzerland
  • fYear
    2011
  • fDate
    11-11 Dec. 2011
  • Firstpage
    398
  • Lastpage
    404
  • Abstract
    Action rules mining aims to provide recommendations to analysts seeking to achieve a specific change. An action rule is constructed as a series of changes, or actions, which can be made to some of the flexible characteristics of the information system that ultimately triggers a change in the targeted attribute. The existing action rules discovery methods consider the input decision system as their search domain and are limited to expensive and ambiguous strategies. In this paper, we define and propose the notion of action table as the ideal search domain for actions, and then propose a strategy based on the FP-Tree structure to achieve high performance in rules extraction.
  • Keywords
    data mining; information retrieval; information systems; recommender systems; tree data structures; FP-tree structure; frequent association action rules mining; information system; recommendations; rules extraction; search domain; Association rules; Atomic clocks; Atomic measurements; Classification algorithms; Information systems; Machine learning algorithms; FP-Tree; action rules; action table; association mining; recommendation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining Workshops (ICDMW), 2011 IEEE 11th International Conference on
  • Conference_Location
    Vancouver, BC
  • Print_ISBN
    978-1-4673-0005-6
  • Type

    conf

  • DOI
    10.1109/ICDMW.2011.82
  • Filename
    6137407