Learning pattern classification-a survey
From MaRDI portal
Publication:4701190
DOI10.1109/18.720536zbMath0935.68093MaRDI 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
62F15: Bayesian inference
68T05: Learning and adaptive systems in artificial intelligence
68T10: Pattern recognition, speech recognition
Related Items
Estimating the Posterior Probabilities Using the K-Nearest Neighbor Rule, Law of large numbers for a two-dimensional class cover problem, GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING, An improved analysis of the Rademacher data-dependent bound using its self bounding property, Rectified nearest feature line segment for pattern classification, A general SLLN for the one-dimensional class cover problem, A SLLN for a one-dimensional class cover problem, Extreme entropy machines: robust information theoretic classification, Improving nearest neighbor classification with cam weighted distance, A multiview approach for intelligent data analysis based on data operators, Theory of Classification: a Survey of Some Recent Advances
