{"title":"Speeding up SVM decision based on mirror points","authors":"Jiun-Hung Chen, Chu-Song Chen","doi":"10.1109/ICPR.2002.1048440","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of mirror pairs, are combined to approximate a single SVM. A dynamic programming-based method is used to find a suitable combination. Experimental results show that this method can increase classification efficiencies of SVM with comparable classification performances.","PeriodicalId":159502,"journal":{"name":"Object recognition supported by user interaction for service robots","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Object recognition supported by user interaction for service robots","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2002.1048440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of mirror pairs, are combined to approximate a single SVM. A dynamic programming-based method is used to find a suitable combination. Experimental results show that this method can increase classification efficiencies of SVM with comparable classification performances.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
