A method to make multiple hypotheses with high cumulative recognition rate using SVMs

作者:

Highlights:

摘要

This paper describes a method to make multiple hypotheses with high cumulative recognition rate using SVMs. To make just a single hypothesis by using SVMs, it has been shown that Directed Acyclic Graph Support Vector Machines (DAGSVM) is very good with respect to recognition rate, learning time and evaluation time. However, DAGSVM is not directly applicable to make multiple hypotheses. In this paper, we propose a hybrid method of DAGSVM and Max-Win algorithm. Based on the result of DAGSVM, a limited set of classes are extracted. Then, Max-Win algorithm is applied to the set. We also provide the experimental results to show that the cumulative recognition rate of our method is as good as the Max-Win algorithm, and that the execution time is almost as fast as DAGSVM.

论文关键词:Support vector machines,DAGSVM,JEITA-HP,Max-Win algorithm,Rank information,Hybrid method

论文评审过程:Received 25 October 2002, Revised 27 June 2003, Accepted 27 June 2003, Available online 2 September 2003.

论文官网地址:https://doi.org/10.1016/S0031-3203(03)00236-X