\documentclass[jidm,a4paper,table]{jidm}

\usepackage[T1]{fontenc}

\usepackage{ae}
\usepackage{subfig}
\usepackage[pdftex]{graphicx}
\usepackage{epsfig}
\usepackage{epstopdf}
\let\proof\relax 
\let\endproof\relax
\usepackage{amssymb,amsmath,color,amsthm}

\usepackage[usenames,dvipsnames]{xcolor}
\usepackage{multirow}
\usepackage{hhline}% http://ctan.org/pkg/hhline
\usepackage{rotating}
\usepackage{acronym}
\usepackage{algorithm}
\usepackage{algorithmicx}
\usepackage[noend]{algpseudocode}
\usepackage{bm}
%\usepackage[table]{xcolor}% http://ctan.org/pkg/xcolor


\usepackage[T1]{fontenc}
\usepackage{wrapfig}
\usepackage{graphicx}

\jidmVolume{4}
\jidmNumber{4}
\jidmYear{13} 
\jidmMonth{October}
\setcounter{page}{1}

\markboth{I. Hata, A. Veloso and N. Ziviani}
{Learning Accurate and Interpretable Classifiers Using Optimal Multi-Criteria Rules}
\title{Learning Accurate and Interpretable Classifiers\\ Using Optimal Multi-Criteria Rules}

\author{Itamar Hata, Adriano Veloso, Nivio Ziviani}

\institute{Universidade Federal de Minas Gerais, Brazil \\ \email{\{itamar, adrianov, nivio\}@dcc.ufmg.br}
}

\begin{abstract}
The Occam's Razor principle has become the basis for many Machine Learning algorithms, under the interpretation that the classifier 
should not be more complex than necessary. Recently, this principle has shown to be well suited to associative classifiers, where the 
number of rules composing the classifier can be substantially reduced by using condensed representations such as maximal or closed rules. 
While it is shown that such a decrease in the complexity of the classifier (usually) does not compromise its accuracy, the number of remaining rules 
is still larger than necessary and making it hard for experts to interpret the corresponding classifier. In this paper we propose a much more 
aggressive filtering strategy, which decreases the number of rules within the classifier 
dramatically without hurting its accuracy.
Our strategy consists in evaluating each rule under different statistical criteria, and filtering only those rules that show a positive
balance between all the criteria considered. Specifically, each candidate rule is associated with a point in an $n$-dimensional scattergram, where
each coordinate corresponds to a statistical criterion. Points that are not dominated by any other point in the scattergram compose 
the {\em Pareto frontier}, and correspond to rules that are optimal in the sense that there is no rule that is better off when all
the criteria are taken into account. Finally, rules lying in the Pareto frontier are filtered and compose the classifier. Our {Pareto-Optimal} filtering strategy may receive as input either the entire set of rules or even a condensed representation (i.e., closed rules).
A systematic set of experiments involving benchmark data as well as recent data from actual application scenarios,
followed by an extensive set of significance tests, reveal that the proposed strategy
decreases the number of rules by up to two orders of magnitude and
produces classifiers that are extremely readable (i.e., allow interpretability of the classification results) without hurting accuracy.
\end{abstract}

\category{I.2.6}{Artificial Intelligence}{Learning} 
\category{H.28}{Database Applications}{Data mining} 
\category{I.7}{Document and Text Processing}{General}

\keywords{Association rules, Classification, Pareto frontier}

\begin{document}

\begin{bottomstuff}
This work was partially supported by the National Institute of Science and Technology for the Web (InWeb),
 MCT/CNPq grant 57.3871/2008-6, and by the authors' individual grants and scholarships from Fapemig and CNPq.
\end{bottomstuff}

\maketitle

\input{introduction}
\input{background}
\input{referencial}
\input{model}
\input{results}
\input{conclusion}
	
\bibliographystyle{jidm}
\bibliography{paper,adriano}

\begin{received}
\end{received}

\end{document}
