Sciweavers

247 search results - page 20 / 50
» Mining Patents Using Molecular Similarity Search
Sort
View
111
Voted
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 1 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
123
Voted
ICDM
2010
IEEE
276views Data Mining» more  ICDM 2010»
14 years 10 months ago
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
Doruk Sart, Abdullah Mueen, Walid A. Najjar, Eamon...
128
Voted
NAR
2011
189views Computer Vision» more  NAR 2011»
14 years 3 months ago
EDULISS: a small-molecule database with data-mining and pharmacophore searching capabilities
We present the relational database EDULISS (EDinburgh University Ligand Selection System), which stores structural, physicochemical and pharmacophoric properties of small molecule...
Kun-Yi Hsin, Hugh P. Morgan, Steven R. Shave, Andr...
ICPR
2004
IEEE
16 years 1 months ago
Feature Selection and Gene Clustering from Gene Expression Data
In this article we describe an algorithm for feature selection and gene clustering from high dimensional gene expression data. The method is based on measuring similarity between ...
D. Dutta Majumder, Pabitra Mitra
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 2 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray