@inproceedings{b38ae7b504754cbdba384de943f8d4aa,
title = "Simplifying SVM with weighted LVQ algorithm",
abstract = "Reduced Set SVMs (RS-SVM) are a group of methods that simplify the internal structure of SVM models, while keeping the SVMs' decision boundaries as similar as possible to the original ones. RS-SVMs are very useful in reducing computational complexity of the original models. They accelerate the decision process by reducing the number of support vectors. They are especially important for large datasets, when lots of support vectors are selected. They also can be very useful for understanding the internal structure of SVM models by the use of prototype-based rules. This paper presents a new method based on the modified version of the LVQ algorithm called WLVQ, which combines both of the objectives: computational complexity reduction and generation of prototype-based rules.",
keywords = "LVQ, Prototype-based rules, Reduced set methods, SVM",
author = "Marcin Blachnik and Miros{\l}aw Kordos",
year = "2011",
doi = "10.1007/978-3-642-23878-9\_26",
language = "English",
isbn = "9783642238772",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "212--219",
booktitle = "Intelligent Data Engineering and Automated Learning, IDEAL 2011 - 12th International Conference, Proceedings",
note = "12th International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2011 ; Conference date: 07-09-2011 Through 09-09-2011",
}