Rule extraction from linear support vector machines
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping 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 SVM's and other "black-box" classifiers into a set of human-understandable rules, is critical not only for physician acceptance, but also to reducing the regulatory barrier for medical-decision support systems based on such classifiers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Survey and critique of techniques for extracting rules from trained artificial neural networks
Andrews, R., Diederich, J., & Tickle, A. B. (1995) · Knowledge-Based Systems · doi:10.1016/0950-7051(96)81920-4 · Cited by 1,225
Research works printed but not linked: 19
- D. P. Bertsekas . Nonlinear Programming . Athena Scientific , Belmont, MA , 1995 . D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, MA, 1995.
- 10.1137/0320018 · DOI · Paper page
- F. Beyer , L. Zierott , J. Stoeckel , W. Heindel , and D. Wormanns . Computer-assisted detection (cad) of pulmonary nodules at mdct: Can cad be used as concurrent reader ? In Proceeding of the 11th European Congress of Radiology , Viena, Austria , March 2005 . To appear. F. Beyer, L. Zierott, J. Stoeckel, W. Heindel, and D. Wormanns. Computer-assisted detection (cad) of pulmonary nodules at mdct: Can cad be used as concurrent reader? In Proceeding of the 11th European Congress of Radiology, Viena, Austria, March 2005. To appear.
- E.H. Shortliffe B.G. Buchanan . Rule-Based Expert Systems: the MYCIN experiments of the Stanford Heuristic Programming Project . Addison-Wesley , Reading, MA , 1984 . E.H. Shortliffe B.G. Buchanan. Rule-Based Expert Systems: the MYCIN experiments of the Stanford Heuristic Programming Project. Addison-Wesley, Reading, MA, 1984.
- P. S. Bradley and O. L. Mangasarian . Feature selection via concave minimization and support vector machines. In J. Shavlik, editor , Machine Learning Proceedings of the Fifteenth International Conference(ICML '98) , pages 82 -- 90 , San Francisco, California , 1998 . Morgan Kaufmann. ftp://ftp.cs.wisc.edu/math-prog/tech-reports/9803.ps. P. S. Bradley and O. L. Mangasarian. Feature selection via concave minimization and support vector machines. In J. Shavlik, editor, Machine Learning Proceedings of the Fifteenth International Conference(ICML '98), pages 82--90, San Francisco, California, 1998. Morgan Kaufmann. ftp://ftp.cs.wisc.edu/math-prog/tech-reports/9803.ps.
- V. Cherkassky and F. Mulier . Learning from Data - Concepts, Theory and Methods . John Wiley & Sons , New York , 1998 . V. Cherkassky and F. Mulier. Learning from Data - Concepts, Theory and Methods. John Wiley & Sons, New York, 1998.
- 10.1145/502512.502527 · DOI · Paper page
- 10.1145/948542.948551 · DOI · Paper page
- 10.1023/A:1008344602888 · DOI
- O. L. Mangasarian . Generalized support vector machines . In A. Smola, P. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers , pages 135 -- 146 , Cambridge, MA , 2000 . MIT Press . ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98-14.ps. O. L. Mangasarian. Generalized support vector machines. In A. Smola, P. Bartlett, B. Schölkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 135--146, Cambridge, MA, 2000. MIT Press. ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98-14.ps. · DOI · Paper page
- 10.1287/opre.43.4.570 · DOI · Paper page
- S. Mika , G. Rätsch , J. Weston , B. Schölkopf , and K.-R. Müller . Fisher discriminant analysis with kernels . In Y.-H. Hu , J. Larsen, E. Wilson, and S. Douglas, editors, Neural Networks for Signal Processing IX, pages 41 -- 48 . IEEE , 1999 . S. Mika, G. Rätsch, J. Weston, B. Schölkopf, and K.-R. Müller. Fisher discriminant analysis with kernels. In Y.-H. Hu, J. Larsen, E. Wilson, and S. Douglas, editors, Neural Networks for Signal Processing IX, pages 41--48. IEEE, 1999.
- Haydemar Nunez , Cecilio Angulo , and Andreu Catal . Rule extraction from support vector machines . In ESANN'2002 proceedings - European Symposium on Artificial Neural Networks , pages 107 - 112 . d-side, 2002 . Haydemar Nunez, Cecilio Angulo, and Andreu Catal. Rule extraction from support vector machines. In ESANN'2002 proceedings - European Symposium on Artificial Neural Networks, pages 107-112. d-side, 2002.
- 10.1109/C-M.1976.218587 · doi:10.1109/c-m.1976.218587
- 10.1126/science.130.3366.9 · DOI · Paper page
- 10.1016/S0720-048X(99)00067-4 · doi:10.1016/s0720-048x(99)00067-4
- 10.1023/A:1022683529158 · DOI · Paper page
- 10.1023/A:1018628609742 · DOI · Paper page
- V. N. Vapnik . The Nature of Statistical Learning Theory . Springer , New York , second edition, 2000 . V. N. Vapnik. The Nature of Statistical Learning Theory. Springer, New York, second edition, 2000. · DOI · Paper page
Cited by
Arrieta, A. B., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., García, S., Gil-López, S., Molina, D., Benjamins, R., et al. (2019) · arXiv · doi:10.48550/arxiv.1910.10045 · Cited by 11,321
Barredo Arrieta, A., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., Garcia, S., Gil-Lopez, S., Molina, D., Benjamins, R., et al. (2020) · Information Fusion · doi:10.1016/j.inffus.2019.12.012 · Cited by 10,423
“In [105] , the authors formulate the rule extraction problem as a multi-constrained optimization to create a set of non-overlapping rules.”
Comprehensible classification models: a position paper
Freitas, A. A. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2594473.2594475 · Cited by 572
Comprehensible credit scoring models using rule extraction from support vector machines
Martens, D., Baesens, B., Van Gestel, T., & Vanthienen, J. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.04.051 · Cited by 448
“extract non-overlapping rules by constructing hypercubes with axis-parallel surfaces [11].”
A Survey of Methods for Explaining Black Box Models
Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., & Pedreschi, D. (2019) · ACM Computing Surveys · doi:10.1145/3236009 · Cited by 629
“, in Reference [33], describe as function f an algorithm based on constraint programming for converting linear SVM b (and other hyperplane-based linear classifiers) into a set of non”
Method
Metadata
- Authors
- Fung, G., Sandilya, S., & Rao, R. B.
- Venue
- Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
- Publisher
- ACM
- Published
- 2005-08-21
- Pages
- 32-40
- OpenAlex
- W2104046064
- Cited by
- 154
- References
- 1
- FWCI
- 6.20
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Rule extraction from linear support vector machines. https://app.cochat.ai/papers/10.1145/1081870.1081878
- The paper
- Fung, G., Sandilya, S., & Rao, R. B. (2005). Rule extraction from linear support vector machines. Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. https://doi.org/10.1145/1081870.1081878
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.