Rule Extraction from Support Vector Machines: A Sequential Covering Approach
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
In this paper, we propose a novel algorithm for rule extraction from support vector machines (SVMs), termed SQRex-SVM. The proposed method extracts rules directly from the support vectors (SVs) of a trained SVM using a modified sequential covering algorithm. Rules are generated based on an ordered search of the most discriminative features, as measured by interclass separation. Rule performance is then evaluated using measured rates of true and false positives and the area under the receiver operating characteristic (ROC) curve (AUC). Results are presented on a number of commonly used data sets that show the rules produced by SQRex-SVM exhibit both improved generalization performance and smaller more comprehensible rule sets compared to both other SVM rule extraction techniques and direct rule learning techniques.
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
The use of the area under the ROC curve in the evaluation of machine learning algorithms
Bradley, A. P. (1997) · Pattern Recognition · doi:10.1016/s0031-3203(96)00142-2 · Cited by 7,217 · cited 1×
“In particular, accuracy only measures performance at a single operating point and does not cater to skewed class priors or unequal misclassification costs [9], [10].”
BackgroundSelf-citationUsing AUC and accuracy in evaluating learning algorithms
Huang, J., & Ling, C. X. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.50 · Cited by 2,148 · cited 1×
“Furthermore , a number of studies have shown that the AUC is a more reliable single figure of merit than accuracy for evaluating and comparing the performance of different classifiers [9], [10], [11].”
BackgroundSurvey 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: 25
- provost, 1998, The Case against Accuracy Estimation for Comparing Induction Algorithms, Proc Int'l Conf Machine Learning, 445
- 10.1109/ICPR.2006.1021 · DOI
- 10.1007/s10994-005-4257-7 · DOI
- 10.1007/s10994-005-5256-4 · DOI
- 10.1007/s10994-006-8199-5 · DOI · Paper page
- 10.1109/ICPR.2006.941 · DOI
- sokolova, 2006, Beyond Accuracy, F-Score and ROC: A Family of Discriminant Measures for Performance Evaluation, Proc Nat'l Conf Artificial Intelligence (AAAI '06) Workshop Evaluation Methods for Machine Learning
- 10.1109/JPROC.2004.826605 · DOI · Paper page
- 10.1109/JPROC.2004.826605 · DOI · Paper page
- zhang, 2005, Rule Extraction from Trained Support Vector Machines, Proc Ninth Pacific-Asia Conf Advances in Knowledge Discovery and Data Mining, 61, 10.1007/11430919_9 · DOI
- witten, 2005, Data Mining Practical Machine Learning Tools and Techniques
- merz, 1992, UCI Machine Learning Repository
- n��ez, 2002, Rule-Extraction from Support Vector Machines, Proc European Symp Artificial Neural Networks, 107
- zhang, 2004, DRC-BK Mining Classification Rules with Help of SVM, 3056, 191
- fu, 2004, Extracting the Knowledge Embedded in Support Vector Machines, Proc IEEE Int'l Conf Neural Networks, 291
- barakat, 2005, Eclectic Rule-Extraction from Support Vector Machines, Computational Intelligence An Int l J, 2, 59
- barakat, 2004, Learning-Based Rule-Extraction from Support Vector Machines: Performance on Benchmark Data Sets, Proc Conf Neuro-Computing and Evolving Intelligence
- 10.1145/1081870.1081878 · DOI · Paper page
- mitchell, 1997, Machine Learning
- 10.1023/A:1009715923555 · DOI · Paper page
- 10.1007/s10994-005-5011-x · DOI · Paper page
- 2004, Rule Quest Data Mining Tools
- 10.1109/ICPR.2004.1333794 · DOI
- 10.1023/A:1007329424533 · DOI
- 10.1109/ICDM.2001.989510 · 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
“This is the approach of [93] , which proposes a method that extracts rules directly from the support vectors of a trained SVM us-ing a modified sequential covering algorithm.”
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
“This is the approach of [93] , which proposes a method that extracts rules directly from the support vectors of a trained SVM us-ing a modified sequential covering algorithm.”
Explaining prediction models and individual predictions with feature contributions
Štrumbelj, E., & Kononenko, I. (2014) · Knowledge and Information Systems · doi:10.1007/s10115-013-0679-x · Cited by 2,286
“Complex models, such as artificial neural networks [14, 15, 16, 17, 18] and SVM (Support Vector Machines) [19, 20, 10, 21, 22, 23, 24, 25] received most attention, because they are often very successful but non-transparent.”
Human-in-the-loop machine learning: a state of the art
Mosqueira-Rey, E., Hernández-Pereira, E., Alonso-Ríos, D., Bobes-Bascarán, J., & Fernández-Leal, Á. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10246-w · Cited by 1,025
A Survey on the Explainability of Supervised Machine Learning
Burkart, N., & Huber, M. F. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12228 · Cited by 1,008
Metadata
- Authors
- Barakat, N. H., & Bradley, A. P.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2007-06
- Volume
- 19
- Issue
- 6
- Pages
- 729-741
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2154142492
- Cited by
- 114
- References
- 3
- FWCI
- 7.88
- Type
- journal article
- 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
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.