摘要
在基于K-means的案例检索算法中,目标案例初次映射的失败会导致案例检索成功率降低。针对该问题,提出一种基于滑动窗口的案例检索算法。分析滑动窗口维护策略,利用滑动窗口收集案例库中权重较高且最近常使用的案例,增加案例采样数量。实验结果表明,该算法能提高检索成功率,检索时间较短且案例映射次数较少。
The problem of low success rate of case retrieval is caused by the first mapping failure of target case in case retrieval algorithm based on the K-means clustering. Aiming at this problem, this paper proposes a case retrieval algorithm based on the sliding window and analyzes the maintain strategy of sliding window. It utilizes the sliding window to collect the cases which have high weight and recently the most frequency of use so that it adds the sampling number of case and improve the speed of case retrieval. Experimental results show that the algorithm can improve the success rate of retrieval, and obtain the better performance at the aspect of the retrieval time and the mapping number of target case.
出处
《计算机工程》
CAS
CSCD
2012年第6期201-203,206,共4页
Computer Engineering
基金
2010年商丘师范学院青年科研基金资助项目(2010QN12)
商丘师范学院2010年度教育教学改革研究基金资助项目(2010-jgxm-47)
2011年度河南省政府决策研究一般招标课题基金资助项目(2011B590)
河南省科技厅科技攻关基金资助项目(112102210120)
关键词
案例检索
滑动窗口
案例权重
相似度
case retrieval
sliding window
case weight
similarity
