Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Subclass_reachability> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Subclass_reachability abstract "In exact concept learning in mathematics, 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).".
- Subclass_reachability wikiPageID "3119546".
- Subclass_reachability wikiPageRevisionID "479952542".
- Subclass_reachability context "February 2011".
- Subclass_reachability hasPhotoCollection Subclass_reachability.
- Subclass_reachability orphan "November 2011".
- Subclass_reachability unreferenced "January 2009".
- Subclass_reachability subject Category:Machine_learning.
- Subclass_reachability comment "In exact concept learning in mathematics, 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).".
- Subclass_reachability label "Subclass reachability".
- Subclass_reachability sameAs m.08spqy.
- Subclass_reachability sameAs Q7630929.
- Subclass_reachability sameAs Q7630929.
- Subclass_reachability wasDerivedFrom Subclass_reachability?oldid=479952542.
- Subclass_reachability isPrimaryTopicOf Subclass_reachability.