Explicit versus implicit set-covering for supervised learning
Stephen Kowalski, DAN I. MOLDOVAN · 2002
It has been shown that implicit covering algorithms are effective for learning concepts from preclassified training examples. In this paper, we show that by making these covering algorithms explicit, concepts with lower error rates can be learned. Experimental results are reported for three real domains.>