Sciweavers

245 search results - page 7 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
APPINF
2003
13 years 9 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
IDEAL
2004
Springer
14 years 27 days ago
PRICES: An Efficient Algorithm for Mining Association Rules
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...
Chuan Wang, Christos Tjortjis
VLDB
1995
ACM
163views Database» more  VLDB 1995»
13 years 11 months ago
An Efficient Algorithm for Mining Association Rules in Large Databases
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...
DKE
2010
101views more  DKE 2010»
13 years 7 months ago
An efficient algorithm for incremental mining of temporal association rules
Tarek F. Gharib, Hamed Nassar, Mohamed Taha, Ajith...
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
14 years 8 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu