Similarity Search for Dynamic Data Streams

Nearest neighbor searching systems are an integral part of many online applications, including but not limited to pattern recognition, plagiarism detection, and recommender systems. With increasingly larger data sets, scalability has become an important issue. Many of the most space and running time...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on knowledge and data engineering 2020-11, Vol.32 (11), p.2241-2253
Hauptverfasser:	Bury, Marc, Schwiegelshohn, Chris, Sorella, Mara
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation algorithms Data engineering Data search Data transmission Datasets Dynamic streaming Hash functions Heuristic algorithms Indexes Knowledge engineering locality-sensitive hashing Measurement nearest neighbor searching Pattern recognition Recommender systems Run time (computers) Similarity
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!