Determination of the optimal batch size in incremental approaches: an application to tornado detection

H. Son, T. Trafalis, M. B. Richman
{"title":"Determination of the optimal batch size in incremental approaches: an application to tornado detection","authors":"H. Son, T. Trafalis, M. B. Richman","doi":"10.1109/IJCNN.2005.1556352","DOIUrl":null,"url":null,"abstract":"Computing time and memory space limitations in applying support vector machines (SVMs) for large scale problems are recognized as critical limiting factors. Incremental approaches have serve as a remedy for large scale problems. However, determination of the appropriate batch size for incremental approaches has been explored rarely. In this study, the optimal batch size is defined as tradeoff between computing time and generalization error rate. Experiments for the determination of the optimal batch size, based on the mixture ratio of tornado and non-tornado data and a comparison between fixed batch size and knowledge based batch size, are performed. Preliminary results suggest that the knowledge based batch learning has the lowest generalization error rate.","PeriodicalId":365690,"journal":{"name":"Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.2005.1556352","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Computing time and memory space limitations in applying support vector machines (SVMs) for large scale problems are recognized as critical limiting factors. Incremental approaches have serve as a remedy for large scale problems. However, determination of the appropriate batch size for incremental approaches has been explored rarely. In this study, the optimal batch size is defined as tradeoff between computing time and generalization error rate. Experiments for the determination of the optimal batch size, based on the mixture ratio of tornado and non-tornado data and a comparison between fixed batch size and knowledge based batch size, are performed. Preliminary results suggest that the knowledge based batch learning has the lowest generalization error rate.
增量方法中最优批大小的确定:龙卷风探测中的应用
支持向量机(svm)在大规模问题中的计算时间和内存空间限制被认为是关键的限制因素。增量方法是解决大规模问题的一种方法。然而,对增量方法的适当批大小的确定很少进行探讨。在本研究中,最优批大小被定义为计算时间和泛化错误率之间的权衡。基于龙卷风和非龙卷风数据的混合比例,以及固定批大小和基于知识的批大小的比较,进行了确定最优批大小的实验。初步结果表明,基于知识的批处理学习具有最低的泛化错误率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信