{"title":"支持向量机在手写数字分类中的应用","authors":"Urszula Markowska-Kaczmar, Pawel Kubacki","doi":"10.1109/ISDA.2005.87","DOIUrl":null,"url":null,"abstract":"In the paper our approach to classify handwritten digits by using support vector machines is described. Because of the unsatisfying, long time of training of SVM we propose to apply k-nearest neighbours algorithm with Manhattan distance to obtain reduced size of training set having a hope that this hybrid method does not make the significantly worse results of recognition. The aim of presented further experiments was to verify this assumption.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Support vector machines in handwritten digits classification\",\"authors\":\"Urszula Markowska-Kaczmar, Pawel Kubacki\",\"doi\":\"10.1109/ISDA.2005.87\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper our approach to classify handwritten digits by using support vector machines is described. Because of the unsatisfying, long time of training of SVM we propose to apply k-nearest neighbours algorithm with Manhattan distance to obtain reduced size of training set having a hope that this hybrid method does not make the significantly worse results of recognition. The aim of presented further experiments was to verify this assumption.\",\"PeriodicalId\":345842,\"journal\":{\"name\":\"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)\",\"volume\":\"285 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISDA.2005.87\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2005.87","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Support vector machines in handwritten digits classification
In the paper our approach to classify handwritten digits by using support vector machines is described. Because of the unsatisfying, long time of training of SVM we propose to apply k-nearest neighbours algorithm with Manhattan distance to obtain reduced size of training set having a hope that this hybrid method does not make the significantly worse results of recognition. The aim of presented further experiments was to verify this assumption.