Sciweavers

88 search results - page 11 / 18
» A new method for finding generalized frequent itemsets in ge...
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
PARMA
2004
191views Database» more  PARMA 2004»
13 years 9 months ago
Identifying Most Predictive Items
Abstract. Frequent itemsets and association rules are generally accepted concepts in analyzing item-based databases. The Apriori-framework was developed for analyzing categorical d...
Markus Wawryniuk, Daniel A. Keim
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
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
ISBRA
2009
Springer
14 years 2 months ago
Mining of cis-Regulatory Motifs Associated with Tissue-Specific Alternative Splicing
KIM, JIHYE. Mining of Cis-Regulatory Motifs Associated with Tissue-Specific Alternative Splicing. (Under the direction of Steffen Heber). Alternative splicing (AS) is an important...
Jihye Kim, Sihui Zhao, Brian E. Howard, Steffen He...