Unique negative dimension: Difference between revisions
Jump to navigation
Jump to search
imported>OAbot m Open access bot: doi added to citation with #oabot. |
imported>Fadesga |
||
| Line 15: | Line 15: | ||
{{ | {{Comp-sci-theory-stub}} | ||
{{machine-learning-stub}} | |||
Latest revision as of 18:00, 25 June 2025
Unique negative dimension (UND) is a complexity measure for the model of learning from positive examples. The unique negative dimension of a class of concepts is the size of the maximum subclass such that for every concept , we have is nonempty.
This concept was originally proposed by M. Gereb-Graus in "Complexity of learning from one-side examples", Technical Report TR-20-89, Harvard University Division of Engineering and Applied Science, 1989.[1][2][3]
See also
References
Template:Comp-sci-theory-stub
Template:Machine-learning-stub
- ↑ Script error: No such module "Citation/CS1".
- ↑ Template:Cite thesis
- ↑ Script error: No such module "Citation/CS1".