Sciweavers

62 search results - page 1 / 13
» Efficient Data Structures and Parallel Algorithms for Associ...
Sort
View
ENC
2004
IEEE
13 years 8 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...
IDEAL
2003
Springer
13 years 9 months ago
Experiences of Using a Quantitative Approach for Mining Association Rules
In recent years interest has grown in “mining” large databases to extract novel and interesting information. Knowledge Discovery in Databases (KDD) has been recognised as an em...
L. Dong, Christos Tjortjis
DMIN
2006
126views Data Mining» more  DMIN 2006»
13 years 5 months ago
An Algorithm for the Discovery of Arbitrary Length Ordinal Association Rules
Association rule mining techniques are used to search attribute-value pairs that occur frequently together in a data set. Ordinal association rules are a particular type of associa...
Alina Campan, Gabriela Serban, Traian Marius Truta...
IDEAL
2003
Springer
13 years 9 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
AUSAI
2001
Springer
13 years 8 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