• 读书网|DuShu.com - 读书·学习·生活
  •  | 繁體版
  • 论坛
  • 畅销
  • 连载
  • 图书
  • 资讯
  • 首页
  • 国学/古籍 | 文学艺术 | 人文社科 | 经济管理 | 生活时尚 | 科学技术 | 教材教辅 | 少儿读物
  •    
  • 图书搜索:
  •  
     全部图书 可读图书 可购图书
     
  • 计算学习理论(会议录) - 书籍详细信息
  • 查看同类图书:科学技术»工业技术»自动化技术、计算技术»计算学习理论(会议录)
  • 计算学习理论(会议录)

  • 【作 者】:Jyrki Kivinen
  • 【又/译名】:Computational learning theory
  • 【丛编项】:
  • 【装帧项】:平装 / 395
  • 【出版项】:湖南文艺出版社 / 2002-12-1
  • 【ISBN号】:9783540438366 / 354043836X
  • 【原书定价】:¥587.60 有2家书店打折销售 
  • 【主题词】:原版书-科普读物
  • 【图书简介】
      在线阅读本书This book constitutes the refereed proceedings of the 15th Annual Conference on Computational Learning Theory, COLT 2002, held in Sydney, Australia, in July 2002.The 26 revised full papers presented were carefully reviewed and selected from 55 submissions. The papers are organized in topical sections on statistical learning theory, online learning, inductive inference, PAC learning, boosting, and other learning paradigms.-读书网|DuShu.com
  • 【本书目录】
    Statistical Learning Theory
    Agnostic Learning Nonconvex Function Classes
    Entropy, Combinatorial Dimensions and Random Averages
    Geometric Parameters of Kernel Machines
    Localized Rademacher Complexities
    Some Local Measures of Complexity of Convex Hulls and Generalization Bounds
    Online Learning
    Path Kernels and Multiplicative Updates
    Predictive Complexity and Information
    Mixability and the Existence of Weak Complexities
    A Second-Order Perceptron Algorithm
    Tracking Linear-Threshold Concepts with Winnow
    Inductive Inference
    Learning Tree Languages from Text
    Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data
    Inferring Deterministic Linear Languages
    Merging Uniform Inductive Learners
    The Speed Prior: A New Simplicity Measure
    PAC Learning
    New Lower Bounds for Statistical Query Learning
    Exploring Learnability between Exact and PAC
    PAC Bounds for Multi-armed Bandit and Markov Decision Processes
    Bounds for the Minimum Disagreement Problem with Applications to Learning Theory
    On the Proper Learning of Axis Parallel Concepts
    Boosting
    A Consistent Strategy for Boosting Algorithms
    The Consistency of Greedy Algorithms for Classification
    Maximizing the Margin with Boosting
    Other Learning Paradigms
    Performance Guarantees for Hierarchical Clustering
    Self-Optimizing and Pareto-Optimal Policies in General Environments Based on Bayes-Mixtures
    Prediction and Dimension
    Invited Talk
    Author Index
  • 【购买本书】
  • 商城名称价格 配送信息优惠活动去看看购买

    卓越网
    ¥93.50
    送货上门:国内308个城市
    邮寄:全球
    特快专递:全球
    海外航空快递
    七周年店庆,全场免费配送 去看看 订购

    当当网
    ¥514.20 当天加急送:北京五环以内
    送货上门:国内178个城市
    邮寄:全球
    特快专递:全球
    特惠商品68折封顶 去看看 订购

    中国图书馆网
    ¥0.4/页起
    邮寄、快递:全国
    特快专递EMS:全球
    提供稀缺绝版图书文献影印服务 去看看 预定
  • 说明:
  • 1、由于网上书店可能根据各种情况随时调整价格,我们的价格信息存在滞后性。以上价格仅作参考,具体以网上书店标示的价格为准。
    2、如价格折扣信息和原书定价存在较大误差,可能是该店售书为本书的不同版本或不同装祯形式,请读者自行鉴别。
    3、对如何网上购书存在疑问,请点击上面购书指南链接查询。
  • Copyright © 读书网 www.dushu.com 2006-2007, All Rights Reserved.
    鄂ICP备06000781号 公安备4201502577