FCV_1: A New Fast GreedyCovering Algorithm  

作　　者：陈彬 洪勇 

机构地区：[1]DepartmentofComputerScience,HarbinInstituteofTechnology,Harbin150001,P,R.China [2]DepartmentofComputerSc

出　　处：《Journal of Computer Science & Technology》1998年第4期369-374,共6页计算机科学技术学报（英文版）

摘　　要：In this paper, a new covering algorithm called FCV1 is presented. FCV1 comprises two algorithms, one of which is able to fast search for a partial rule and exclude the larg portion of negative examples, the other algorithm incorporates the more optimized greedy set-covering algorithm, and runs on a small portion of training examples. Hence,the training process of FCV1 is much faster than that of AQ15.In this paper, a new covering algorithm called FCV1 is presented. FCV1 comprises two algorithms, one of which is able to fast search for a partial rule and exclude the larg portion of negative examples, the other algorithm incorporates the more optimized greedy set-covering algorithm, and runs on a small portion of training examples. Hence,the training process of FCV1 is much faster than that of AQ15.

关 键 词：LEARNING NP-HARD covering algorithm 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]