Minerva: Sequential covering for rule extraction
Huysmans, Johan, Setiono, Rudy, Baesens, Bart and Vanthienen, Jan (2008) Minerva: Sequential covering for rule extraction. IEEE Transactions on Systems, Man and Cybernetics, Part B: Cybernetics, 38, (2), 299-309. (doi:10.1109/TSMCB.2007.912079 ).
Full text not available from this repository.
Various benchmarking studies have shown that artificial neural networks and support vector machines often have superior performance when compared to more traditional machine learning techniques. The main resistance against these newer techniques is based on their lack of interpretability: it is difficult for the human analyst to understand the reasoning behind these models' decisions. Various rule extraction (RE) techniques have been proposed to overcome this opacity restriction. These techniques are able to represent the behavior of the complex model with a set of easily understandable rules. However, most of the existing RE techniques can only be applied under limited circumstances, e.g., they assume that all inputs are categorical or can only be applied if the black-box model is a neural network. In this paper, we present Minerva, which is a new algorithm for RE. The main advantage of Minerva is its ability to extract a set of rules from any type of black-box model. Experiments show that the extracted models perform well in comparison with various other rule and decision tree learners.
|Keywords:||classification, rule extraction, support vector machines|
|Subjects:||A General Works > AI Indexes (General)|
|Divisions:||University Structure - Pre August 2011 > School of Management
|Date Deposited:||24 Mar 2010|
|Last Modified:||01 Jun 2011 12:42|
|Contributors:||Huysmans, Johan (Author)
Setiono, Rudy (Author)
Baesens, Bart (Author)
Vanthienen, Jan (Author)
|Date:||7 March 2008|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)