Rule Extraction from Trained Support Vector Machines
By Y. Zhang, H. Su, Tao Jia, Jian Chu. 2005
60 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Erik Strumbelj
- Igor Kononenko
- Nahla H. Barakat
- Andrew P. Bradley
- Su-In Lee
- Scott M. Lundberg
- Przemyslaw Biecek
- Ian Covert
In Computational Theory and Mathematics
- Andrew P. Bradley
- Nahla H. Barakat
- Igor Kononenko
- Huan Liu
- Zheng Zhao
- Nadia Burkart
- Marco F. Huber
- Dolores Romero Morales
Citations in the corpus
- Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AI (2019, neutral): “Similarly in [106] , the authors proposed the so-called Hyper-rectangle Rule Extraction, an algorithm based on SVC (Support Vector Clustering) to find prototype vectors for each class and then define small hyper-rectangles around.”
- Rule Extraction from Support Vector Machines: A Sequential Covering Approach (2007, methodology): “Therefore, several methods have been introduced for rule extraction from both ANNs [2] and, more recently, SVMs [1], [3], [4], [5], [6], [7], [8], which will be summarized in Section 4.”
- Rule extraction from support vector machines: A review (2010, methodology): “In (SVM+) [25–28] and ‘HRE’ [29], the authors used clustering algorithms to define prototype vectors which are then utilized with SVs to construct the region, while in ‘RulExSVM’ [30], the algorithm utilizes the SVM decision hyper-curve and the support vectors to construct hyper-rectangles.”
- Explaining prediction models and individual predictions with feature contributions (2014, background): “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.”