New approach to searching for string median and visualization of string clusters

MaRDI QIDQ5110049zbMATH OpenFDO

Authors Evgeniĭ Petrovich Ofitserov, Dmitry Gorbachev

Publication date 15 May 2020

Full work available at URL http://mathnet.ru/eng/cheb755

zbMATH Keywords

\(k\)-meansgradient descentLevenshtein edit distancesmooth minimumstring cluster visualizationstring median

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1446756
• Median strings for k-nearest neighbour classification
• Hardness results for the center and median string problems under the weighted and unweighted edit distances
• Complexities of the centre and median string problems
• Topology of strings: median string is NP-complete

Cited in

(7)

• Hardness results for the center and median string problems under the weighted and unweighted edit distances
• Complexities of the centre and median string problems
• Median strings for k-nearest neighbour classification
• scientific article; zbMATH DE number 2043369 (Why is no real title available?)
• scientific article; zbMATH DE number 2090197 (Why is no real title available?)
• scientific article; zbMATH DE number 1446756 (Why is no real title available?)
• Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain

This page was built for publication: New approach to searching for string median and visualization of string clusters

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