{"title":"半监督支持向量机的模型选择","authors":"Ying Zhao, Jianpei Zhang, Jing Yang","doi":"10.1109/ICICSE.2008.29","DOIUrl":null,"url":null,"abstract":"Model selection for semi-supervised support vector machine is an important step in a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the bounds of the leave-one-out such as radius-margin bound and on the performance measures such as generalized approximate cross-validation empirical error, etc. In order to get the parameter of SVM with RBF kernel, this paper presents a linear grid search method, which combines grid search and linear search. This method can reduce the resources required both in terms of processing time and of storage space. Experiments both on artificial and real word datasets show that the proposed linear grid search has the advantage of good performance compared to using linear search alone.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Model Selection for Semi-Supervised Support Vector Machines\",\"authors\":\"Ying Zhao, Jianpei Zhang, Jing Yang\",\"doi\":\"10.1109/ICICSE.2008.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Model selection for semi-supervised support vector machine is an important step in a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the bounds of the leave-one-out such as radius-margin bound and on the performance measures such as generalized approximate cross-validation empirical error, etc. In order to get the parameter of SVM with RBF kernel, this paper presents a linear grid search method, which combines grid search and linear search. This method can reduce the resources required both in terms of processing time and of storage space. Experiments both on artificial and real word datasets show that the proposed linear grid search has the advantage of good performance compared to using linear search alone.\",\"PeriodicalId\":333889,\"journal\":{\"name\":\"2008 International Conference on Internet Computing in Science and Engineering\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-01-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Internet Computing in Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICSE.2008.29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Internet Computing in Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSE.2008.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Model Selection for Semi-Supervised Support Vector Machines
Model selection for semi-supervised support vector machine is an important step in a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the bounds of the leave-one-out such as radius-margin bound and on the performance measures such as generalized approximate cross-validation empirical error, etc. In order to get the parameter of SVM with RBF kernel, this paper presents a linear grid search method, which combines grid search and linear search. This method can reduce the resources required both in terms of processing time and of storage space. Experiments both on artificial and real word datasets show that the proposed linear grid search has the advantage of good performance compared to using linear search alone.