Sciweavers

1403 search results - page 50 / 281
» Set cover algorithms for very large datasets
Sort
View
PODS
1998
ACM
134views Database» more  PODS 1998»
15 years 2 months ago
A New Framework For Itemset Generation
The problem of finding association rules in a large database of sales transactions has been widely studied in the literature, We discuss some of the weaknessesof the large itemset...
Charu C. Aggarwal, Philip S. Yu
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
BMCBI
2010
123views more  BMCBI 2010»
14 years 9 months ago
An improved classification of G-protein-coupled receptors using sequence-derived features
Background: G-protein-coupled receptors (GPCRs) play a key role in diverse physiological processes and are the targets of almost two-thirds of the marketed drugs. The 3 D structur...
Zhen-Ling Peng, Jian-Yi Yang, Xin Chen
IPPS
2009
IEEE
15 years 4 months ago
Accelerating error correction in high-throughput short-read DNA sequencing data with CUDA
Emerging DNA sequencing technologies open up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, produced reads are signif...
Haixiang Shi, Bertil Schmidt, Weiguo Liu, Wolfgang...
AAAI
2011
13 years 9 months ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting