Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Artificial Benchmark for Community Detection with Outliers (ABCD+o) (2301.05749v2)

Published 13 Jan 2023 in cs.SI, cs.LG, and math.CO

Abstract: The Artificial Benchmark for Community Detection graph (ABCD) is a random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar properties as the well-known LFR one, and its main parameter $\xi$ can be tuned to mimic its counterpart in the LFR model, the mixing parameter $\mu$. In this paper, we extend the ABCD model to include potential outliers. We perform some exploratory experiments on both the new ABCD+o model as well as a real-world network to show that outliers possess some desired, distinguishable properties.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. Graph based anomaly detection and description: a survey. Data mining and knowledge discovery, 29(3):626–688, 2015.
  2. Integrating network embedding and community outlier detection via multiclass graph description. arXiv preprint arXiv:2007.10231, 2020.
  3. The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory, Series A, 24(3):296–307, 1978.
  4. Julia: A fresh approach to numerical computing, 2014. URL: https://arxiv.org/abs/1411.1607, doi:10.48550/ARXIV.1411.1607.
  5. Béla Bollobás. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics, 1(4):311–316, 1980.
  6. Deepayan Chakrabarti. Autopart: Parameter-free graph partitioning and outlier detection. In Jean-François Boulicaut, Floriana Esposito, Fosca Giannotti, and Dino Pedreschi, editors, Knowledge Discovery in Databases: PKDD 2004, pages 112–124, Berlin, Heidelberg, 2004. Springer Berlin Heidelberg.
  7. Complex graphs and networks, volume 107 of CBMS Regional Conference Series in Mathematics. American Mathematical Soc., 2006.
  8. A novel measure to identify influential nodes: Return random walk gravity centrality. Information Sciences, 2023.
  9. Efficient identification of web communities. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 150–160, 2000.
  10. Santo Fortunato. Community detection in graphs. Physics reports, 486(3-5):75–174, 2010.
  11. Outlier detection in networks with missing links. Computational Statistics & Data Analysis, 164:107308, 2021.
  12. Immunization of networks with non-overlapping community structure. Social Network Analysis and Mining, 9:1–22, 2019.
  13. Community structure in social and biological networks. Proceedings of the national academy of sciences, 99(12):7821–7826, 2002.
  14. Steve Gregory. Finding overlapping communities in networks by label propagation. New journal of Physics, 12(10):103018, 2010.
  15. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pages 855–864, 2016.
  16. Community detection in networks: A multidisciplinary review. Journal of Network and Computer Applications, 108:87–111, 2018.
  17. A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs. Network Science, 10(4):323–346, 2022.
  18. Properties and performance of the abcde random graph model with community structure. Big Data Research, 30:100348, 2022.
  19. Modularity of the abcd random graph model with community structure. Journal of Complex Networks, 10(6):cnac050, 2022.
  20. Outliers in the abcd random graph model with community structure (abcd+o). In 11th International Conference on Complex Networks and Their Applications. Springer Studies in Computational Intelligence (SCI, volume 1078), 2022.
  21. An unsupervised framework for comparing graph embeddings. Journal of Complex Networks, 8(5):cnz043, 2020.
  22. Artificial benchmark for community detection (abcd)—fast random graph model with community structure. Network Science, pages 1–26, 2021.
  23. Mining Complex Networks. CRC Press, 2021.
  24. Hypergraph artificial benchmark for community detection (h-abcd). arXiv preprint arXiv:2210.15009, 2022.
  25. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E, 80(1):016118, 2009.
  26. Benchmark graphs for testing community detection algorithms. Physical review E, 78(4):046110, 2008.
  27. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.
  28. Community based spammer detection in social networks. In Xin Luna Dong, Xiaohui Yu, Jian Li, and Yizhou Sun, editors, Web-Age Information Management, pages 554–558, Cham, 2015. Springer International Publishing.
  29. Gmm: A generalized mechanics model for identifying the importance of nodes in complex networks. Knowledge-Based Systems, 193:105464, 2020.
  30. Community detection in complex networks via clique conductance. Scientific reports, 8(1):1–16, 2018.
  31. M. E. J. Newman. Networks (2nd edition). Oxford University Press, Oxford; New York, 2018.
  32. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004.
  33. Ensemble clustering for graphs. In International Conference on Complex Networks and their Applications, pages 231–243. Springer, 2018.
  34. Defining and identifying communities in networks. Proceedings of the national academy of sciences, 101(9):2658–2663, 2004.
  35. Comparative evaluation of community-aware centrality measures. Quality & Quantity, 57(2):1273–1302, 2023.
  36. Ni-louvain: A novel algorithm to detect overlapping communities with influence analysis. Journal of King Saud University-Computer and Information Sciences, 2021.
  37. Neighborhood formation and anomaly detection in bipartite graphs. In Fifth IEEE International Conference on Data Mining (ICDM’05), pages 8 pp.–, 2005. doi:10.1109/ICDM.2005.103.
  38. An analysis of social network-based sybil defenses. SIGCOMM Comput. Commun. Rev., 40(4):363–374, aug 2010. doi:10.1145/1851275.1851226.
  39. Nicholas C Wormald. Generating random regular graphs. Journal of algorithms, 5(2):247–280, 1984.
  40. Nicholas C Wormald et al. Models of random regular graphs. London Mathematical Society Lecture Note Series, pages 239–298, 1999.
  41. Overlapping community detection at scale: a nonnegative matrix factorization approach. In Proceedings of the sixth ACM international conference on Web search and data mining, pages 587–596, 2013.
Citations (7)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now