Sciweavers

28 search results - page 1 / 6
» Compact Summaries over Large Datasets
Sort
View
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 3 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
GPC
2007
Springer
14 years 5 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
SEMWEB
2010
Springer
13 years 8 months ago
Summary Models for Routing Keywords to Linked Data Sources
The proliferation of linked data on the Web paves the way to a new generation of applications that exploit heterogeneous data from different sources. However, because this Web of d...
Thanh Tran, Lei Zhang, Rudi Studer
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
14 years 8 days 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...
CIKM
2008
Springer
14 years 25 days ago
Summarization of social activity over time: people, actions and concepts in dynamic networks
We present a framework for automatically summarizing social group activity over time. The problem is important in understanding large scale online social networks, which have dive...
Yu-Ru Lin, Hari Sundaram, Aisling Kelliher