Rule extraction from linear support vector machines Export

@inproceedings{Fung:2005, 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.}, address = {New York, NY, USA}, author = {Fung, Glenn and Sandilya, Sathyakama and Rao, Bharat R.}, booktitle = {KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining}, citeulike-article-id = {4811990}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1081870.1081878}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1081870.1081878}, doi = {10.1145/1081870.1081878}, isbn = {1-59593-135-X}, keywords = {phd, rule-extraction, svm}, location = {Chicago, Illinois, USA}, pages = {32--40}, posted-at = {2009-06-11 13:43:31}, priority = {3}, publisher = {ACM}, title = {Rule extraction from linear support vector machines}, url = {http://dx.doi.org/10.1145/1081870.1081878}, year = {2005} }

TY - CONF ID - Fung:2005 L3 - citeulike-article-id:4811990 N2 - 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. CY - Chicago, Illinois, USA SN - 1-59593-135-X AD - New York, NY, USA EP - 40 TI - Rule extraction from linear support vector machines PB - ACM T2 - KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining SP - 32 KW - phd KW - rule-extraction KW - svm AU - Fung, Glenn AU - Sandilya, Sathyakama AU - Rao, Bharat PY - 2005/// UR - http://dx.doi.org/10.1145/1081870.1081878 ER -