On learning unions of pattern languages and tree patterns in the mistake bound model. (Q1853515): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal mind change complexity of language identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding patterns common to a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of formal languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4202913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agnostic learning of geometric patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4703452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary formal systems, intrinsic complexity, and procrastination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3335016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three \(\sum^ P_ 2\)-complete problems in computational learning theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of arbitrary pattern languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4703873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction-preserving reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting best consensus motifs from positive and negative examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ignoring data may be the only way to learn efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time / rank
 
Normal rank

Latest revision as of 11:27, 5 June 2024

scientific article
Language Label Description Also known as
English
On learning unions of pattern languages and tree patterns in the mistake bound model.
scientific article

    Statements

    On learning unions of pattern languages and tree patterns in the mistake bound model. (English)
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    Pattern languages
    0 references
    Tree patterns
    0 references
    Mistake bound learning model
    0 references
    On-line learning
    0 references