Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407): Difference between revisions

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.