An algorithmic theory of learning: Robust concepts and random projection (Q2499543): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10994-006-6265-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic theory of learning: Robust concepts and random projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning a union of half spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for learning noisy linear threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of propositional STRIPS planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support-vector networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson-Lindenstrauss lemma and the sphericity of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large margin classification using the perceptron algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distribution-free learning of probabilistic concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting the margin: a new explanation for the effectiveness of voting methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neuroidal architecture for cognitive computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821981 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10994-006-6265-7 / rank
 
Normal rank

Latest revision as of 05:25, 10 December 2024

scientific article
Language Label Description Also known as
English
An algorithmic theory of learning: Robust concepts and random projection
scientific article

    Statements

    An algorithmic theory of learning: Robust concepts and random projection (English)
    0 references
    0 references
    0 references
    14 August 2006
    0 references
    Learning
    0 references
    Cognition
    0 references
    Random projection
    0 references
    Robust concepts
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers