FCV1: A new fast greedy covering algorithm
FCV_1: A New Fast Greedy Covering Algorithm

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.