Sciweavers

214 search results - page 25 / 43
» New Parallel Algorithms for Frequent Itemset Mining in Very ...
Sort
View
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 6 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
WWW
2009
ACM
14 years 7 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...
ICDE
2008
IEEE
133views Database» more  ICDE 2008»
14 years 1 months ago
Discovering popular co-cited communities in blogspaces
In a blogspace, citation behaviors reflect interests of bloggers. To fully get insight into the latent information in a blogspace, in this paper, we intend to mine popular co-cit...
Meng-Fen Chiang, Wen-Chih Peng, Chia-Hao Lo
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 3 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 4 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...