Sciweavers

38 search results - page 4 / 8
» Mining Association Rules in Graphs Based on Frequent Cohesiv...
Sort
View
RCIS
2010
14 years 9 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
KDD
1999
ACM
237views Data Mining» more  KDD 1999»
15 years 3 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...
CLA
2007
15 years 20 days ago
ZART: A Multifunctional Itemset Mining Algorithm
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznets...
ISCI
2007
99views more  ISCI 2007»
14 years 11 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
IDA
2009
Springer
14 years 9 months ago
Efficient Vertical Mining of Frequent Closures and Generators
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...