Sciweavers

464 search results - page 88 / 93
» Frequent pattern mining for kernel trace data
Sort
View
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
14 years 7 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
EOR
2007
96views more  EOR 2007»
13 years 7 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 8 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
PVLDB
2010
92views more  PVLDB 2010»
13 years 5 months ago
SSD Bufferpool Extensions for Database Systems
High-end solid state disks (SSDs) provide much faster access to data compared to conventional hard disk drives. We present a technique for using solid-state storage as a caching l...
Mustafa Canim, George A. Mihaila, Bishwaranjan Bha...
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 11 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...