An overtraining-resistant stochastic modeling method for pattern recognition
From MaRDI portal
Publication:1354427
DOI10.1214/aos/1032181157zbMath0877.68102OpenAlexW2078963943WikidataQ56502472 ScholiaQ56502472MaRDI QIDQ1354427
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
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (15)
A note on multiflows and treewidth ⋮ Fields as Limit Functions of Stochastic Discrimination and Their Adaptability ⋮ A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ Finding disjoint paths with related path costs ⋮ Pruning of error correcting output codes by optimization of accuracy-diversity trade off ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ Maximum \(k\)-splittable \(s, t\)-flows ⋮ An exact approach for the maximum concurrent \(k\)-splittable flow problem ⋮ A concrete statistical realization of Kleinberg's stochastic dicrimination for pattern recognition. I: Two-class classification ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ On the minimum cost multiple-source unsplittable flow problem ⋮ Finding edge-disjoint paths in networks: an ant colony optimization algorithm ⋮ Traffic engineering of management flows by link augmentations on confluent trees ⋮ Predictive learning via rule ensembles ⋮ Approximation algorithms for time-constrained scheduling on line networks
Cites Work
This page was built for publication: An overtraining-resistant stochastic modeling method for pattern recognition
