{"title":"一种有效的调整手写参数的方法","authors":"Gregory N. Hullender","doi":"10.1109/ICDAR.2001.953793","DOIUrl":null,"url":null,"abstract":"Many problems in recognition involve making linear combinations of results from various experts. Computing the coefficients can be expensive because a single test run can take many minutes, hours, or even days, and many values need to be evaluated to find an optimum. This paper describes an algorithm that can make a good approximation to the optimum value for a parameter in a single pass over the tuning data and also outlines methods for tuning several parameters at once.","PeriodicalId":277816,"journal":{"name":"Proceedings of Sixth International Conference on Document Analysis and Recognition","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient method for tuning handwriting parameters\",\"authors\":\"Gregory N. Hullender\",\"doi\":\"10.1109/ICDAR.2001.953793\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many problems in recognition involve making linear combinations of results from various experts. Computing the coefficients can be expensive because a single test run can take many minutes, hours, or even days, and many values need to be evaluated to find an optimum. This paper describes an algorithm that can make a good approximation to the optimum value for a parameter in a single pass over the tuning data and also outlines methods for tuning several parameters at once.\",\"PeriodicalId\":277816,\"journal\":{\"name\":\"Proceedings of Sixth International Conference on Document Analysis and Recognition\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Sixth International Conference on Document Analysis and Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDAR.2001.953793\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Sixth International Conference on Document Analysis and Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDAR.2001.953793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient method for tuning handwriting parameters
Many problems in recognition involve making linear combinations of results from various experts. Computing the coefficients can be expensive because a single test run can take many minutes, hours, or even days, and many values need to be evaluated to find an optimum. This paper describes an algorithm that can make a good approximation to the optimum value for a parameter in a single pass over the tuning data and also outlines methods for tuning several parameters at once.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
