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] ] : 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings / / edited by Shai Ben David, John Case, Akira Maruoka
| Algorithmic Learning Theory [[electronic resource] ] : 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings / / edited by Shai Ben David, John Case, Akira Maruoka |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 514 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Mathematical logic Natural language processing (Computer science) Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN | 3-540-30215-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- String Pattern Discovery -- Applications of Regularized Least Squares to Classification Problems -- Probabilistic Inductive Logic Programming -- Hidden Markov Modelling Techniques for Haplotype Analysis -- Learning, Logic, and Probability: A Unified View -- Regular Contributions -- Learning Languages from Positive Data and Negative Counterexamples -- Inductive Inference of Term Rewriting Systems from Positive Data -- On the Data Consumption Benefits of Accepting Increased Uncertainty -- Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space -- Learning r-of-k Functions by Boosting -- Boosting Based on Divide and Merge -- Learning Boolean Functions in AC 0 on Attribute and Classification Noise -- Decision Trees: More Theoretical Justification for Practical Algorithms -- Application of Classical Nonparametric Predictors to Learning Conditionally I.I.D. Data -- Complexity of Pattern Classes and Lipschitz Property -- On Kernels, Margins, and Low-Dimensional Mappings -- Estimation of the Data Region Using Extreme-Value Distributions -- Maximum Entropy Principle in Non-ordered Setting -- Universal Convergence of Semimeasures on Individual Random Sequences -- A Criterion for the Existence of Predictive Complexity for Binary Games -- Full Information Game with Gains and Losses -- Prediction with Expert Advice by Following the Perturbed Leader for General Weights -- On the Convergence Speed of MDL Predictions for Bernoulli Sequences -- Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm -- On the Complexity of Working Set Selection -- Convergence of a Generalized Gradient Selection Approach for the Decomposition Method -- Newton Diagram and Stochastic Complexity in Mixture of Binomial Distributions -- Learnability of Relatively Quantified Generalized Formulas -- Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages -- New Revision Algorithms -- The Subsumption Lattice and Query Learning -- Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries -- Learning Tree Languages from Positive Examples and Membership Queries -- Learning Content Sequencing in an Educational Environment According to Student Needs -- Tutorial Papers -- Statistical Learning in Digital Wireless Communications -- A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks -- Approximate Inference in Probabilistic Models. |
| Record Nr. | UNISA-996465282103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings / / edited by Shai Ben David, John Case, Akira Maruoka
| Algorithmic Learning Theory : 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings / / edited by Shai Ben David, John Case, Akira Maruoka |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 514 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Logic, Symbolic and mathematical Natural language processing (Computer science) Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Natural Language Processing (NLP) |
| ISBN | 3-540-30215-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- String Pattern Discovery -- Applications of Regularized Least Squares to Classification Problems -- Probabilistic Inductive Logic Programming -- Hidden Markov Modelling Techniques for Haplotype Analysis -- Learning, Logic, and Probability: A Unified View -- Regular Contributions -- Learning Languages from Positive Data and Negative Counterexamples -- Inductive Inference of Term Rewriting Systems from Positive Data -- On the Data Consumption Benefits of Accepting Increased Uncertainty -- Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space -- Learning r-of-k Functions by Boosting -- Boosting Based on Divide and Merge -- Learning Boolean Functions in AC 0 on Attribute and Classification Noise -- Decision Trees: More Theoretical Justification for Practical Algorithms -- Application of Classical Nonparametric Predictors to Learning Conditionally I.I.D. Data -- Complexity of Pattern Classes and Lipschitz Property -- On Kernels, Margins, and Low-Dimensional Mappings -- Estimation of the Data Region Using Extreme-Value Distributions -- Maximum Entropy Principle in Non-ordered Setting -- Universal Convergence of Semimeasures on Individual Random Sequences -- A Criterion for the Existence of Predictive Complexity for Binary Games -- Full Information Game with Gains and Losses -- Prediction with Expert Advice by Following the Perturbed Leader for General Weights -- On the Convergence Speed of MDL Predictions for Bernoulli Sequences -- Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm -- On the Complexity of Working Set Selection -- Convergence of a Generalized Gradient Selection Approach for the Decomposition Method -- Newton Diagram and Stochastic Complexity in Mixture of Binomial Distributions -- Learnability of Relatively Quantified Generalized Formulas -- Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages -- New Revision Algorithms -- The Subsumption Lattice and Query Learning -- Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries -- Learning Tree Languages from Positive Examples and Membership Queries -- Learning Content Sequencing in an Educational Environment According to Student Needs -- Tutorial Papers -- Statistical Learning in Digital Wireless Communications -- A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks -- Approximate Inference in Probabilistic Models. |
| Record Nr. | UNINA-9910144344903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Learning Theory [[electronic resource] ] : 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings / / edited by Ming Li, Akira Maruoka
| Algorithmic Learning Theory [[electronic resource] ] : 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings / / edited by Ming Li, Akira Maruoka |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIV, 470 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-540-69602-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Program error detection/correction: Turning PAC learning into Perfect learning -- Team learning as a game -- Inferability of recursive real-valued functions -- Learning of R.E. Languages from good examples -- Identifiability of subspaces and homomorphic images of zero-reversible languages -- On exploiting knowledge and concept use in learning theory -- Partial occam's razor and its applications -- Derandomized learning of boolean functions -- Learning DFA from simple examples -- PAC learning under helpful distributions -- PAC learning using Nadaraya-Watson estimator based on orthonormal systems -- Monotone extensions of boolean data sets -- Classical Brouwer-Heyting-Kolmogorov interpretation -- Inferring a system from examples with time passage -- Polynomial time inductive inference of regular term tree languages from positive data -- Synthesizing noise-tolerant language learners -- Effects of Kolmogorov complexity present in inductive inference as well -- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries -- Oracles in ? 2 p are sufficient for exact learning -- Exact learning via teaching assistants (Extended abstract) -- An efficient exact learning algorithm for ordered binary decision diagrams -- Probability theory for the Brier game -- Learning and revising theories in noisy domains -- A note on a scale-sensitive dimension of linear bounded functionals in Banach Spaces -- On the relevance of time in neural computation and learning -- A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree -- Learning disjunctions of features -- Learning simple deterministic finite-memory automata -- Learning acyclic first-order horn sentences from entailment -- On learning disjunctions of zero-one threshold functions with queries. |
| Record Nr. | UNISA-996465517503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings / / edited by Ming Li, Akira Maruoka
| Algorithmic Learning Theory : 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings / / edited by Ming Li, Akira Maruoka |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIV, 470 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Artificial Intelligence Formal Languages and Automata Theory |
| ISBN | 3-540-69602-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Program error detection/correction: Turning PAC learning into Perfect learning -- Team learning as a game -- Inferability of recursive real-valued functions -- Learning of R.E. Languages from good examples -- Identifiability of subspaces and homomorphic images of zero-reversible languages -- On exploiting knowledge and concept use in learning theory -- Partial occam's razor and its applications -- Derandomized learning of boolean functions -- Learning DFA from simple examples -- PAC learning under helpful distributions -- PAC learning using Nadaraya-Watson estimator based on orthonormal systems -- Monotone extensions of boolean data sets -- Classical Brouwer-Heyting-Kolmogorov interpretation -- Inferring a system from examples with time passage -- Polynomial time inductive inference of regular term tree languages from positive data -- Synthesizing noise-tolerant language learners -- Effects of Kolmogorov complexity present in inductive inference as well -- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries -- Oracles in ? 2 p are sufficient for exact learning -- Exact learning via teaching assistants (Extended abstract) -- An efficient exact learning algorithm for ordered binary decision diagrams -- Probability theory for the Brier game -- Learning and revising theories in noisy domains -- A note on a scale-sensitive dimension of linear bounded functionals in Banach Spaces -- On the relevance of time in neural computation and learning -- A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree -- Learning disjunctions of features -- Learning simple deterministic finite-memory automata -- Learning acyclic first-order horn sentences from entailment -- On learning disjunctionsof zero-one threshold functions with queries. |
| Record Nr. | UNINA-9910768453403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||