Cantitate/Preț
Produs

Lazy Learning

Editat de David W. Aha
en Limba Engleză Hardback – 31 mai 1997
This edited collection describes recent progress on lazy learning, a branch of machine learning concerning algorithms that defer the processing of their inputs, reply to information requests by combining stored data, and typically discard constructed replies. It is the first edited volume in AI on this topic, whose many synonyms include `instance-based', `memory-based'. `exemplar-based', and `local learning', and whose topic intersects case-based reasoning and edited k-nearest neighbor classifiers. It is intended for AI researchers and students interested in pursuing recent progress in this branch of machine learning, but, due to the breadth of its contributions, it should also interest researchers and practitioners of data mining, case-based reasoning, statistics, and pattern recognition.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 95482 lei  6-8 săpt.
  SPRINGER NETHERLANDS – dec 2010 95482 lei  6-8 săpt.
Hardback (1) 96119 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 31 mai 1997 96119 lei  6-8 săpt.

Preț: 96119 lei

Preț vechi: 120149 lei
-20% Nou

Puncte Express: 1442

Preț estimativ în valută:
17008 19971$ 14929£

Carte tipărită la comandă

Livrare economică 27 ianuarie-10 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792345848
ISBN-10: 0792345843
Pagini: 424
Ilustrații: IV, 424 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.78 kg
Ediția:Reprinted from ARTIFICIAL INTELLIGENCE REVIEW, 11:1-5, 1997
Editura: SPRINGER NETHERLANDS
Colecția Springer
Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

Editorial.- Locally Weighted Learning.- Locally Weighted Learning for Control.- Voting over Multiple Condensed Nearest Neighbors.- Tolerating Concept and Sampling Shift in Lazy Learning Using Prediction Error Context Switching.- Discretisation in Lazy Learning Algorithms.- Intelligent Selection of Instances for Prediction Functions in Lazy Learning Algorithms.- The Racing Algorithm: Model Selection for Lazy Learners.- Context-Sensitive Feature Selection for Lazy Learners.- Computing Optimal Attribute Weight Settings for Nearest Neighbor Algorithms.- A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms.- Lazy Acquisition of Place Knowledge.- A Teaching Strategy for Memory-Based Control.- Lazy Incremental Learning of Control Knowledge for Efficiently Obtaining Quality Plans.- IGTree: Using Trees for Compression and Classification in Lazy Learning Algorithms.