KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Algorithmic Learning Theory
  • Produktbild: Algorithmic Learning Theory
Band 2533

Algorithmic Learning Theory 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings

Aus der Reihe Lecture Notes in Artificial Intelligence

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.11.2002

Abbildungen

XII, 420 p.

Herausgeber

Nicolò Cesa-Bianchi + weitere

Verlag

Springer Berlin

Seitenzahl

420

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

2002

Sprache

Englisch

ISBN

978-3-540-00170-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.11.2002

Abbildungen

XII, 420 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

420

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

2002

Sprache

Englisch

ISBN

978-3-540-00170-6

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Algorithmic Learning Theory
  • Produktbild: Algorithmic Learning Theory
  • Editors’ Introduction.- Editors’ Introduction.- Invited Papers.- Mathematics Based on Learning.- Data Mining with Graphical Models.- On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum.- In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project.- Learning Structure from Sequences, with Applications in a Digital Library.- Regular Contributions.- On Learning Monotone Boolean Functions under the Uniform Distribution.- On Learning Embedded Midbit Functions.- Maximizing Agreements and CoAgnostic Learning.- Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning.- Large Margin Classification for Moving Targets.- On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution.- A General Dimension for Approximately Learning Boolean Functions.- The Complexity of Learning Concept Classes with Polynomial General Dimension.- On the Absence of Predictive Complexity for Some Games.- Consistency Queries in Information Extraction.- Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data.- Reflective Inductive Inference of Recursive Functions.- Classes with Easily Learnable Subclasses.- On the Learnability of Vector Spaces.- Learning, Logic, and Topology in a Common Framework.- A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning.- Minimised Residue Hypotheses in Relevant Logic.- Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages.- A Negative Result on Inductive Inference of Extended Pattern Languages.- RBF Neural Networks and Descartes’ Rule of Signs.- Asymptotic Optimality of Transductive Confidence Machine.- An Efficient PAC Algorithm forReconstructing a Mixture of Lines.- Constraint Classification: A New Approach to Multiclass Classification.- How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution.- Classification with Intersecting Rules.- Feedforward Neural Networks in Reinforcement Learning Applied to High-Dimensional Motor Control.