GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630)

scientific article; zbMATH DE number 2197710

Language	Label	Description	Also known as
English	GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING	scientific article; zbMATH DE number 2197710

Statements

instance of

scholarly article

0 references

title

GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (English)

0 references

author

Godfried T. Toussaint

0 references

published in

International Journal of Computational Geometry & Applications

0 references

publication date

23 August 2005

0 references

zbMATH Keywords

Instance-based learning

0 references

proximity graphs

0 references

nearest-neighbor methods

0 references

data mining

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Lower bounds for computing statistical depth.

0 references

Accounting for boundary effects in nearest-neighbor searching

0 references

Breast cancer detection using rank nearest neighbor classification rules

0 references

A Note on Distance-Weighted k-Nearest Neighbor Rules

0 references

Combined compression and classification with learning vector quantization

0 references

Sphere-of-influence graphs using the sup-norm

0 references

Advances in instance selection for instance-based learning algorithms

0 references

Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection

0 references

Finding Prototypes For Nearest Neighbor Classifiers

0 references

On neural-network implementations of k-nearest neighbor pattern classifiers

0 references

Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition

0 references

The Best Two Independent Measurements Are Not the Two Best

0 references

On the Possible Orderings in the Measurement Selection Problem

0 references

Nearest neighbor pattern classification

0 references

A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them

0 references

Machine learning from examples: Inductive and Lazy methods

0 references

An incremental prototype set building technique

0 references

On a New Class of Bounds on Bayes Risk in Multihypothesis Pattern Recognition

0 references

On the Inequality of Cover and Hart in Nearest Neighbor Discrimination

0 references

The expected size of some graphs in computational geometry

0 references

The expected size of the sphere-of-influence graph

0 references

Higher-dimensional Voronoi diagrams in linear expected time

0 references

An Algorithm for Finding Nearest Neighbors

0 references

An Algorithm for Finding Best Matches in Logarithmic Expected Time

0 references

Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests

0 references

k-nearest-neighbor Bayes-risk estimation

0 references

On a nearest-neighbor problem under Minkowski and power metrics for large data sets

0 references

Additive estimators for probabilities of correct classification

0 references

The complexity of finding minimal Voronoi covers with applications to machine learning

0 references

The Nearest Neighbor Classification Rule with a Reject Option

0 references

Probability of error, equivocation, and the Chernoff bound

0 references

Design of an optimal nearest neighbor classifier using an intelligent genetic algorithm

0 references

Prototype optimization for nearest-neighbor classification

0 references

The 1972 Wald Lecture Robust Statistics: A Review

0 references

The relative neighborhood graph for mixed feature variables

0 references

Bootstrap Techniques for Error Estimation

0 references

Learning pattern classification-a survey

0 references

Learning good prototypes for classification using filtering and abstraction of instances

0 references

Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition

0 references

Likelihood-based data squashing: A modeling approach to instance construction

0 references

Median strings for k-nearest neighbour classification

0 references

On the notion of affinity of several distributions and some of its applications

0 references

Sphere of influence graphs in general metric spaces

0 references

A modification of the LAESA algorithm for approximated k-NN classification

0 references

Automated design of multiple-class piecewise linear classifiers

0 references

Another Look at the Edited Nearest Neighbor Rule

0 references

Efficient exemplars for classifier design

0 references

On the distribution of the domination number for random class cover catch digraphs

0 references

On the finite sample performance of the nearest neighbor classifier

0 references

Fast algorithms for computing \(\beta\)-skeletons and their relatives.

0 references

A unifying view on instance selection

0 references

An algorithm for a selective nearest neighbor decision rule (Corresp.)

0 references

Improving the k-NCN classification rule through heuristic modifications

0 references

Bootstrapping for efficient handwritten digit recognition

0 references

Ten More Years of Error Rate Research

0 references

A hybrid filter/wrapper approach of feature selection using information theory

0 references

The optimal distance measure for nearest neighbor classification

0 references

Locally Trained Piecewise Linear Classifiers

0 references

Optimal rates of convergence for nonparametric estimators

0 references

On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces

0 references

A Generalization of the k-NN Rule

0 references

Two Modifications of CNN

0 references

Some Functional Lower Bounds on the Expected Divergence for Multihypothesis Pattern Recognition, Communication, and Radar Systems

0 references

Feature evaluation with quadratic mutual information

0 references

Bibliography on estimation of misclassification

0 references

Some properties of Matusita's measure of affinity of several distributions

0 references

Sharper lower bounds for discrimination information in terms of variation (Corresp.)

0 references

A Generalization of Shannon's Equivocation and the Fano Bound

0 references

Probability of Error, Expected Divergence, and the Affinity of Several Distributions

0 references

The relative neighbourhood graph of a finite planar set

0 references

A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule

0 references

On a constant-time, low-complexity winner-take-all neural network

0 references

Graph theoretical clustering based on limited neighbourhood sets

0 references

Convergence of the edited nearest neighbor (Corresp.)

0 references

Asymptotic Properties of Nearest Neighbor Rules Using Edited Data

0 references

Reduction techniques for instance-based learning algorithms

0 references

Improved \(k\)-nearest neighbor classification

0 references

Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

0 references

Optimal reference subset selection for nearest neighbor classification by tabu search

0 references

Identifiers

zbMATH Open document ID

1067.68166

0 references

DOI

10.1142/S0218195905001622

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5311630