Sciweavers

165 search results - page 9 / 33
» Discovering Frequent Closed Itemsets for Association Rules
Sort
View
PAKDD
2010
ACM
152views Data Mining» more  PAKDD 2010»
14 years 12 days ago
Mining Association Rules in Long Sequences
Abstract. Discovering interesting patterns in long sequences, and finding confident association rules within them, is a popular area in data mining. Most existing methods define...
Boris Cule, Bart Goethals
APIN
2008
116views more  APIN 2008»
13 years 7 months ago
Updating generalized association rules with evolving taxonomies
Abstract-Mining generalized association rules between items in the presence of taxonomy has been recognized as an important model in data mining. Earlier work on mining generalized...
Ming-Cheng Tseng, Wen-Yang Lin, Rong Jeng
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 29 days ago
Computing Frequent Itemsets Inside Oracle 10G
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
Wei Li, Ari Mozes
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
IJFCS
2008
102views more  IJFCS 2008»
13 years 7 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...