18 search results - page 1 / 4 » The power of two min-hashes for similarity search among hier... |
221
Voted
PODS
2008
ACM
16 years 7 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
227
Voted
SISAP
2009
IEEE
16 years 2 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
342
Voted
VLDB
2007
ACM
16 years 8 months ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
219
Voted
SIGIR
2005
ACM
16 years 1 months ago
2005
ACM
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
269
Voted
ICDE
2011
IEEE
14 years 11 months ago
2011
IEEE
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...