Subclass reachability: Difference between revisions

Revision as of 03:18, 18 April 2011

Latest revision as of 17:03, 18 December 2021

(12 intermediate revisions by 10 users not shown)

Line 1:

#REDIRECT [[Concept class]]

{{Unreferenced|date=January 2009}}

{{R from merge}}

{{Context|date=February 2011}}

In exact concept learning in [[mathmatics]], given a 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]]

{{Math-stub}}