Lazy Learning Meets the Recursive Least Squares Algorithm

@inproceedings{Birattari1998LazyLM,
  title={Lazy Learning Meets the Recursive Least Squares Algorithm},
  author={Mauro Birattari and Gianluca Bontempi and Hugues Bersini},
  booktitle={NIPS},
  year={1998}
}
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered relevant according to a distance measure. In this paper we propose a data-driven method to select on a query-by-query basis the optimal number of neighbors to be considered for each prediction. As an efficient way to identify and validate local models, the recursive least squares algorithm is introduced in the context of… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
49 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 49 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Factorization Methodsfor Discrete Sequential Estimation

  • G. Bierman
  • 1977
Highly Influential
4 Excerpts

Editorial

  • D. W.Aha
  • Artificial Intelligence Review, 11(1-5), 1-6…
  • 1997

Combining instancebased and model - based learning

  • S. Schaal, G. AtkesonC.
  • Pages 236 – 243 of : Machine Learning
  • 1993

Similar Papers

Loading similar papers…