Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithmic Learning Theory [[electronic resource] ] : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma
| Algorithmic Learning Theory [[electronic resource] ] : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 348 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| 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) |
| ISBN | 3-540-40992-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNISA-996466193503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma
| Algorithmic Learning Theory : 11th International Conference, ALT 2000 Sydney, Australia, December 11-13, 2000 Proceedings / / edited by Hiroki Arimura, Sanjay Jain, Arun Sharma |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XII, 348 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| 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) |
| ISBN | 3-540-40992-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNINA-9910208853003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||