On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes uniform distribution

DOI10.1007/3-540-36169-3_12MaRDI QIDQ4420745zbMATH OpenFDO

Authors Jürgen Forster, Hans Ulrich Simon

Publication date 18 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2533/25330128.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
• Classifications and constructions of minimum size linear sets on the projective line
• On a binary distance model for the minimum linear arrangement problem
• On linear sets of minimum size
• Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
• The equivalence relation polytope and random classification and clustering
• On a minimum linear classification problem
• On a minimum linear classification problem
• Minimum distance estimation in normed linear spaces with Donsker-classes
• Class dimension of association schemes in singular linear spaces

Cited in

(3)

• Limitations of learning via embeddings in Euclidean half-spaces
• 10.1162/153244303321897681
• On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes

This page was built for publication: On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes uniform distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420745)