Subclass Reachability
From Handwiki In computational learning theory 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).
 |
Categories: [Machine learning]
↧ Download as ZWI file | Last modified: 08/25/2024 11:55:17 | 6 views
☰ Source: https://handwiki.org/wiki/Subclass_reachability | License: CC BY-SA 3.0
✘
ZWI is not signed. [what is this?]
ZWI viewer
by the 
KSF
KSF