On the Necessity of Special Mechanisms for Handling Types in Inductive Logic Programmintg

スポンサーリンク

概要

• 論文の詳細を見る

• This paper demonstrates the necessity of special handling mechanisms for type (or sort) information when learning logic programs on the basis of background knowledge that includes type hierarchy. We have developed a novel relational learner RHB, which incorporates special operations to handle the computing of the least general generalization (lgg) of examples and the code length of logic programs with types. It is possible for previous learners, such as FOIL, GOLEM and Progol, to generate logic programs that include type information represented as is_a relations. However, this expedient has two problems: one in the computation of the code length and the other in the performance. We will illustrate that simply adding is_a relations to background knowledge as ordinary literals causes a problem in computing the code length of logic programs with is_a literals. Experimental results on artificial data show that the learning speed of FOIL exponentially slows as the number of types in the background knowledge increases. The hypotheses generated by GOLEM are about 30% less accurate than those of RHB. Furthermore, Progol is two times slower than RHB. Compared to the three learners, RHB can efficiently handle about 3000 is_a relations while still achieving a high accuracy. This indicates that type information should be specially handled when learning logic programs with types.

• 社団法人電子情報通信学会の論文
• 1999-10-25

著者

• Sasaki Yutaka

  Ntt Communication Science Laboratories

関連論文

• Question Answering as Abduction : A Feasibility Study at NTCIR QAC1(Special Issue on Text Processing for Information Access)
• SVM-Based Multi-Document Summarization Integrating Sentence Extraction with Bunsetsu Elimination(Special Issue on Text Processing for Information Access)
• On the Necessity of Special Mechanisms for Handling Types in Inductive Logic Programmintg

スポンサーリンク