top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
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
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
Opac: Controlla la disponibilità qui
Algorithmic learning theory : 20th International Conference, ALT 2009, Porto, Portugal, October 3-5, 2009 ; proceedings / / Ricard Gavalda, Gabor Lugosi, Thomas Zeugmann (eds.)
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
Opac: Controlla la disponibilità qui
Learning theory : 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006 : proceedings / / Gabor Lugosi, Hans Ulrich Simon (eds.)
Learning theory : 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006 : proceedings / / Gabor Lugosi, Hans Ulrich Simon (eds.)
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin ; ; New York, : Springer, c2006
Descrizione fisica 1 online resource (XII, 660 p.)
Disciplina 006.3/1
Altri autori (Persone) LugosiGabor
SimonHans-Ulrich
Collana Lecture notes in computer science. Lecture notes in artificial intelligence
LNCS sublibrary. SL 7, Artificial intelligence
Soggetto topico Machine learning
ISBN 3-540-35296-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Presentations -- Random Multivariate Search Trees -- On Learning and Logic -- Predictions as Statements and Decisions -- Clustering, Un-, and Semisupervised Learning -- A Sober Look at Clustering Stability -- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption -- Stable Transductive Learning -- Uniform Convergence of Adaptive Graph-Based Regularization -- Statistical Learning Theory -- The Rademacher Complexity of Linear Transformation Classes -- Function Classes That Approximate the Bayes Risk -- Functional Classification with Margin Conditions -- Significance and Recovery of Block Structures in Binary Matrices with Noise -- Regularized Learning and Kernel Methods -- Maximum Entropy Distribution Estimation with Generalized Regularization -- Unifying Divergence Minimization and Statistical Inference Via Convex Duality -- Mercer’s Theorem, Feature Maps, and Smoothing -- Learning Bounds for Support Vector Machines with Learned Kernels -- Query Learning and Teaching -- On Optimal Learning Algorithms for Multiplicity Automata -- Exact Learning Composed Classes with a Small Number of Mistakes -- DNF Are Teachable in the Average Case -- Teaching Randomized Learners -- Inductive Inference -- Memory-Limited U-Shaped Learning -- On Learning Languages from Positive Data and a Limited Number of Short Counterexamples -- Learning Rational Stochastic Languages -- Parent Assignment Is Hard for the MDL, AIC, and NML Costs -- Learning Algorithms and Limitations on Learning -- Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention -- Discriminative Learning Can Succeed Where Generative Learning Fails -- Improved Lower Bounds for Learning Intersections of Halfspaces -- Efficient Learning Algorithms Yield Circuit Lower Bounds -- Online Aggregation -- Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition -- Aggregation and Sparsity Via ?1 Penalized Least Squares -- A Randomized Online Learning Algorithm for Better Variance Control -- Online Prediction and Reinforcement Learning I -- Online Learning with Variable Stage Duration -- Online Learning Meets Optimization in the Dual -- Online Tracking of Linear Subspaces -- Online Multitask Learning -- Online Prediction and Reinforcement Learning II -- The Shortest Path Problem Under Partial Monitoring -- Tracking the Best Hyperplane with a Simple Budget Perceptron -- Logarithmic Regret Algorithms for Online Convex Optimization -- Online Variance Minimization -- Online Prediction and Reinforcement Learning III -- Online Learning with Constraints -- Continuous Experts and the Binning Algorithm -- Competing with Wild Prediction Rules -- Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path -- Other Approaches -- Ranking with a P-Norm Push -- Subset Ranking Using Regression -- Active Sampling for Multiple Output Identification -- Improving Random Projections Using Marginal Information -- Open Problems -- Efficient Algorithms for General Active Learning -- Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints.
Altri titoli varianti Nineteenth Annual Conference on Learning Theory
Annual Conference on Learning Theory
COLT 2006
Record Nr. UNINA-9910484279003321
Berlin ; ; New York, : Springer, c2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
A Probabilistic Theory of Pattern Recognition [[electronic resource] /] / by Luc Devroye, Laszlo Györfi, Gabor Lugosi
A Probabilistic Theory of Pattern Recognition [[electronic resource] /] / by Luc Devroye, Laszlo Györfi, Gabor Lugosi
Autore Devroye Luc
Edizione [1st ed. 1996.]
Pubbl/distr/stampa New York, NY : , : Springer New York : , : Imprint : Springer, , 1996
Descrizione fisica 1 online resource (XV, 638 p.)
Disciplina 519.2
Collana Stochastic Modelling and Applied Probability
Soggetto topico Probabilities
Pattern recognition
Probability Theory and Stochastic Processes
Pattern Recognition
ISBN 1-4612-0711-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910480303603321
Devroye Luc  
New York, NY : , : Springer New York : , : Imprint : Springer, , 1996
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
A Probabilistic Theory of Pattern Recognition [[electronic resource] /] / by Luc Devroye, Laszlo Györfi, Gabor Lugosi
A Probabilistic Theory of Pattern Recognition [[electronic resource] /] / by Luc Devroye, Laszlo Györfi, Gabor Lugosi
Autore Devroye Luc
Edizione [1st ed. 1996.]
Pubbl/distr/stampa New York, NY : , : Springer New York : , : Imprint : Springer, , 1996
Descrizione fisica 1 online resource (XV, 638 p.)
Disciplina 519.2
Collana Stochastic Modelling and Applied Probability
Soggetto topico Probabilities
Pattern recognition
Probability Theory and Stochastic Processes
Pattern Recognition
ISBN 1-4612-0711-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910789071903321
Devroye Luc  
New York, NY : , : Springer New York : , : Imprint : Springer, , 1996
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
A Probabilistic Theory of Pattern Recognition / / by Luc Devroye, Laszlo Györfi, Gabor Lugosi
A Probabilistic Theory of Pattern Recognition / / by Luc Devroye, Laszlo Györfi, Gabor Lugosi
Autore Devroye Luc
Edizione [1st ed. 1996.]
Pubbl/distr/stampa New York, NY : , : Springer New York : , : Imprint : Springer, , 1996
Descrizione fisica 1 online resource (XV, 638 p.)
Disciplina 519.2
Collana Stochastic Modelling and Applied Probability
Soggetto topico Probabilities
Pattern recognition
Probability Theory and Stochastic Processes
Pattern Recognition
ISBN 1-4612-0711-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Probabilistic Theory of Pattern Recognition -- Editor's page -- A Probabilistic Theory of Pattern Recognition -- Copyright -- Preface -- Contents -- 1 Introduction -- 2 The Bayes Error -- 3 Inequalities and Alternate Distance Measures -- 4 Linear Discrimination -- 5 Nearest Neighbor Rules -- 6 Consistency -- 7 Slow Rates of Convergence -- 8 Error Estimation -- 9 The Regular Histogram Rule -- 10 Kernel Rules -- 11 Consistency of the k-Nearest Neighbor Rule -- 12 Vapnik -Chervonenkis Theory -- 13 Combinatorial Aspects of Vapnik -Chervonenkis Theory -- 14 Lower Bounds for Empirical Classifier Selection -- 15 The Maximum Likelihood Principle -- 16 Parametric Classification -- 17 Generalized Linear Discrimination -- 18 Complexity Regularization -- 19 Condensed and Edited Nearest Neighbor Rules -- 20 Tree Classifiers -- 21 Data- Dependent Partitioning -- 22 Splitting the Data -- 23 The Resubstitution Estimate -- 24 Deleted Estimates of the Error Probability -- 25 Automatic Kernel Rules -- 26 Automatic Nearest Neighbor Rules -- 27 Hypercubes and Discrete Spaces -- 28 Epsilon Entropy and Totally Bounded Sets -- 29 Uniform Laws of Large Numbers -- 30 Neural Networks -- 31 Other Error Estimates -- 32 Feature Extraction -- Appendix -- Notation -- References -- Author Index -- Subject Index.
Record Nr. UNINA-9910819874703321
Devroye Luc  
New York, NY : , : Springer New York : , : Imprint : Springer, , 1996
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui