Estimating Clustering Indexes in Data Streams

DOI10.1007/978-3-540-75520-3_55MaRDI QIDQ3527252zbMATH OpenOpenAlexFDO

Authors Luciana Buriol, Gereon Frahling, Christian Sohler, Stefano Leonardi

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_55

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Efficient triangle counting in large graphs via degree-based vertex partitioning
• Counting triangles in massive graphs with MapReduce
• Clique counting in MapReduce: algorithms and experiments
• Efficient computation of the Weighted Clustering Coefficient
• Efficient Computation of the Weighted Clustering Coefficient

Cited in

(9)

• New bounds for the CLIQUE-GAP problem using graph decomposition theory
• Energy-based function to evaluate data stream clustering
• Clustering correlated, sparse data streams to estimate a localized housing price index
• Clique counting in MapReduce: algorithms and experiments
• New bounds for the CLIQUE-GAP problem using graph decomposition theory
• Consistent subset sampling
• Approximating Clustering Coefficient and Transitivity
• Efficient computation of the Weighted Clustering Coefficient
• Interest clustering coefficient: a new metric for directed networks like twitter

This page was built for publication: Estimating Clustering Indexes in Data Streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527252)