Sciweavers

128 search results - page 7 / 26
» Fastanova: an efficient algorithm for genome-wide associatio...
Sort
View
PODS
1998
ACM
134views Database» more  PODS 1998»
13 years 12 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
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 26 days ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
EOR
2010
178views more  EOR 2010»
13 years 7 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
BMCBI
2010
121views more  BMCBI 2010»
13 years 5 months ago
Computing DNA duplex instability profiles efficiently with a two-state model: trends of promoters and binding sites
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
Miriam R. Kantorovitz, Zoi Rapti, Vladimir Gelev, ...