Incremental concept learning: Difference between revisions
Mr. MacKenty (talk | contribs) No edit summary |
Mr. MacKenty (talk | contribs) No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 5: | Line 5: | ||
One of the ideas we are exploring here is how to learn on a case-by-case basis. We don't have a large corpus of known-examples to draw inference from. This style of learning is supervised, that is, there is a teacher saying something is a "positive" example of an object or something is a "negative" example of an object. We then either generalize or specialize. | One of the ideas we are exploring here is how to learn on a case-by-case basis. We don't have a large corpus of known-examples to draw inference from. This style of learning is supervised, that is, there is a teacher saying something is a "positive" example of an object or something is a "negative" example of an object. We then either generalize or specialize. | ||
Each time we have another object to analyze, we revise our understanding, either generalizing or specializing. We do this via heuristics for specializing and generalizing: | |||
{| class="wikitable" | |||
|- | |||
! Heuristic !! Description | |||
|- | |||
| require-link || link must be present to be a positive example of the concept | |||
|- | |||
| forbid-link || link must be absent to be a positive example of the concept | |||
|- | |||
| drop-link || link is not necessary to be a positive example of the concept | |||
|- | |||
| enlarge set || multiple objects or links may fit one role in the concept | |||
|- | |||
| climb-tree || generalize over multiple objects in the same role based knowledge | |||
|- | |||
| close interval || expand range of values to be a positive example of the concept | |||
|} | |||
== References == | == References == | ||
<references /> | <references /> | ||
Latest revision as of 19:25, 17 February 2018
In computer science, incremental learning is a method of machine learning, in which input data is continuously used to extend the existing model's knowledge i.e. to further train the model. It represents a dynamic technique of supervised learning and unsupervised learning that can be applied when training data becomes available gradually over time or its size is out of system memory limits. Algorithms that can facilitate incremental learning are known as incremental machine learning algorithms.[2]
One of the ideas we are exploring here is how to learn on a case-by-case basis. We don't have a large corpus of known-examples to draw inference from. This style of learning is supervised, that is, there is a teacher saying something is a "positive" example of an object or something is a "negative" example of an object. We then either generalize or specialize.
Each time we have another object to analyze, we revise our understanding, either generalizing or specializing. We do this via heuristics for specializing and generalizing:
| Heuristic | Description |
|---|---|
| require-link | link must be present to be a positive example of the concept |
| forbid-link | link must be absent to be a positive example of the concept |
| drop-link | link is not necessary to be a positive example of the concept |
| enlarge set | multiple objects or links may fit one role in the concept |
| climb-tree | generalize over multiple objects in the same role based knowledge |
| close interval | expand range of values to be a positive example of the concept |