Sciweavers

44 search results - page 4 / 9
» Distributed mining of maximal frequent itemsets from databas...
Sort
View
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 9 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 5 months ago
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
Michael Hahsler
SPAA
1997
ACM
13 years 10 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
IDA
2008
Springer
13 years 5 months ago
Mining frequent items in a stream using flexible windows
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
Toon Calders, Nele Dexters, Bart Goethals
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 6 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...