Median strings for k-nearest neighbour classification

DOI10.1016/S0167-8655(02)00209-XzbMath1053.68086OpenAlexW2076223365MaRDI QIDQ4421040

No author found.

Publication date: 19 August 2003

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8655(02)00209-x

zbMATH Keywords

Clustering\(k\)-NN classifiersMedian stringPrototype extraction

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (5)

Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton ⋮ Computing the Expected Edit Distance from a String to a PFA ⋮ Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings

This page was built for publication: Median strings for k-nearest neighbour classification