GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
From MaRDI portal
Recommendations
Cites work
- A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them
- A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule
- A Generalization of Shannon's Equivocation and the Fano Bound
- A Generalization of the k-NN Rule
- A hybrid filter/wrapper approach of feature selection using information theory
- A modification of the LAESA algorithm for approximated k-NN classification
- A Note on Distance-Weighted k-Nearest Neighbor Rules
- A unifying view on instance selection
- Accounting for boundary effects in nearest-neighbor searching
- Additive estimators for probabilities of correct classification
- Advances in instance selection for instance-based learning algorithms
- An algorithm for a selective nearest neighbor decision rule (Corresp.)
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- An Algorithm for Finding Nearest Neighbors
- An incremental prototype set building technique
- Another Look at the Edited Nearest Neighbor Rule
- Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
- Automated design of multiple-class piecewise linear classifiers
- Bibliography on estimation of misclassification
- Bootstrap Techniques for Error Estimation
- Bootstrapping for efficient handwritten digit recognition
- Breast cancer detection using rank nearest neighbor classification rules
- Combined compression and classification with learning vector quantization
- Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection
- Convergence of the edited nearest neighbor (Corresp.)
- Design of an optimal nearest neighbor classifier using an intelligent genetic algorithm
- Efficient exemplars for classifier design
- Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition
- Fast algorithms for computing -skeletons and their relatives.
- Feature evaluation with quadratic mutual information
- Finding Prototypes For Nearest Neighbor Classifiers
- Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
- Graph theoretical clustering based on limited neighbourhood sets
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Higher-dimensional Voronoi diagrams in linear expected time
- Improved \(k\)-nearest neighbor classification
- Improving the k-NCN classification rule through heuristic modifications
- k-nearest-neighbor Bayes-risk estimation
- Learning good prototypes for classification using filtering and abstraction of instances
- Learning pattern classification-a survey
- Likelihood-based data squashing: A modeling approach to instance construction
- Locally Trained Piecewise Linear Classifiers
- Lower bounds for computing statistical depth.
- Machine learning from examples: Inductive and Lazy methods
- Median strings for k-nearest neighbour classification
- Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
- Nearest neighbor pattern classification
- On a constant-time, low-complexity winner-take-all neural network
- On a nearest-neighbor problem under Minkowski and power metrics for large data sets
- On a New Class of Bounds on Bayes Risk in Multihypothesis Pattern Recognition
- On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
- On neural-network implementations of k-nearest neighbor pattern classifiers
- On the distribution of the domination number for random class cover catch digraphs
- On the finite sample performance of the nearest neighbor classifier
- On the Inequality of Cover and Hart in Nearest Neighbor Discrimination
- On the notion of affinity of several distributions and some of its applications
- On the Possible Orderings in the Measurement Selection Problem
- Optimal rates of convergence for nonparametric estimators
- Optimal reference subset selection for nearest neighbor classification by tabu search
- Probability of error, equivocation, and the Chernoff bound
- Probability of Error, Expected Divergence, and the Affinity of Several Distributions
- Prototype optimization for nearest-neighbor classification
- Reduction techniques for instance-based learning algorithms
- Sharper lower bounds for discrimination information in terms of variation (Corresp.)
- Some Functional Lower Bounds on the Expected Divergence for Multihypothesis Pattern Recognition, Communication, and Radar Systems
- Some properties of Matusita's measure of affinity of several distributions
- Sphere of influence graphs in general metric spaces
- Sphere-of-influence graphs using the sup-norm
- Ten More Years of Error Rate Research
- The 1972 Wald Lecture Robust Statistics: A Review
- The Best Two Independent Measurements Are Not the Two Best
- The complexity of finding minimal Voronoi covers with applications to machine learning
- The expected size of some graphs in computational geometry
- The expected size of the sphere-of-influence graph
- The Nearest Neighbor Classification Rule with a Reject Option
- The optimal distance measure for nearest neighbor classification
- The relative neighborhood graph for mixed feature variables
- The relative neighbourhood graph of a finite planar set
- Two Modifications of CNN
Cited in
(11)- Facility location problems in the plane based on reverse nearest neighbor queries
- A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them
- Edge integrity of nearest neighbor graphs and separator theorems
- Explicit laws of large numbers for random nearest-neighbour-type graphs
- Witness Gabriel graphs
- scientific article; zbMATH DE number 1163855 (Why is no real title available?)
- Neighborhood random classification
- Open problems in geometric methods for instance-based learning
- Upper large deviations for power-weighted edge lengths in spatial random networks
- On crossing numbers of geometric proximity graphs
- Computational geometric aspects of rhythm, melody, and voice-leading
This page was built for publication: GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311630)
