Sciweavers

Share
CIKM
2009
Springer
9 years 6 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
9 years 6 months ago
Searching by Similarity and Classifying Images on a Very Large Scale
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
Giuseppe Amato, Pasquale Savino
DASFAA
2009
IEEE
118views Database» more  DASFAA 2009»
9 years 6 months ago
Periodic Pattern Analysis in Time Series Databases
Similarity search in time series data is used in diverse domains. The most prominent work has focused on similarity search considering either complete time series or certain subseq...
Johannes Aßfalg, Thomas Bernecker, Hans-Pete...
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
9 years 6 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
AINA
2009
IEEE
9 years 6 months ago
Similarity Search over DNS Query Streams for Email Worm Detection
Email worms continue to be a persistent problem, indicating that current approaches against this class of selfpropagating malicious code yield rather meagre results. Additionally,...
Nikolaos Chatzis, Nevil Brownlee
PODS
2005
ACM
127views Database» more  PODS 2005»
9 years 11 months ago
FTW: fast similarity search under the time warping distance
Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic T...
Yasushi Sakurai, Masatoshi Yoshikawa, Christos Fal...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
9 years 11 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
WWW
2002
ACM
10 years 9 hour ago
Evaluating strategies for similarity search on the web
Taher H. Haveliwala, Aristides Gionis, Dan Klein, ...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
10 years 20 days ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
ICDE
2004
IEEE
106views Database» more  ICDE 2004»
10 years 21 days ago
BOSS: Browsing OPTICS-Plots for Similarity Search
Stefan Brecheisen, Hans-Peter Kriegel, Peer Kr&oum...
books