Unique negative dimension

Unique negative dimension (UND) is a complexity measure for the model of learning from positive examples. The unique negative dimension of a class $C$ of concepts is the size of the maximum subclass $D \subseteq C$ such that for every concept $c \in D$ , we have $\cap (D ∖ {c}) ∖ c$ 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]

References

^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

P ≟ NP

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

Stub icon

This machine learning-related article is a stub. You can help Wikipedia by expanding it.

[1] Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

[2] Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

[3] Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

[1]

[2]

[3]

Unique negative dimension

See also

References

Navigation menu

Unique negative dimension

See also

References

Navigation menu

Search