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

DOI10.1007/S10559-008-9021-0MaRDI QIDQ1007160zbMATH OpenOpenAlexFDO

Authors 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

approximate nearest-neighbor searchduplicate detectionedit distance approximationneural information technologyspam detection

Mathematics Subject Classification ID

Searching and sorting (68P10)

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
• scientific article; zbMATH DE number 1482232

Cites work

• Algorithms on Strings, Trees and Sequences
• Approximate string-matching with q-grams and maximal matches
• Comparing Top k Lists
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• Locality-sensitive hashing scheme based on p-stable distributions
• Vector representations for efficient comparison and search for similar strings

Cited in

(4)

• 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
• Vector representations for efficient comparison and search for similar strings

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)