There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in...
There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases,...