Reducing the computational cost of computing approximated median strings
From MaRDI portal
Recommendations
- Median strings for k-nearest neighbour classification
- Topology of strings: median string is NP-complete
- Complexities of the centre and median string problems
- New approach to searching for string median and visualization of string clusters
- Efficient prototype reordering in nearest neighbor classification
Cited in
(2)
This page was built for publication: Reducing the computational cost of computing approximated median strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808925)