Sciweavers

179 search results - page 10 / 36
» An Approximate Approach for Mining Recently Frequent Itemset...
Sort
View
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 6 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 6 months ago
Mining Multi-Level Frequent Itemsets under Constraints
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multi...
Mohamed Salah Gouider, Amine Farhat
KDD
2000
ACM
118views Data Mining» more  KDD 2000»
14 years 11 days ago
Generating non-redundant association rules
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
Mohammed Javeed Zaki
CINQ
2004
Springer
157views Database» more  CINQ 2004»
14 years 16 days ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
IDA
2008
Springer
13 years 8 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