Subclass reachability: Difference between revisions

Content deleted Content added

Revision as of 07:13, 26 September 2010 edit SmackBot (talk \| contribs) 3,734,324 edits m →See also: Tagging and general fixes ← Previous edit		Latest revision as of 17:03, 18 December 2021 edit undo Duckmather (talk \| contribs) Extended confirmed users 14,367 edits Merged content to Concept class. See Wikipedia:Articles for deletion/Subclass reachability. Tags: New redirect 2017 wikitext editor
(15 intermediate revisions by 13 users not shown)
Line 1: #REDIRECT [[Concept class]] ~~{{Unreferenced\|date=January 2009}}~~ {{R from merge}} In [[Exact concept learning]], 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). ~~==See also==~~ ~~[[Exclusion dimension]]~~ ~~{{Uncategorized stub\|date=September 2010}}~~ ~~{{Math-stub}}~~