{"title":"BS-SVM多分类模型在消费品中的应用","authors":"Quanhui Jia, Lieli Liu","doi":"10.1109/ICSESS.2011.5982240","DOIUrl":null,"url":null,"abstract":"Quality and safety of consumer products have drawn wide attention from scholars in related domain, this issue is based on the subject of the quality and safety of consumer goods, in accordance with characteristics of cases, and put forward a hierarchical support vector machine classification algorithm based on the relative separability of the feature space, to solve the low classification performance and high rate of misclassification of the existing algorithms. The weight of Binary Search Tree is the separability of samples, determining the order of categories by a selective set of training samples to construct SVM classifier and the final formation of a binary classification of the larger interval multi-valued SVM classifier tree. Simulation results show that the method has a faster test speed, relatively perfect good classification accuracy and generalization performance.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"BS-SVM multi-classification model in the application of consumer goods\",\"authors\":\"Quanhui Jia, Lieli Liu\",\"doi\":\"10.1109/ICSESS.2011.5982240\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quality and safety of consumer products have drawn wide attention from scholars in related domain, this issue is based on the subject of the quality and safety of consumer goods, in accordance with characteristics of cases, and put forward a hierarchical support vector machine classification algorithm based on the relative separability of the feature space, to solve the low classification performance and high rate of misclassification of the existing algorithms. The weight of Binary Search Tree is the separability of samples, determining the order of categories by a selective set of training samples to construct SVM classifier and the final formation of a binary classification of the larger interval multi-valued SVM classifier tree. Simulation results show that the method has a faster test speed, relatively perfect good classification accuracy and generalization performance.\",\"PeriodicalId\":108533,\"journal\":{\"name\":\"2011 IEEE 2nd International Conference on Software Engineering and Service Science\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 2nd International Conference on Software Engineering and Service Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2011.5982240\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2011.5982240","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
BS-SVM multi-classification model in the application of consumer goods
Quality and safety of consumer products have drawn wide attention from scholars in related domain, this issue is based on the subject of the quality and safety of consumer goods, in accordance with characteristics of cases, and put forward a hierarchical support vector machine classification algorithm based on the relative separability of the feature space, to solve the low classification performance and high rate of misclassification of the existing algorithms. The weight of Binary Search Tree is the separability of samples, determining the order of categories by a selective set of training samples to construct SVM classifier and the final formation of a binary classification of the larger interval multi-valued SVM classifier tree. Simulation results show that the method has a faster test speed, relatively perfect good classification accuracy and generalization performance.