Subclass reachability: Difference between revisions

Revision as of 09:18, 3 March 2012

Revision as of 19:23, 7 July 2014

Line 1:

{{Multiple issues|unreferenced = January 2009|context = February 2011|orphan = November 2011}}

In exact concept[[computational learning theory]] in [[mathematics]], given a [[Concept class|class of concepts]] C, a subclass D is '''reachable''' if there exists a partial approximation S of some concept such that D contains exactly those concepts in C that are extensions to S (i.e., D=C|S).

[[Category:Machine learning]]