Overview

Full Product Details

Author:   Peter Auer ,  Ron Meir
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2005 ed.
Volume:   3559
Dimensions:   Width: 15.50cm , Height: 3.60cm , Length: 23.50cm
Weight:   2.170kg
ISBN:  

9783540265566

ISBN 10:   3540265562
Pages:   692
Publication Date:   20 June 2005
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Learning to Rank.- Ranking and Scoring Using Empirical Risk Minimization.- Learnability of Bipartite Ranking Functions.- Stability and Generalization of Bipartite Ranking Algorithms.- Loss Bounds for Online Category Ranking.- Boosting.- Margin-Based Ranking Meets Boosting in the Middle.- Martingale Boosting.- The Value of Agreement, a New Boosting Algorithm.- Unlabeled Data, Multiclass Classification.- A PAC-Style Model for Learning from Labeled and Unlabeled Data.- Generalization Error Bounds Using Unlabeled Data.- On the Consistency of Multiclass Classification Methods.- Sensitive Error Correcting Output Codes.- Online Learning I.- Data Dependent Concentration Bounds for Sequential Prediction Algorithms.- The Weak Aggregating Algorithm and Weak Mixability.- Tracking the Best of Many Experts.- Improved Second-Order Bounds for Prediction with Expert Advice.- Online Learning II.- Competitive Collaborative Learning.- Analysis of Perceptron-Based Active Learning.- A New Perspective on an Old Perceptron Algorithm.- Support Vector Machines.- Fast Rates for Support Vector Machines.- Exponential Convergence Rates in Classification.- General Polynomial Time Decomposition Algorithms.- Kernels and Embeddings.- Approximating a Gram Matrix for Improved Kernel-Based Learning.- Learning Convex Combinations of Continuously Parameterized Basic Kernels.- On the Limitations of Embedding Methods.- Leaving the Span.- Inductive Inference.- Variations on U-Shaped Learning.- Mind Change Efficient Learning.- On a Syntactic Characterization of Classification with a Mind Change Bound.- Unsupervised Learning.- Ellipsoid Approximation Using Random Vectors.- The Spectral Method for General Mixture Models.- On Spectral Learning of Mixtures of Distributions.- From Graphs to Manifolds – Weak andStrong Pointwise Consistency of Graph Laplacians.- Towards a Theoretical Foundation for Laplacian-Based Manifold Methods.- Generalization Bounds.- Permutation Tests for Classification.- Localized Upper and Lower Bounds for Some Estimation Problems.- Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers.- Rank, Trace-Norm and Max-Norm.- Query Learning, Attribute Efficiency, Compression Schemes.- Learning a Hidden Hypergraph.- On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions.- Unlabeled Compression Schemes for Maximum Classes.- Economics and Game Theory.- Trading in Markovian Price Models.- From External to Internal Regret.- Separation Results for Learning Models.- Separating Models of Learning from Correlated and Uncorrelated Data.- Asymptotic Log-Loss of Prequential Maximum Likelihood Codes.- Teaching Classes with High Teaching Dimension Using Few Examples.- Open Problems.- Optimum Follow the Leader Algorithm.- The Cross Validation Problem.- Compute Inclusion Depth of a Pattern.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions