zbMATH — the first resource for mathematics

Rule extraction from linear support vector machines via mathematical programming. (English) Zbl 1148.68433
Diederich, Joachim (ed.), Rule extraction from support vector machines. Berlin: Springer (ISBN 978-3-540-75389-6/hbk). Studies in Computational Intelligence 80, 83-107 (2008).
Summary: We describe an algorithm for converting linear support vector machines SVM and any other arbitrary hyperplane-based linear classifiers into a set of nonoverlapping rules that, unlike the original classifier, can be easily interpreted by humans.
Each iteration of the rule extraction algorithm is formulated as a constrained optimization problem that is computationally inexpensive to solve. We discuss various properties of the algorithm and provide proof of convergence for two different optimization criteria. We demonstrate the performance and the speed of the algorithm on linear classifiers learned from real-world datasets, including a medical dataset on detection of lung cancer from medical images.
The ability to convert SVMs and other “black-box” classifiers into a set of human-understandable rules, is critical not only for physician acceptance, but also for reducing the regulatory barrier for medical-decision support systems based on such classifiers.
We also present some variations and extensions of the proposed mathematical programming formulations for rule extraction.
For the entire collection see [Zbl 1138.68003].

68T05 Learning and adaptive systems in artificial intelligence
90C90 Applications of mathematical programming
PDF BibTeX Cite
Full Text: DOI