Effects of domain characteristics on instance-based learning algorithms.

DOI10.1016/S0304-3975(02)00424-3MaRDI QIDQ1874236zbMATH OpenFDO

Authors Seishi Okamoto, Nobuhiro Yugami

Publication date 22 May 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00424-3

zbMATH Keywords

\(k\)-nearest neighbor classifieraverage-case analysisexpected accuracyinstance-based learningoptimal value of \(k\)

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Reduction techniques for instance-based learning algorithms
• Advances in instance selection for instance-based learning algorithms
• scientific article; zbMATH DE number 139770
• Open problems in geometric methods for instance-based learning
• Average-case analysis of classification algorithms for Boolean functions and decision trees

Cites work

• A Note on Distance-Weighted k-Nearest Neighbor Rules
• A theory of the learnable
• Computational limitations on learning from examples
• Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
• Estimation by the nearest neighbor rule
• scientific article; zbMATH DE number 4166882 (Why is no real title available?)
• scientific article; zbMATH DE number 67797 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• Nearest neighbor pattern classification

Cited in

(2)

• Reduction techniques for instance-based learning algorithms
• scientific article; zbMATH DE number 139770 (Why is no real title available?)

This page was built for publication: Effects of domain characteristics on instance-based learning algorithms.

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