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

Case Retrieval Strategy Based on Improved K-means Clustering

作　　者：乔丽[1] 姜慧霖[1] 贾世杰[2] 

机构地区：[1]商丘师范学院计算机科学系,河南商丘476000 [2]昆明理工大学信息工程与自动化学院,昆明650051

出　　处：《计算机工程》2011年第5期193-195,共3页Computer Engineering

摘　　要：针对目前基于案例推理系统中案例检索存在的问题,根据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.

关 键 词：基于案例推理 聚类 案例权重 相似度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]