Sciweavers

156 search results - page 18 / 32
» Mining Frequent Itemsets from Secondary Memory
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 7 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
BMCBI
2006
114views more  BMCBI 2006»
13 years 7 months ago
Mining frequent patterns for AMP-activated protein kinase regulation on skeletal muscle
Background: AMP-activated protein kinase (AMPK) has emerged as a significant signaling intermediary that regulates metabolisms in response to energy demand and supply. An investig...
Qingfeng Chen, Yi-Ping Phoebe Chen
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 8 months ago
Generalized Closed Itemsets for Association Rule Mining
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
Vikram Pudi, Jayant R. Haritsa
IDEAS
2005
IEEE
99views Database» more  IDEAS 2005»
14 years 1 months ago
Distribution-Based Synthetic Database Generation Techniques for Itemset Mining
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...
Ganesh Ramesh, Mohammed Javeed Zaki, William Mania...
LWA
2004
13 years 8 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist