Research map / Graph learning / Graph algorithms and clustering
TellTail: Fast Scoring and Detection of Dense Subgraphs
Bryan Hooi, Kijung Shin, Hemank Lamba, Christos Faloutsos
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use TAILF (size-controlled extreme-value score) instead of average degree | dense subgraph measure · Twitter ground-truth communities (PolIE) | precision at k: 0.00 -> 1.00 | Improved |
| use TAILF instead of modularity | dense subgraph measure · Twitter ground-truth communities (Football) | precision at k: 0.96 -> 1.00 | Improved |
| use TAILF instead of edge surplus | dense subgraph measure · Twitter ground-truth communities | precision at k: Football 1.00 -> 1.00; PolIE 0.75 -> 1.00 | Mixed |
| optimize TAILF with TELLTAIL search instead of average degree local search | subgraph detection · Twitter ground-truth detection (Football) | max Jaccard similarity: 0.11 -> 0.78 | Improved |
| add safe pruning step (TELLTAIL+ vs TELLTAIL) (ablation) | TELLTAIL · Twitter ground-truth detection | max Jaccard similarity: Football 0.78 -> 0.67; PolUK 0.82 -> 0.84 | Mixed |
| add safe pruning to the search (ablation) | TELLTAIL · largest InternetAS, WikiP, Twitter | node count reduction: 45x, 18x, 52x fewer nodes | Improved |
| model subgraph mass tail with Generalized Pareto instead of Poisson/Gaussian | null model · UCForum, Blogs, InternetAS | fit to empirical CCDF | Improved |
Closest papers by meaning
- Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs (ICML 2024 · similarity 0.87)
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.86)
- Optimal community detection in dense bipartite graphs (NeurIPS 2025 · similarity 0.86)
- New Parallel and Streaming Algorithms for Directed Densest Subgraph (NeurIPS 2025 · similarity 0.85)
- Graph Anomaly Detection as Dynamical Transport: Training-Free Scoring via Empirical Bayes (NeurIPS 2026 · similarity 0.85)
- UniFORM: Towards Unified Framework for Anomaly Detection on Graphs (AAAI 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
