Median strings for k-nearest neighbour classification

DOI10.1016/S0167-8655(02)00209-XzbMATH Open1053.68086OpenAlexW2076223365MaRDI QIDQ4421040FDOQ4421040

Authors:

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

Recommendations

• scientific article; zbMATH DE number 2090197
• New approach to searching for string median and visualization of string clusters
• Complexities of the centre and median string problems
• Publication:4953912
• Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain

zbMATH Keywords

Clustering\(k\)-NN classifiersMedian stringPrototype extraction

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited In (10)

• Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings
• Computing the expected edit distance from a string to a probabilistic finite-state automaton
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
• Complexities of the centre and median string problems
• Computing the expected edit distance from a string to a PFA
• Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification
• New approach to searching for string median and visualization of string clusters
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING

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

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