Cover's theorem

GPTKB entity

Statements (16)
Predicate Object
gptkbp:instanceOf gptkb:mathematical_concept
gptkbp:appliesTo gptkb:kernel_methods
support vector machines
gptkbp:author gptkb:Thomas_M._Cover
gptkbp:field gptkb:machine_learning
pattern recognition
gptkbp:hasConcept A complex pattern-classification problem cast in a high-dimensional space nonlinearly is more likely to be linearly separable than in a low-dimensional space.
https://www.w3.org/2000/01/rdf-schema#label Cover's theorem
gptkbp:namedAfter gptkb:Thomas_M._Cover
gptkbp:relatedConcept feature space
linear separability
nonlinear transformation
gptkbp:statedIn gptkb:Geometrical_and_Statistical_Properties_of_Systems_of_Linear_Inequalities_with_Applications_in_Pattern_Recognition
gptkbp:yearStated 1965
gptkbp:bfsParent gptkb:Thomas_Cover
gptkbp:bfsLayer 6