Sciweavers

247 search results - page 2 / 50
» Scaling up all pairs similarity search
Sort
View
JMLR
2010
111views more  JMLR 2010»
12 years 11 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 5 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
BMCBI
2004
120views more  BMCBI 2004»
13 years 4 months ago
An approach to large scale identification of non-obvious structural similarities between proteins
Background: A new sequence independent bioinformatics approach allowing genome-wide search for proteins with similar three dimensional structures has been developed. By utilizing ...
Artem Cherkasov, Steven J. M. Jones
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 4 months ago
Similarity of Objects and the Meaning of Words
We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extracti...
Rudi Cilibrasi, Paul M. B. Vitányi
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 3 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang