Concept learning by example decomposition
Sameer Joshi · Journal of Experimental & Theoretical Artificial Intelligence · 2009
It is widely accepted in machine learning that it is easier to learn several smaller decomposed concepts than a single large one. Typically, such decomposition of concepts is achieved in highly constrained environments, or aided by human experts. In this article, we investigate concept learning by example decomposition in a general probably approximately correct setting for Boolean learning. We develop sample complexity bounds for the different steps involved in the process. We formally show that if the cost of example partitioning is kept low then it is highly advantageous to learn by example decomposition.