Indexing metric spaces for exact similarity search

L Chen, Y Gao, X Song, Z Li, Y Zhu, X Miao… - ACM Computing …, 2022 - dl.acm.org
With the continued digitization of societal processes, we are seeing an explosion in
available data. This is referred to as big data. In a research setting, three aspects of the data …

BIRCH: an efficient data clustering method for very large databases

T Zhang, R Ramakrishnan, M Livny - ACM sigmod record, 1996 - dl.acm.org
Finding useful patterns in large datasets has attracted considerable interest recently, and
one of the most widely studied problems in this area is the identification of clusters, or …

Digital mosaic frameworks‐An overview

S Battiato, G Di Blasi, GM Farinella… - computer graphics …, 2007 - Wiley Online Library
Abstract Art often provides valuable hints for technological innovations especially in the field
of Image Processing and Computer Graphics. In this paper we survey in a unified framework …

Similarity measures and dimensionality reduction techniques for time series data mining

C Cassisi, P Montalto, M Aliotta… - Advances in data …, 2012 - books.google.com
A time series is “a sequence X=(X1, X2, xm) of observed data over time", where m is the
number of observations. Tracking the behavior of a specific phenomenon/data in time can …

Introduction to data mining in bioinformatics

JTL Wang, MJ Zaki, HTT Toivonen… - Data mining in …, 2005 - Springer
The aim of this book is to introduce the reader to some of the best techniques for data mining
in bioinformatics in the hope that the reader will build on them to make new discoveries on …

Making graphs compact by lossless contraction

W Fan, Y Li, M Liu, C Lu - … of the 2021 International Conference on …, 2021 - dl.acm.org
This paper proposes a scheme to reduce big graphs to small graphs. It contracts obsolete
parts, stars, cliques and paths into supernodes. The supernodes carry a synopsis S_Q for …

[HTML][HTML] Approximate similarity search: A multi-faceted problem

M Patella, P Ciaccia - Journal of Discrete Algorithms, 2009 - Elsevier
We review the major paradigms for approximate similarity queries and propose a
classification schema that easily allows existing approaches to be compared along several …

Completely lazy learning

EK Garcia, S Feldman, MR Gupta… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
Local classifiers are sometimes called lazy learners because they do not train a classifier
until presented with a test sample. However, such methods are generally not completely lazy …

The basic principles of metric indexing

ML Hetland - Swarm intelligence for multi-objective problems in data …, 2009 - Springer
This chapter describes several methods of similarity search, based on metric indexing, in
terms of their common, underlying principles. Several approaches to creating lower bounds …

A new unsupervised method for document clustering by using WordNet lexical and conceptual relations

D Reforgiato Recupero - Information Retrieval, 2007 - Springer
Text document clustering provides an effective and intuitive navigation mechanism to
organize a large amount of retrieval results by grou** documents in a small number of …