Sciweavers

39 search results - page 2 / 8
» On Minimal Infrequent Itemset Mining
Sort
View
KAIS
2010
139views more  KAIS 2010»
13 years 3 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
FQAS
2006
Springer
99views Database» more  FQAS 2006»
13 years 9 months ago
Partition-Based Approach to Processing Batches of Frequent Itemset Queries
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...
Przemyslaw Grudzinski, Marek Wojciechowski, Maciej...
DMIN
2007
76views Data Mining» more  DMIN 2007»
13 years 6 months ago
Towards Average Case Analysis of Itemset Mining
—We perform a statistical analysis and describe the asymptotic behavior of the frequency and size distribution of δoccurrent, minimal δ-occurrent, and maximal δ-occurrent item...
Dan Singer, David J. Haglin, Anna M. Manning
CLA
2007
13 years 6 months 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...
FLAIRS
2003
13 years 6 months ago
An Improved Algorithm for Mining Association Rules Using Multiple Support Values
Almost all the approaches in association rule mining suggested the use of a single minimum support, technique that either rules out all infrequent itemsets or suffers from the bot...
Ioannis N. Kouris, Christos Makris, Athanasios K. ...