Sciweavers

245 search results - page 1 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
KDD
1994
ACM
214views Data Mining» more  KDD 1994»
13 years 7 months ago
Efficient Algorithms for Discovering Association Rules
Heikki Mannila, Hannu Toivonen, A. Inkeri Verkamo
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
13 years 7 months ago
An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
Shiby Thomas, Sreenath Bodagala, Khaled Alsabti, S...
ENC
2004
IEEE
13 years 7 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
AUSAI
2001
Springer
13 years 7 months ago
Further Pruning for Efficient Association Rule Discovery
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
Songmao Zhang, Geoffrey I. Webb
DAWAK
2004
Springer
13 years 7 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin