Incremental concept learning for bounded data mining.
type: Item
instance of: scholarly article
title: Incremental concept learning for bounded data mining.
zbMATH Open document ID: 1045.68572
author: John Case
author: Sanjay Jain
author: S. Lange
author: Thomas Zeugmann
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
full work available at URL: http://hdl.handle.net/2324/3005
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1853054
zbMATH Keywords: learning machine
MaRDI profile type: Publication
OpenAlex ID: W2002286886
cites work: Finding patterns common to a set of strings
cites work: Inductive inference of formal languages from positive data
cites work: Learning elementary formal systems
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Toward a mathematical theory of inductive inference
cites work: Periodicity in generations of automata
cites work: Infinitary self-reference in learning theory
cites work: The Power of Vacillation in Language Learning
cites work: Comparison of identification criteria for machine inductive inference
cites work: Q3787511
cites work: On the role of procrastination in machine learning
cites work: Language identification in the limit
cites work: Q5592246
cites work: Q4470564
cites work: Inclusion is undecidable for pattern languages
cites work: A class of prolog programs inferable from positive data
cites work: Polynomial-time inference of arbitrary pattern languages
cites work: LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
cites work: Q4202923
cites work: Incremental learning from positive data
cites work: Set-driven and rearrangement-independent learning of recursive languages
cites work: Q5573961
cites work: Q4763513
cites work: Q3664455
cites work: Inductive inference of monotonic formal systems from positive data
cites work: Inductive inference of unbounded unions of pattern languages from positive data
cites work: Theory of Formal Systems. (AM-47)
cites work: Q4115138
cites work: Ignoring data may be the only way to learn efficiently
cites work: Q4013550
cites work: Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
cites work: Characterizations of monotonic and dual monotonic language learning
DOI: 10.1006/INCO.1998.2784
description: scientific article; zbMATH DE number 1853054