Effects of domain characteristics on instance-based learning algorithms.

DOI10.1016/S0304-3975(02)00424-3zbMath1038.68058MaRDI QIDQ1874236

Seishi Okamoto, Nobuhiro Yugami

Publication date: 22 May 2003

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

zbMATH Keywords

average-case analysisinstance-based learning\(k\)-nearest neighbor classifierexpected accuracyoptimal value of \(k\)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
• A theory of the learnable
• Computational limitations on learning from examples
• A Note on Distance-Weighted k-Nearest Neighbor Rules
• Nearest neighbor pattern classification
• Estimation by the nearest neighbor rule

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