Approximate and Exact Enumeration of Rule Models


  • Satoshi Hara Osaka University
  • Masakazu Ishihata Hokkaido University


In machine learning, rule models are one of the most popular choices when model interpretability is the primary concern. Ordinary, a single model is obtained by solving an optimization problem, and the resulting model is interpreted as the one that best explains the data. In this study, instead of finding a single rule model, we propose algorithms for enumerating multiple rule models. Model enumeration is useful in practice when (i) users want to choose a model that is particularly suited to their task knowledge, or (ii) users want to obtain several possible mechanisms that could be underlying the data to use as hypotheses for further scientific studies. To this end, we propose two enumeration algorithms: an approximate algorithm and an exact algorithm. We prove that these algorithms can enumerate models in a descending order of their objective function values approximately and exactly. We then confirm our theoretical results through experiments on real-world data. We also show that, by using the proposed enumeration algorithms, we can find several different models of almost equal quality.




How to Cite

Hara, S., & Ishihata, M. (2018). Approximate and Exact Enumeration of Rule Models. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from