Login / Signup

Efficient Neural Clustering and Compression of Strings Through Approximate Euclidean Embeddings of the Levenshtein Distance.

Ünsal ÖztürkUtku Görkem ErtürkSimone Casale-BrunetPaolo RibecaMarco Mattavelli
Published in: DCC (2024)
Keyphrases
  • levenshtein distance
  • edit distance
  • visual analysis
  • clustering algorithm
  • distance measure
  • high dimensional data
  • euclidean space
  • machine learning
  • computer vision
  • reinforcement learning
  • object recognition