摘要
MIRA(Margin Infused Relaxed Algorithm)是一种超保守算法,在分类、排序、回归等应用领域都取得不错成绩.文中在传统MIRA算法基础上进行改进,提出k-best MIRA(K-MIRA)与动态k-bestM IRA(DK-MIRA)算法.这两种算法能够根据学习进程自动调整优化约束条件,从而提高算法的收敛速度与性能.将K-MIRA与DK-MIRA用于定义类问题回答中的句子排序任务,取得较为满意的实验结果.
Margin infused relaxed algorithm (MIRA) is an improved ultraconservative algorithm, which is successfully used in classification, ranking and regression. The k-best MIRA (K-MIRA) and dynamic k-best MIRA (DK-MIRA) are proposed. The improved MIRA reduces the optimization constraints progressively as training moves forward. The experiment is carried out on the task of sentence ranking in definitional question answering with K-MIRA and DK-MIRA. The experimental results show that the proposed algorithms greatly improve the performance.
出处
《模式识别与人工智能》
EI
CSCD
北大核心
2009年第6期821-826,共6页
Pattern Recognition and Artificial Intelligence
基金
国家自然科学基金资助项目(No.60435020
60503070)
关键词
在线算法
MIRA
分类
定义类问题回答
Online Algorithm, Margin Infused Relaxed Algorithm (MIRA), Classification, Definitional Question Answering