Sciweavers

237 search results - page 22 / 48
» Mining Frequent Itemsets Using Re-Usable Data Structure
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 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
ICDM
2002
IEEE
131views Data Mining» more  ICDM 2002»
14 years 18 days ago
Using Sequential and Non-Sequential Patterns in Predictive Web Usage Mining Tasks
We describe an efficient framework for Web personalization based on sequential and non-sequential pattern discovery from usage data. Our experimental results performed on real us...
Bamshad Mobasher, Honghua Dai, Tao Luo, Miki Nakag...
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
14 years 2 months ago
Estimating Missing Data in Data Streams
Networks of thousands of sensors present a feasible and economic solution to some of our most challenging problems, such as real-time traffic modeling, military sensing and trackin...
Nan Jiang, Le Gruenwald
EUROCAST
2005
Springer
133views Hardware» more  EUROCAST 2005»
14 years 1 months ago
An Iterative Method for Mining Frequent Temporal Patterns
The incorporation of temporal semantic into the traditional data mining techniques has caused the creation of a new area called Temporal Data Mining. This incorporation is especial...
Francisco Guil, Antonio B. Bailón, Alfonso ...
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree