Sciweavers

284 search results - page 32 / 57
» Mining Frequent Itemsets in Distributed and Dynamic Database...
Sort
View
81
Voted
EMS
2008
IEEE
15 years 4 months ago
A Weighted Utility Framework for Mining Association Rules
Association rule mining (ARM) identifies frequent itemsets from databases and generates association rules by assuming that all items have the same significance and frequency of oc...
M. Sulaiman Khan, Maybin K. Muyeba, Frans Coenen
PAKDD
2010
ACM
171views Data Mining» more  PAKDD 2010»
14 years 8 months ago
Summarizing Multidimensional Data Streams: A Hierarchy-Graph-Based Approach
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...
Yoann Pitarch, Anne Laurent, Pascal Poncelet
93
Voted
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
15 years 10 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 1 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
KAIS
2010
139views more  KAIS 2010»
14 years 8 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