rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Algorithmic Learning Theory
    sub title: 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings
  name:
    name part: Gavaldà, Ricard.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Jantke, Klaus P.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Takimoto, Eiji.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2003
    edition: 1st ed. 2003.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 320 p. online resource.
  table of contents: Invited Papers -- Abduction and the Dualization Problem -- Signal Extraction and Knowledge Discovery Based on Statistical Modeling -- Association Computation for Information Access -- Efficient Data Representations That Preserve Information -- Can Learning in the Limit Be Done Efficiently? -- Inductive Inference -- Intrinsic Complexity of Uniform Learning -- On Ordinal VC-Dimension and Some Notions of Complexity -- Learning of Erasing Primitive Formal Systems from Positive Examples -- Changing the Inference Type - Keeping the Hypothesis Space -- Learning and Information Extraction -- Robust Inference of Relevant Attributes -- Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables -- Learning with Queries -- On the Learnability of Erasing Pattern Languages in the Query Model -- Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries -- Learning with Non-linear Optimization -- Kernel Trick Embedded Gaussian Mixture Model -- Efficiently Learning the Metric with Side-Information -- Learning Continuous Latent Variable Models with Bregman Divergences -- A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation -- Learning from Random Examples -- On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays -- Learning a Subclass of Regular Patterns in Polynomial Time -- Identification with Probability One of Stochastic Deterministic Linear Languages -- Online Prediction -- Criterion of Calibration for Transductive Confidence Machine with Limited Feedback -- Well-Calibrated Predictions from Online Compression Models -- Transductive Confidence Machine Is Universal -- On the Existence and Convergence of Computable Universal Priors.
  note: edited by Ricard Gavaldà, Klaus P. Jantke, Eiji Takimoto.
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Mathematical logic
  subject:
    topic: Natural language processing (Computer science)
  subject:
    topic: Artificial Intelligence
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Natural Language Processing (NLP)
  classification: Q334-342
  classification: 006.3
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Artificial Intelligence ; 2842
  identifier: 9783540396246
  identifier: https://doi.org/10.1007/b14273
  record info:
    record creation date: 121227
    record change date: 20191022112510.0
    record identifier: 978-3-540-39624-6