| 作成者 |
|
|
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
rifis-tr-63