ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS

摘要: 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 and genome databases. A problem involves a collection of objects (e.g., documents, images) which are characterized by relevant features represented as points attribute space. The first part this book will present new hierarchical clustering algorithm called Antipole Clustering. partitions the set data clusters such that each one diameter approximately less than given value. returns tree structure Tree leaves final clusters. second present, GraphGrepVF, an application-independent method for querying database graphs order find all occurrences subgraph. Many applications industry, science engineering share problem, size requires efficient searching algorithms.