Algorithmic Learning Theory : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Algorithmic Learning Theory : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Edizione: | 1st ed. 2000. |
| Descrizione fisica: | 1 online resource (XII, 348 p.) |
| Disciplina: | 006.3/1 |
| Soggetto topico: | Artificial intelligence |
| Computer programming | |
| Computers | |
| Algorithms | |
| Mathematical logic | |
| Natural language processing (Computer science) | |
| Artificial Intelligence | |
| Programming Techniques | |
| Computation by Abstract Devices | |
| Algorithm Analysis and Problem Complexity | |
| Mathematical Logic and Formal Languages | |
| Natural Language Processing (NLP) | |
| Persona (resp. second.): | ArimuraHiroki |
| JainSanjay | |
| SharmaArun | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references at the end of each chapters and index. |
| Nota di contenuto: | INVITED LECTURES -- Extracting Information from the Web for Concept Learning and Collaborative Filtering -- The Divide-and-Conquer Manifesto -- Sequential Sampling Techniques for Algorithmic Learning Theory -- REGULAR CONTRIBUTIONS -- Towards an Algorithmic Statistics -- Minimum Message Length Grouping of Ordered Data -- Learning From Positive and Unlabeled Examples -- Learning Erasing Pattern Languages with Queries -- Learning Recursive Concepts with Anomalies -- Identification of Function Distinguishable Languages -- A Probabilistic Identification Result -- A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System -- Hypotheses Finding via Residue Hypotheses with the Resolution Principle -- Conceptual Classifications Guided by a Concept Hierarchy -- Learning Taxonomic Relation by Case-based Reasoning -- Average-Case Analysis of Classification Algorithms for Boolean Functions and Decision Trees -- Self-duality of Bounded Monotone Boolean Functions and Related Problems -- Sharper Bounds for the Hardness of Prototype and Feature Selection -- On the Hardness of Learning Acyclic Conjunctive Queries -- Dynamic Hand Gesture Recognition Based On Randomized Self-Organizing Map Algorithm -- On Approximate Learning by Multi-layered Feedforward Circuits -- The Last-Step Minimax Algorithm -- Rough Sets and Ordinal Classification -- A note on the generalization performance of kernel classifiers with margin -- On the Noise Model of Support Vector Machines Regression -- Computationally Efficient Transductive Machines. |
| Titolo autorizzato: | Algorithmic Learning Theory |
| ISBN: | 3-540-40992-0 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910208853003321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Artificial Intelligence ; ; 1968