Algorithmic Learning Theory [[electronic resource] ] : 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014, Proceedings / / edited by Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XVIII, 351 p. 22 illus.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computers Data mining Pattern recognition Artificial Intelligence Theory of Computation Data Mining and Knowledge Discovery Pattern Recognition |
ISBN | 3-319-11662-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Inductive Inference -- Exact Learning from Queries -- Reinforcement Learning -- Online Learning and Learning with Bandit Information -- Statistical Learning Theory -- Privacy, Clustering, MDL, and Kolmogorov Complexity. |
Record Nr. | UNISA-996213650903316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Learning Theory : 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014, Proceedings / / edited by Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XVIII, 351 p. 22 illus.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computers Data mining Pattern recognition Artificial Intelligence Theory of Computation Data Mining and Knowledge Discovery Pattern Recognition |
ISBN | 3-319-11662-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Inductive Inference -- Exact Learning from Queries -- Reinforcement Learning -- Online Learning and Learning with Bandit Information -- Statistical Learning Theory -- Privacy, Clustering, MDL, and Kolmogorov Complexity. |
Record Nr. | UNINA-9910482964503321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Learning Theory [[electronic resource] ] : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XVIII, 397 p. 30 illus.) |
Disciplina | 006.31 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Computers Computer logic Pattern recognition Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
ISBN | 3-642-40935-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Editors’ Introduction -- Learning and Optimizing with Preferences -- Efficient Algorithms for Combinatorial Online Prediction -- Exact Learning from Membership Queries: Some Techniques, Results and New Directions -- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration -- Combinatorial Online Prediction via Metarounding -- On Competitive Recommendations -- Online PCA with Optimal Regrets -- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages -- Topological Separations in Inductive Inference -- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data -- Universal Knowledge-Seeking Agents for Stochastic Environments -- Teaching and Learning from Queries Order Compression Schemes -- Learning a Bounded-Degree Tree Using Separator Queries -- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates -- Robust Risk-Averse Stochastic Multi-armed Bandits -- An Efficient Algorithm for Learning with Semi-bandit Feedback -- Differentially-Private Learning of Low Dimensional Manifolds -- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data -- Adaptive Metric Dimensionality Reduction -- Dimension-Adaptive Bounds on Compressive FLD Classification -- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study -- Concentration and Confidence for Discrete Bayesian Sequence Predictors -- Algorithmic Connections between Active Learning and Stochastic Convex Optimization -- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning -- Fast Spectral Clustering via the Nyström Method -- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. |
Record Nr. | UNISA-996465423903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Learning Theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XVIII, 397 p. 30 illus.) |
Disciplina | 006.31 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Computers Computer logic Pattern recognition Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
ISBN | 3-642-40935-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Editors’ Introduction -- Learning and Optimizing with Preferences -- Efficient Algorithms for Combinatorial Online Prediction -- Exact Learning from Membership Queries: Some Techniques, Results and New Directions -- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration -- Combinatorial Online Prediction via Metarounding -- On Competitive Recommendations -- Online PCA with Optimal Regrets -- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages -- Topological Separations in Inductive Inference -- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data -- Universal Knowledge-Seeking Agents for Stochastic Environments -- Teaching and Learning from Queries Order Compression Schemes -- Learning a Bounded-Degree Tree Using Separator Queries -- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates -- Robust Risk-Averse Stochastic Multi-armed Bandits -- An Efficient Algorithm for Learning with Semi-bandit Feedback -- Differentially-Private Learning of Low Dimensional Manifolds -- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data -- Adaptive Metric Dimensionality Reduction -- Dimension-Adaptive Bounds on Compressive FLD Classification -- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study -- Concentration and Confidence for Discrete Bayesian Sequence Predictors -- Algorithmic Connections between Active Learning and Stochastic Convex Optimization -- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning -- Fast Spectral Clustering via the Nyström Method -- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. |
Record Nr. | UNINA-9910484834203321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithmic Learning Theory [[electronic resource] ] : 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012, Proceedings / / edited by Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XII, 381 p. 23 illus.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Computers Computer logic Pattern recognition Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
ISBN | 3-642-34106-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | inductive inference -- teaching and PAC learning -- statistical learning theory and classification -- relations between models and data -- bandit problems, online prediction of individual sequences.- other models of online learning. |
Record Nr. | UNISA-996465651103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Learning Theory [[electronic resource] ] : 22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011, Proceedings / / edited by Jyriki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann |
Edizione | [1st ed. 2011.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Descrizione fisica | 1 online resource (XIII, 453 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Computers Computer logic Application software Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Information Systems Applications (incl. Internet) |
ISBN | 3-642-24412-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465413303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Learning Theory [[electronic resource] ] : 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings / / edited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XIII, 421 p. 45 illus.) |
Disciplina | 006.3/1 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computer programming Mathematical logic Algorithms Computers Computer logic Artificial Intelligence Programming Techniques Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs |
ISBN |
1-280-38945-1
9786613567376 3-642-16108-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Towards General Algorithms for Grammatical Inference -- The Blessing and the Curse of the Multiplicative Updates -- Discovery of Abstract Concepts by a Robot -- Contrast Pattern Mining and Its Application for Building Robust Classifiers -- Optimal Online Prediction in Adversarial Environments -- Regular Contributions -- An Algorithm for Iterative Selection of Blocks of Features -- Bayesian Active Learning Using Arbitrary Binary Valued Queries -- Approximation Stability and Boosting -- A Spectral Approach for Probabilistic Grammatical Inference on Trees -- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation -- Inferring Social Networks from Outbreaks -- Distribution-Dependent PAC-Bayes Priors -- PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar -- A PAC-Bayes Bound for Tailored Density Estimation -- Compressed Learning with Regular Concept -- A Lower Bound for Learning Distributions Generated by Probabilistic Automata -- Lower Bounds on Learning Random Structures with Statistical Queries -- Recursive Teaching Dimension, Learning Complexity, and Maximum Classes -- Toward a Classification of Finite Partial-Monitoring Games -- Switching Investments -- Prediction with Expert Advice under Discounted Loss -- A Regularization Approach to Metrical Task Systems -- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations -- Learning without Coding -- Learning Figures with the Hausdorff Metric by Fractals -- Inductive Inference of Languages from Samplings -- Optimality Issues of Universal Greedy Agents with Static Priors -- Consistency of Feature Markov Processes -- Algorithms for Adversarial Bandit Problems with Multiple Plays -- Online Multiple Kernel Learning: Algorithms and Mistake Bounds -- An Identity for Kernel Ridge Regression. |
Record Nr. | UNISA-996465982503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Learning Theory [[electronic resource] ] : 20th International Conference, ALT 2009, Porto, Portugal, October 3-5, 2009, Proceedings / / edited by Ricard Gavaldà, Gabor Lugosi, Thomas Zeugmann, Sandra Zilles |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XI, 399 p.) |
Disciplina | 006.3/1 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computer programming Data mining Natural language processing (Computer science) Pattern recognition Information storage and retrieval Artificial Intelligence Programming Techniques Data Mining and Knowledge Discovery Natural Language Processing (NLP) Pattern Recognition Information Storage and Retrieval |
Soggetto genere / forma |
Kongress.
Porto (Portugal, 2009) |
ISBN | 3-642-04414-X |
Classificazione |
DAT 708f
SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- The Two Faces of Active Learning -- Inference and Learning in Planning -- Mining Heterogeneous Information Networks by Exploring the Power of Links -- Learning and Domain Adaptation -- Learning on the Web -- Regular Contributions -- Prediction with Expert Evaluators’ Advice -- Pure Exploration in Multi-armed Bandits Problems -- The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses -- Computable Bayesian Compression for Uniformly Discretizable Statistical Models -- Calibration and Internal No-Regret with Random Signals -- St. Petersburg Portfolio Games -- Reconstructing Weighted Graphs with Minimal Query Complexity -- Learning Unknown Graphs -- Completing Networks Using Observed Data -- Average-Case Active Learning with Costs -- Canonical Horn Representations and Query Learning -- Learning Finite Automata Using Label Queries -- Characterizing Statistical Query Learning: Simplified Notions and Proofs -- An Algebraic Perspective on Boolean Function Learning -- Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm -- Complexity versus Agreement for Many Views -- Error-Correcting Tournaments -- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference -- Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data -- Uncountable Automatic Classes and Learning -- Iterative Learning from Texts and Counterexamples Using Additional Information -- Incremental Learning with Ordinal Bounded Example Memory -- Learning from Streams -- Smart PAC-Learners -- Approximation Algorithms for Tensor Clustering -- Agnostic Clustering. |
Record Nr. | UNISA-996465309803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic learning theory : 20th International Conference, ALT 2009, Porto, Portugal, October 3-5, 2009 ; proceedings / / Ricard Gavalda, Gabor Lugosi, Thomas Zeugmann (eds.) |
Edizione | [1st ed.] |
Pubbl/distr/stampa | New York, : Springer, 2009 |
Descrizione fisica | 1 online resource (XI, 399 p.) |
Disciplina | 006.3/1 |
Altri autori (Persone) |
GavaldaRicard
LugosiGabor ZeugmannThomas |
Collana | Lecture notes in computer science. Lecture notes in artificial intelligence |
Soggetto topico |
Computer algorithms
Machine learning |
ISBN | 3-642-04414-X |
Classificazione |
DAT 708f
SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- The Two Faces of Active Learning -- Inference and Learning in Planning -- Mining Heterogeneous Information Networks by Exploring the Power of Links -- Learning and Domain Adaptation -- Learning on the Web -- Regular Contributions -- Prediction with Expert Evaluators’ Advice -- Pure Exploration in Multi-armed Bandits Problems -- The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses -- Computable Bayesian Compression for Uniformly Discretizable Statistical Models -- Calibration and Internal No-Regret with Random Signals -- St. Petersburg Portfolio Games -- Reconstructing Weighted Graphs with Minimal Query Complexity -- Learning Unknown Graphs -- Completing Networks Using Observed Data -- Average-Case Active Learning with Costs -- Canonical Horn Representations and Query Learning -- Learning Finite Automata Using Label Queries -- Characterizing Statistical Query Learning: Simplified Notions and Proofs -- An Algebraic Perspective on Boolean Function Learning -- Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm -- Complexity versus Agreement for Many Views -- Error-Correcting Tournaments -- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference -- Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data -- Uncountable Automatic Classes and Learning -- Iterative Learning from Texts and Counterexamples Using Additional Information -- Incremental Learning with Ordinal Bounded Example Memory -- Learning from Streams -- Smart PAC-Learners -- Approximation Algorithms for Tensor Clustering -- Agnostic Clustering. |
Record Nr. | UNINA-9910483550403321 |
New York, : Springer, 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
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 | ||
|