⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 http:^^www.cs.utexas.edu^users^ml^foidl.html

📁 This data set contains WWW-pages collected from computer science departments of various universities
💻 HTML
字号:
MIME-Version: 1.0
Server: CERN/3.0
Date: Tuesday, 07-Jan-97 15:55:44 GMT
Content-Type: text/html
Content-Length: 1907
Last-Modified: Monday, 11-Dec-95 16:46:35 GMT

<title>The FOIDL Inductive Logic Programming System </title><h1>FOIDL</h1> <br> FOIDL is an ILP system for learning first-order decision lists(ordered lists of clauses each ending in a cut).  It has been used toobtain the current best results on learning the past-tense ofEnglish. <p>Both Common Lisp and Prolog code for FOIDL is available via <!WA0><!WA0><a href="ftp://ftp.cs.utexas.edu/pub/mooney/foidl">anonymous ftp</a>.See the README files here for details.Pointers to papers on FOIDL can be found on our <!WA1><!WA1><ahref="http://www.cs.utexas.edu/users/ml/ilp.html">ILP</a> research page.  Below is the standardreference (click on the open book image). <p><! ===========================================================================><a name="foidl-jair-95.ps.Z"</a><b><li>Induction of First-Order Decision Lists: Results on Learning the Past Tense of English Verbs<br></b>Raymond J. Mooney and Mary Elaine Califf <br><cite>Journal of Artificial Intelligence Research</cite>, 3 (1995) pp. 1-24.<blockquote>This paper presents a method for inducing logic programs from examples thatlearns a new class of concepts called first-order decision lists, definedas ordered lists of clauses each ending in a cut.  The method, called FOIDL, is based on FOIL but employs intensional background knowledge and avoids the need for explicit negative examples.  It is particularly useful for problems that involve rules with specific exceptions, such as learning the past-tense of English verbs, a task widely studied in the context of the symbolic/connectionist debate.  FOIDL is able to learn concise, accurate programs for this problem from significantly fewer examples than previous methods (both connectionist and symbolic).</blockquote><!WA2><!WA2><a href="file://ftp.cs.utexas.edu/pub/mooney/papers/foidl-jair-95.ps.Z"><!WA3><!WA3><img align=top src="http://www.cs.utexas.edu/users/ml/paper.xbm"></a><p><hr><address><!WA4><!WA4><a href="http://www.cs.utexas.edu/users/estlin/">estlin@cs.utexas.edu</a></address>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -