There is huge amount of content produced online by amateur authors, covering a large
variety of topics. Sentiment analysis (SA) extracts and aggregates users' sentiments towards …

We propose a novel approach to solving the approximate k-nearest neighbor search
problem in metric spaces. The search structure is based on a navigable small world graph …

We propose a new efficient and accurate technique for generic approximate similarity
searching, based on the use of inverted files. We represent each object of a dataset by the …

Improving the recall of information retrieval systems for similarity search in time series
databases is of great practical importance. In the manufacturing domain, these systems are …

Similarity search based on a distance function in metric spaces is a fundamental problem for
many applications. Queries for similar objects lead to the well-known machine learning task …

We present the Permutation Prefix Index (this work is a revised and extended version of
Esuli (2009b), presented at the 2009 LSDS-IR Workshop, held in Boston)(PP-Index), an …

Domain Generation Algorithms (DGAs) are used by adversaries to establish Command and
Control (C&C) server communications during cyber attacks. Blacklists of known/identified …

In this paper we present a novel technique for nearest neighbor searching dubbed
neighborhood approximation. The central idea is to divide the database into compact …

Searching by proximity has been a source of puzzling behaviors and counter-intuitive
findings for well established algorithmic design rules. One example is a linked list; it is the …

This review considers the class of index structures for fast similarity search. In constructing
and applying such structures, only information on values or ranks of some …