Algorithmic Learning Theory [[electronic resource] ] : 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001. Proceedings. / / edited by Naoki Abe, Roni Khardon, Thomas Zeugmann |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (XII, 388 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Computer programming
Artificial intelligence Computers Algorithms Mathematical logic Natural language processing (Computer science) Programming Techniques Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
ISBN | 3-540-45583-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- The Discovery Science Project in Japan -- Queries Revisited -- Robot Baby 2001 -- Discovering Mechanisms: A Computational Philosophy of Science Perspective -- Inventing Discovery Tools: Combining Information Visualization with Data Mining -- Complexity of Learning -- On Learning Correlated Boolean Functions Using Statistical Queries (Extended Abstract) -- A Simpler Analysis of the Multi-way Branching Decision Tree Boosting Algorithm -- Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard -- Support Vector Machines -- Learning of Boolean Functions Using Support Vector Machines -- A Random Sampling Technique for Training Support Vector Machines -- New Learning Models -- Learning Coherent Concepts -- Learning Intermediate Concepts -- Real-Valued Multiple-Instance Learning with Queries -- Online Learning -- Loss Functions, Complexities, and the Legendre Transformation -- Non-linear Inequalities between Predictive and Kolmogorov Complexities -- Inductive Inference -- Learning by Switching Type of Information -- Learning How to Separate -- Learning Languages in a Union -- On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes -- Refutable Inductive Inference -- Refutable Language Learning with a Neighbor System -- Learning Recursive Functions Refutably -- Refuting Learning Revisited -- Learning Structures and Languages -- Efficient Learning of Semi-structured Data from Queries -- Extending Elementary Formal Systems -- Learning Regular Languages Using RFSA -- Inference of ?-Languages from Prefixes. |
Record Nr. | UNISA-996465910103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Learning Theory : 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001. Proceedings. / / edited by Naoki Abe, Roni Khardon, Thomas Zeugmann |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (XII, 388 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Computer programming
Artificial intelligence Computers Algorithms Mathematical logic Natural language processing (Computer science) Programming Techniques Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
ISBN | 3-540-45583-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- The Discovery Science Project in Japan -- Queries Revisited -- Robot Baby 2001 -- Discovering Mechanisms: A Computational Philosophy of Science Perspective -- Inventing Discovery Tools: Combining Information Visualization with Data Mining -- Complexity of Learning -- On Learning Correlated Boolean Functions Using Statistical Queries (Extended Abstract) -- A Simpler Analysis of the Multi-way Branching Decision Tree Boosting Algorithm -- Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard -- Support Vector Machines -- Learning of Boolean Functions Using Support Vector Machines -- A Random Sampling Technique for Training Support Vector Machines -- New Learning Models -- Learning Coherent Concepts -- Learning Intermediate Concepts -- Real-Valued Multiple-Instance Learning with Queries -- Online Learning -- Loss Functions, Complexities, and the Legendre Transformation -- Non-linear Inequalities between Predictive and Kolmogorov Complexities -- Inductive Inference -- Learning by Switching Type of Information -- Learning How to Separate -- Learning Languages in a Union -- On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes -- Refutable Inductive Inference -- Refutable Language Learning with a Neighbor System -- Learning Recursive Functions Refutably -- Refuting Learning Revisited -- Learning Structures and Languages -- Efficient Learning of Semi-structured Data from Queries -- Extending Elementary Formal Systems -- Learning Regular Languages Using RFSA -- Inference of ?-Languages from Prefixes. |
Record Nr. | UNINA-9910767574803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|