Case-based Reasoning Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - ". " to ". ") |
||
(20 intermediate revisions by 4 users not shown) | |||
Line 1: | Line 1: | ||
A [[Case-based Reasoning Algorithm]] is a [[Lazy Learning Algorithm]] that ... | A [[Case-based Reasoning Algorithm]] is a [[Lazy Learning Algorithm]] that ... | ||
* <B | * <B>AKA:</B> [[Case-based Reasoning Algorithm|Case-based Reasoning]]. | ||
* <B | * <B>See:</B> [[Nearest Neighbor Algorithm]]. | ||
---- | ---- | ||
---- | ---- | ||
===1997=== | == References == | ||
* ([[1997_MachineLearning|Mitchell, 1997]]) | |||
** | === 1997 === | ||
* ([[1997_MachineLearning|Mitchell, 1997]]) ⇒ [[Tom M. Mitchell]]. ([[1997]]). “[http://www.cs.cmu.edu/~tom/mlbook.html Machine Learning]." McGraw-Hill. | |||
** QUOTE: Section 8.6 Remarks on Lazy and Eager Learning: In this chapter [[we]] considered three ''lazy'' learning methods: the <i>k</i>-Nearest Neighbor algorithm, locally weighted regression, and <B>case-based reasoning</B>. | |||
---- | ---- |
Latest revision as of 17:19, 1 August 2022
A Case-based Reasoning Algorithm is a Lazy Learning Algorithm that ...
- AKA: Case-based Reasoning.
- See: Nearest Neighbor Algorithm.
References
1997
- (Mitchell, 1997) ⇒ Tom M. Mitchell. (1997). “Machine Learning." McGraw-Hill.
- QUOTE: Section 8.6 Remarks on Lazy and Eager Learning: In this chapter we considered three lazy learning methods: the k-Nearest Neighbor algorithm, locally weighted regression, and case-based reasoning.