Investigation of accelerated search for close text sequences with the help of vector representations

DOI10.1007/S10559-008-9021-0zbMATH Open1162.68416OpenAlexW2066179471MaRDI QIDQ1007160FDOQ1007160

A. M. Sokolov

Publication date: 27 March 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-008-9021-0

zbMATH Keywords

spam detectionapproximate nearest-neighbor searchduplicate detectionedit distance approximationneural information technology

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Comparing Top k Lists
• Locality-sensitive hashing scheme based on p-stable distributions
• Approximate string-matching with \(q\)-grams and maximal matches
• Vector representations for efficient comparison and search for similar strings

Cited In (3)

• Distance-based index structures for fast similarity search
• Index structures for fast similarity search for real-valued vectors. I
• Index structures for fast similarity search for symbol strings

   Recommendations

• Vector representations for efficient comparison and search for similar strings 👍 👎
• Index structures for fast similarity search for real vectors. II 👍 👎
• Binary vectors for fast distance and similarity estimation 👍 👎
• Index structures for fast similarity search for real-valued vectors. I 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Investigation of accelerated search for close text sequences with the help of vector representations

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