FCV1:A New Fast Greedy Covering Algorithm

(整期优先)网络出版时间:1998-04-14
/ 1
Inthispaper,anewcoveringalgorithmcalledFCV1ispresented.FCV1comprisestwoalgorithms,oneofwhichisabletofastsearchforapartialruleandexcludethelargeportionofneggativeexamples,theotheralgorithmincorporatesthemoreoptimizedgreedyset-coveringalgorithm,andrunsonasmallportionoftrainingexamples.Hence,thetrainingprocessofFCV1ismuchfasterthanthatofAQ15.