On the complexity of induction of structural descriptions (Q1100927)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of induction of structural descriptions |
scientific article; zbMATH DE number 4045210
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of induction of structural descriptions |
scientific article; zbMATH DE number 4045210 |
Statements
On the complexity of induction of structural descriptions (English)
0 references
1987
0 references
Inductive learning is an important subject in artificial intelligence. As a concern of theoretical computer science, this paper investigates the complexity of induction of structural descriptions which is fundamental to inductive learning. The general complexity is derived, and a way of approaching the induction, namely, computing the maximal common generalizations by pairing, is also presented with its inherent complexity. A group of NP-complete and NP-hard problems are introduced when showing the complexities.
0 references
structural descriptions
0 references
inductive learning
0 references
complexity
0 references
NP-complete
0 references
NP- hard
0 references
