A framework for clustering massive graph streams

DOI10.1002/SAM.10090OpenAlexW2072099315MaRDI QIDQ4969739FDOQ4969739

Authors: Charu C. Aggarwal, Yuchen Zhao, Philip S. Yu 

Publication date: 14 October 2020

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sam.10090

zbMATH Keywords

clusteringdata mininggraphs

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites Work

• Finding Groups in Data
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Title not available (Why is that?)
• An Efficient Heuristic Procedure for Partitioning Graphs
• An improved data stream summary: the count-min sketch and its applications
• Cure: An efficient clustering algorithm for large databases
• Managing and mining graph data
• Mining Graph Data
• Graph Clustering and Minimum Cut Trees
• Random sampling in cut, flow, and network design problems

Cited In (3)

• Clustering, Visualizing, and Navigating for Large Dynamic Graphs
• Labeled graph sketches: keeping up with real-time graph streams
• Discovering rare categories from graph streams

Uses Software

• gSpan
• Xproj
• CloseGraph
• XRules

This page was built for publication: A framework for clustering massive graph streams

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