<テクニカルレポート>
A Generalization of the Least General Generalization

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 In this paper, we describe a polynomial time algorithm, called a k-minimal multiple generalization (k-mmg) algorithm, where $ k gep 1$, and its application to inductive learning problems. The algorith...m is a natural extension of the least general generalization algorithm developed by Plotkin. Given a finite set of gound terms, the k-mmg algorithm generalizes the examples by at most k terms, while Plotkin's algorithm does by a single term. We apply this algorithm to problems in inductive logic programming. We also show that this method is applicable to a problem of knowledge discovery in databases.続きを見る

本文情報を非表示

rifis-tr-63 pdf 1.35 MB 95  

詳細

レコードID
査読有無
関連情報
注記
タイプ
登録日 2009.04.22
更新日 2017.01.20