Learning pattern classification-a survey
From MaRDI portal
Publication:4701190
DOI10.1109/18.720536zbMath0935.68093OpenAlexW2140643070MaRDI QIDQ4701190
Sanjeev R. Kulkarni, Santosh S. Venkatesh, Gábor Lugosi
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/36b88951b2324877d90e9dedcacc69c1b0b35050
Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (11)
Improving nearest neighbor classification with cam weighted distance ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Rectified nearest feature line segment for pattern classification ⋮ An improved analysis of the Rademacher data-dependent bound using its self bounding property ⋮ A general SLLN for the one-dimensional class cover problem ⋮ A multiview approach for intelligent data analysis based on data operators ⋮ Estimating the Posterior Probabilities Using the K-Nearest Neighbor Rule ⋮ Theory of Classification: a Survey of Some Recent Advances ⋮ Extreme entropy machines: robust information theoretic classification ⋮ Law of large numbers for a two-dimensional class cover problem ⋮ A SLLN for a one-dimensional class cover problem
This page was built for publication: Learning pattern classification-a survey