Bielefeld Pub
metadata only
Theoretical Framework for Distance Metrics in k-Nearest Neighbor Imputation
Kochs T, Castellani A, Hammer B. Theoretical Framework for Distance Metrics in k-Nearest Neighbor Imputation. In: Pasa L, Lintas A, Tetko IV, et al., eds. Artificial Neural Networks and Machine Learning – ICANN 2026. 35th International Conference on Artificial Neural Networks, Padua, Italy, Sept
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Draining Fictitious Knots: Restoring Distance-Awareness Guarantees for High-Dimensional Spline Networks#1109311
- A weighted angle distance on strings#124061
- Complete Suffix Prediction for Recommendation via Latent Retrieval over Process Graphs#1109667
- The best approximation pair problem relative to two subsets in a normed space#984018
- On the Hamming distance properties of group codes#490073
Record · ID 965627
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive