Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revisiting Shinohara's algorithm for computing descriptive patterns |
scientific article |
Statements
Revisiting Shinohara's algorithm for computing descriptive patterns (English)
0 references
5 June 2018
0 references
Descriptive patterns are useful for inductive inferences of pattern languages. In this paper the authors consider a generalized concept of descriptive patterns, namely subclass-descriptive patterns. They characterize those subclasses whose subclass-descriptive patterns (of maximal length) can be computed by a modified version of Shinohara's algorithm.
0 references
pattern languages
0 references
inductive inference
0 references
descriptive patterns
0 references
NP-hard problems
0 references
