Sciweavers

295 search results - page 7 / 59
» Frequent regular itemset mining
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
KDD
1999
ACM
237views Data Mining» more  KDD 1999»
13 years 12 months ago
Using Association Rules for Product Assortment Decisions: A Case Study
It has been claimed that the discovery of association rules is well-suited for applications of market basket analysis to reveal regularities in the purchase behaviour of customers...
Tom Brijs, Gilbert Swinnen, Koen Vanhoof, Geert We...
JCIT
2008
128views more  JCIT 2008»
13 years 7 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
ICTAI
2007
IEEE
14 years 1 months ago
Towards Rare Itemset Mining
We describe here a general approach for rare itemset mining. While mining literature has been almost exclusively focused on frequent itemsets, in many practical situations rare on...
Laszlo Szathmary, Amedeo Napoli, Petko Valtchev
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
14 years 18 days ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu