Sciweavers

150 search results - page 23 / 30
» Coherency Sensitive Hashing
Sort
View
TCSV
2008
150views more  TCSV 2008»
14 years 9 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
TKDE
1998
111views more  TKDE 1998»
14 years 9 months ago
Efficient Data Mining for Path Traversal Patterns
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
Ming-Syan Chen, Jong Soo Park, Philip S. Yu
114
Voted
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 1 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
PODS
2008
ACM
211views Database» more  PODS 2008»
15 years 9 months ago
The power of two min-hashes for similarity search among hierarchical data objects
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...
Sreenivas Gollapudi, Rina Panigrahy
85
Voted
DILS
2007
Springer
15 years 3 months ago
Fast Approximate Duplicate Detection for 2D-NMR Spectra
2D-Nuclear magnetic resonance (NMR) spectroscopy is a powerful analytical method to elucidate the chemical structure of molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra cor...
Björn Egert, Steffen Neumann, Alexander Hinne...