摘要
In this paper, a new Case-Deletion strategy is proposed. This method absorbs merits o[ clustering algorithm. It overcomes the deflection of traditional deletion strategies. The experiments show that the new algorithm can reduce cases greatly and can preserve competence of CBR system.
In this paper, a new Case-Deletion strategy is proposed. This method absorbs merits of clustering algorithm. It overcomes the deflection of traditional deletion strategies. The experiments show that the new algorithm can reduce cases greatly and can preserve competence of CBR system.
出处
《计算机科学》
CSCD
北大核心
2003年第4期143-144,149,共3页
Computer Science
基金
国家自然科学基金(No.60075015
No.90104030)