一种k-means聚类的案例检索算法  

Case retrieval algorithm based on k-means clustering

作　　者：乔丽[1] 姜慧霖[1] 

机构地区：[1]商丘师范学院计算机科学系,河南商丘476000

出　　处：《计算机工程与应用》2011年第4期185-187,共3页Computer Engineering and Applications

摘　　要：针对CBR系统中案例检索算法存在的问题,根据k-means算法思想,将案例库进行聚类,在聚类基础上设计了一个案例检索算法。分析了样本案例的选取规则,重点论述了案例检索算法。根据实验结果表明,该方法能够有效地提高案例检索结果的召回率及案例检索效率。Aiming at the problems concerning case retrieval algorithm in the CBR system,this paper,in the light of the idea of the k-means algorithm,firstly clusteres the case database and then works out a case retrieval algorithm on the basis of the clustering of the case database.It analyzes the selecting principles of sample case,and mainly discusses the case retrieval algorithm.The results of experiment show that this algorithm can efficiently enhance the recall rate of the case retrieval outcomes and the efficiency of the case retrieval.

关 键 词：基于案例推理 聚类 目标案例 相似度 

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