An overtraining-resistant stochastic modeling method for pattern recognition

DOI10.1214/AOS/1032181157MaRDI QIDQ1354427zbMATH OpenOpenAlexWikidataFDO

Authors Eugene M. Kleinberg

Publication date 27 November 1997

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aos/1032181157

zbMATH Keywords

stochastic modeling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• A concrete statistical realization of Kleinberg's stochastic dicrimination for pattern recognition. I: Two-class classification
• scientific article; zbMATH DE number 1759594
• scientific article; zbMATH DE number 3911752
• Pattern Recognition

Cites work

• Boosting a weak learning algorithm by majority
• Nearest neighbor pattern classification
• On the sample complexity of weak learning
• Patterns in pattern recognition: 1968-1974
• Stochastic discrimination
• The table look-up rule

Cited in

(17)

• Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
• A note on multiflows and treewidth
• Approximation algorithms for time-constrained scheduling on line networks
• Finding edge-disjoint paths in networks: an ant colony optimization algorithm
• On the minimum cost multiple-source unsplittable flow problem
• A concrete statistical realization of Kleinberg's stochastic dicrimination for pattern recognition. I: Two-class classification
• Traffic engineering of management flows by link augmentations on confluent trees
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• An exact approach for the maximum concurrent \(k\)-splittable flow problem
• Pruning of error correcting output codes by optimization of accuracy-diversity trade off
• Predictive learning via rule ensembles
• Finding disjoint paths with related path costs
• scientific article; zbMATH DE number 1759594 (Why is no real title available?)
• Fields as Limit Functions of Stochastic Discrimination and Their Adaptability
• LS(graph): a constraint-based local search for constraint optimization on trees and paths
• scientific article; zbMATH DE number 4187136 (Why is no real title available?)
• Maximum \(k\)-splittable \(s, t\)-flows

This page was built for publication: An overtraining-resistant stochastic modeling method for pattern recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354427)