Sciweavers

284 search results - page 9 / 57
» Mining Frequent Itemsets in Distributed and Dynamic Database...
Sort
View
68
Voted
SAC
2010
ACM
15 years 2 months ago
Mining interesting sets and rules in relational databases
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...
Bart Goethals, Wim Le Page, Michael Mampaey
JCIT
2008
128views more  JCIT 2008»
14 years 9 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
15 years 4 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
ICDT
2009
ACM
119views Database» more  ICDT 2009»
15 years 10 months ago
Analysis of sampling techniques for association rule mining
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
RCIS
2010
14 years 8 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