Learning by recording cases: Difference between revisions

From Computer Science Wiki
(Created page with "right|frame|Artificial Intelligence<ref>http://www.flaticon.com/</ref> == learning by recording cases == In learning by recording cases, we take the closest...")
 
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
[[file:AI.png|right|frame|Artificial Intelligence<ref>http://www.flaticon.com/</ref>]]
[[file:AI.png|right|frame|Artificial Intelligence<ref>http://www.flaticon.com/</ref>]]
In the context of artificial intelligence, Learning by recording cases has to do with memory. We cannot have intelligence if we do not have memory.


== learning by recording cases ==
== learning by recording cases ==


In learning by recording cases, we take the closest case to the new problem and apply its solution.  
Given a problem retrieve the most similar prior problem from memory.


== Nearest neighbor method ==
== Nearest neighbor method ==
Line 9: Line 11:
Given a new problem, I am going to look for a similar problem. This is the essence of the nearest neighbor problem. We look for "the most similar".  
Given a new problem, I am going to look for a similar problem. This is the essence of the nearest neighbor problem. We look for "the most similar".  


== K nearest neighbor method ==
== Applying K neighbor in the real world ==


<references />
<references />

Latest revision as of 06:55, 17 February 2018

Artificial Intelligence[1]

In the context of artificial intelligence, Learning by recording cases has to do with memory. We cannot have intelligence if we do not have memory.

learning by recording cases[edit]

Given a problem retrieve the most similar prior problem from memory.

Nearest neighbor method[edit]

Given a new problem, I am going to look for a similar problem. This is the essence of the nearest neighbor problem. We look for "the most similar".