C. Stefano, C. D'Elia, A. Marcelli, A. S. D. Freca
{"title":"改进动态学习向量量化","authors":"C. Stefano, C. D'Elia, A. Marcelli, A. S. D. Freca","doi":"10.1109/ICPR.2006.699","DOIUrl":null,"url":null,"abstract":"We introduce some improvements to the dynamic learning vector quantization algorithm proposed by us for tackling the two major problems of those networks, namely neuron over-splitting and their distribution in the feature space. We suggest to explicitly estimate the potential improvement on the recognition rate achievable by splitting neurons in those regions of the feature space in which two or more classes overlap. We also suggest to compute the neuron splitting frequency, and to combine these information for selecting the most promising neuron to split. Experimental results on both synthetic and real data extracted from UCI Machine Learning Repository show substantial improvements of the proposed algorithm with respect to the state of the art","PeriodicalId":236033,"journal":{"name":"18th International Conference on Pattern Recognition (ICPR'06)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Improving Dynamic Learning Vector Quantization\",\"authors\":\"C. Stefano, C. D'Elia, A. Marcelli, A. S. D. Freca\",\"doi\":\"10.1109/ICPR.2006.699\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce some improvements to the dynamic learning vector quantization algorithm proposed by us for tackling the two major problems of those networks, namely neuron over-splitting and their distribution in the feature space. We suggest to explicitly estimate the potential improvement on the recognition rate achievable by splitting neurons in those regions of the feature space in which two or more classes overlap. We also suggest to compute the neuron splitting frequency, and to combine these information for selecting the most promising neuron to split. Experimental results on both synthetic and real data extracted from UCI Machine Learning Repository show substantial improvements of the proposed algorithm with respect to the state of the art\",\"PeriodicalId\":236033,\"journal\":{\"name\":\"18th International Conference on Pattern Recognition (ICPR'06)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th International Conference on Pattern Recognition (ICPR'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.2006.699\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Pattern Recognition (ICPR'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2006.699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We introduce some improvements to the dynamic learning vector quantization algorithm proposed by us for tackling the two major problems of those networks, namely neuron over-splitting and their distribution in the feature space. We suggest to explicitly estimate the potential improvement on the recognition rate achievable by splitting neurons in those regions of the feature space in which two or more classes overlap. We also suggest to compute the neuron splitting frequency, and to combine these information for selecting the most promising neuron to split. Experimental results on both synthetic and real data extracted from UCI Machine Learning Repository show substantial improvements of the proposed algorithm with respect to the state of the art