%0 Journal Article
%T FCV1: A new fast greedy covering algorithm<br>FCV_1: A New Fast Greedy Covering Algorithm
%A Chen Bin
%A and Hong Yong
%A <br>Chen Bin
%A Hong Yong
%J 计算机科学技术学报
%D 1998
%I 
%X 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.
%K Learning
%K NP-hard
%K covering algorithm<br>机器学习
%K 覆盖算法
%K FCV1
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=823F7DD82960306849CABCD5508DC68A&yid=8CAA3A429E3EA654&vid=FC0714F8D2EB605D&iid=E158A972A605785F&sid=F7BB24011DC0D223&eid=5F8BAECF36EB55E2&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=10