Use of Median String for Classification

@inproceedings{MartnezHinarejos2000UseOM,
  title={Use of Median String for Classification},
  author={Carlos D. Mart{\'i}nez-Hinarejos and Alfons Juan-C{\'i}scar and Francisco Casacuberta},
  booktitle={ICPR},
  year={2000}
}
A string that minimizes the sum of distances to the strings of a given set is known as (generalized) median string of the set. This concept is important in Pattern Recognition for modelling a (large) set of garbled strings or patterns. The search of such a string is an NP-Hard problem and, therefore, no efficient algorithms to compute the median strings can be designed. Recently a greedy approach was proposed to compute an approximate median string of a set of strings. In this work an algorithm… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

A greedy algorithm for computing approximate median strings

  • F. Casacuberta, M. de Antonio
  • In VII Simposium Nacional de Reconocimiento de…
  • 1997
Highly Influential
3 Excerpts

Selecting the toro idal self-organizing feature maps (tsofm) best organized to object recognition

  • G. Andreu, A. Crespo, J. Valiente
  • InProceedings of the International Conference on…
  • 1997
1 Excerpt

Distorsión estocástica de cadenas de sı́mbol os mediante dos métodos basados en modelos ocultos de markov

  • F. Prat
  • Technical report, DSIC
  • 1994
1 Excerpt

Kruskal.Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparison.Addison Wesley

  • J.B.D. Sankoff
  • 1983
1 Excerpt

The string-to-string correcti on

  • R. Wagner, M. Fisher
  • problem.Journal of the ACM,
  • 1974
1 Excerpt

Similar Papers

Loading similar papers…