Sciweavers

222 search results - page 18 / 45
» Tight results for clustering and summarizing data streams
Sort
View
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 7 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 7 months ago
A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clustering
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
Yevgeny Seldin
ASUNAM
2011
IEEE
12 years 7 months ago
Evolutionary Clustering and Analysis of Bibliographic Networks
—In this paper, we study the problem of evolutionary clustering of multi-typed objects in a heterogeneous bibliographic network. The traditional methods of homogeneous clustering...
Manish Gupta, Charu C. Aggarwal, Jiawei Han, Yizho...
CIKM
2005
Springer
14 years 1 months ago
On the estimation of frequent itemsets for data streams: theory and experiments
In this paper, we devise a method for the estimation of the true support of itemsets on data streams, with the objective to maximize one chosen criterion among {precision, recall}...
Pierre-Alain Laur, Richard Nock, Jean-Emile Sympho...
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 8 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy