Open problems in geometric methods for instance-based learning

DOI10.1007/B11261MaRDI QIDQ5897111zbMATH OpenOpenAlexFDO

Authors Godfried Toussaint

Publication date 5 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11261

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• Advances in instance selection for instance-based learning algorithms
• Lectures on the nearest neighbor method
• Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule
• Some methods of replacing the nearest neighbor method

Cited in

(9)

• A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them
• A geometric approach to leveraging weak learners
• Effects of domain characteristics on instance-based learning algorithms.
• Guarantees on nearest-neighbor condensation heuristics
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• Witness (Delaunay) graphs
• Geometric problems in machine learning
• Refined lower bounds for nearest neighbor condensation
• Locally linear reconstruction for instance-based learning

This page was built for publication: Open problems in geometric methods for instance-based learning

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