Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6850Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Hall, Robert Joseph | - |
| dc.date | 2004-10-20T20:02:23Z | - |
| dc.date | 2004-10-20T20:02:23Z | - |
| dc.date | 1986-05-01 | - |
| dc.date.accessioned | 2013-10-09T02:47:13Z | - |
| dc.date.available | 2013-10-09T02:47:13Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AITR-906 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6850 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Explanation-based Generalization requires that the learner obtain an explanation of why a precedent exemplifies a concept. It is, therefore, useless if the system fails to find this explanation. However, it is not necessary to give up and resort to purely empirical generalization methods. In fact, the system may already know almost everything it needs to explain the precedent. Learning by Failing to Explain is a method which is able to exploit current knowledge to prune complex precedents, isolating the mysterious parts of the precedent. The idea has two parts: the notion of partially analyzing a precedent to get rid of the parts which are already explainable, and the notion of re-analyzing old rules in terms of new ones, so that more general rules are obtained. | - |
| dc.format | 140 p. | - |
| dc.format | 15467251 bytes | - |
| dc.format | 5755509 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AITR-906 | - |
| dc.subject | learning | - |
| dc.subject | explanation | - |
| dc.subject | heuristic parsing | - |
| dc.subject | design | - |
| dc.subject | sgraph grammars | - |
| dc.subject | subgraph isomorphism | - |
| dc.title | Learning by Failing to Explain | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
