{"title":"Design Methodology of Queue-Based Fast Classification for Sequential Minimal Optimization in SVM ML-Training","authors":"Xin-Yu Shih, Hsiang-En Wu","doi":"10.1109/ICCE-Taiwan55306.2022.9869234","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a design methodology of queue-based fast classification for sequential minimal optimization (SMO) in support vector machine (SVM) training. The queue is designed to tremendously reduce the searching space of weightings. Our method is useful to simplify operating steps of SMO and almost achieve the same performance in terms of classification accuracy with respect to full-search approach. In the Matlab simulation, our method is completely verified with 6 representative data sets. As compared to full-search and heuristic approaches, the running speed of our method is increased by 7.53 and 2.91 times, respectively. It features high efficiency without sacrificing classification accuracy.","PeriodicalId":164671,"journal":{"name":"2022 IEEE International Conference on Consumer Electronics - Taiwan","volume":"232 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Consumer Electronics - Taiwan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCE-Taiwan55306.2022.9869234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose a design methodology of queue-based fast classification for sequential minimal optimization (SMO) in support vector machine (SVM) training. The queue is designed to tremendously reduce the searching space of weightings. Our method is useful to simplify operating steps of SMO and almost achieve the same performance in terms of classification accuracy with respect to full-search approach. In the Matlab simulation, our method is completely verified with 6 representative data sets. As compared to full-search and heuristic approaches, the running speed of our method is increased by 7.53 and 2.91 times, respectively. It features high efficiency without sacrificing classification accuracy.