Mining Decision Rules from Deterministic Finite Automata

François Jacquenet, Marc Sebban, Georges Valétudie

Abstract

This work presents a novel approach for knowledge discovery from sequential data. Instead of mining the examples in their sequential form, we suppose they have been processed by a machine learning algorithm that has generalized them into a deterministic finite automaton (DFA). Thus, we present a theoretical framework to extract decision rules from this DFA. Our method relies on statistical inference theory and contrary to usual support-based frequent pattern mining techniques. It does not depend on such a global threshold, but rather allows us to determine an adaptive relevance threshold. Various experiments show the advantage of mining DFA instead of mining sequences.
BibTeX
@inproceedings{jacquenet2004mining,
  author = {François Jacquenet and Marc Sebban and Georges Valétudie},
  title = {{Mining Decision Rules from Deterministic Finite Automata}},
  booktitle = {ICTAI},
  year = {2004},
  doi = {10.1109/ictai.2004.86},
}

Loading related content...

Figure