Sciweavers

Share
SIGIR
2010
ACM
9 years 3 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
9 years 3 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
9 years 3 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
9 years 3 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
SIGMOD
1999
ACM
112views Database» more  SIGMOD 1999»
9 years 3 months ago
A New Method for Similarity Indexing of Market Basket Data
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
9 years 3 months ago
Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. Wh...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
9 years 3 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
9 years 3 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ICDE
2002
IEEE
162views Database» more  ICDE 2002»
9 years 4 months ago
Similarity Search Over Time-Series Data Using Wavelets
We consider the use of wavelet transformations as a dimensionality reduction technique to permit efficient similarity search over high-dimensional time-series data. While numerou...
Ivan Popivanov, Renée J. Miller
SSDBM
2010
IEEE
188views Database» more  SSDBM 2010»
9 years 4 months ago
Similarity Estimation Using Bayes Ensembles
Similarity search and data mining often rely on distance or similarity functions in order to provide meaningful results and semantically meaningful patterns. However, standard dist...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
books