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

zbMATH Open1434.68733MaRDI QIDQ5110049FDOQ5110049

Authors: Evgeniĭ Petrovich Ofitserov, Dmitry Gorbachev 

Publication date: 15 May 2020

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

Recommendations

• Publication:4953912
• 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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Hardness results for the center and median string problems under the weighted and unweighted edit distances
• 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
• Median strings for k-nearest neighbour classification

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)