首页> 中文期刊> 《计算机工程 》 >基于改进K-means聚类的案例检索策略

基于改进K-means聚类的案例检索策略

             

摘要

针对目前基于案例推理系统中案例检索存在的问题,根据K-means算法思想,分别设计一个案例聚类算法及案例检索算法.根据K-means算法的不足,对初值选取规则及案例检索算法进行改进.分析基于案例权重的样本案例选取规则,并论述案例聚类算法和检索算.法.实验结果表明,该方法能有效提高案例检索效率及案例检索结果的召回率.%Aiming at the case retrieval problems in the Case-Based Reasoning(CBR) system, in the light of the idea of the K-means algorithm, this paper designs a clustering algorithm and a case retrieval algorithm respectively. In terms of the deficiency of the K-means algorithm, this paper improves the selecting rules of initial values as well as the case retrieval algorithm. It analyzes the selecting rules of sample case on the basis of case-weight, and deeply discusses the case clustering algorithm and retrieval algorithm. Experimental results show that this method can efficiently raise the efficiency of case retrieval and enhance the recall rate of the retrieval results.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号