Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 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

Four-set Hypergraphlets for Characterization of Directed Hypergraphs (2311.14289v1)

Published 24 Nov 2023 in cs.DS

Abstract: A directed hypergraph, which consists of nodes and hyperarcs, is a higher-order data structure that naturally models directional group interactions (e.g., chemical reactions of molecules). Although there have been extensive studies on local structures of (directed) graphs in the real world, those of directed hypergraphs remain unexplored. In this work, we focus on measurements, findings, and applications related to local structures of directed hypergraphs, and they together contribute to a systematic understanding of various real-world systems interconnected by directed group interactions. Our first contribution is to define 91 directed hypergraphlets (DHGs), which disjointly categorize directed connections and overlaps among four node sets that compose two incident hyperarcs. Our second contribution is to develop exact and approximate algorithms for counting the occurrences of each DHG. Our last contribution is to characterize 11 real-world directed hypergraphs and individual hyperarcs in them using the occurrences of DHGs, which reveals clear domain-based local structural patterns. Our experiments demonstrate that our DHG-based characterization gives up to 12% and 33% better performances on hypergraph clustering and hyperarc prediction, respectively, than baseline characterization methods. Moreover, we show that CODA-A, which is our proposed approximate algorithm, is up to 32X faster than its competitors with similar characterization quality.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. A. R. Benson, R. Abebe, M. T. Schaub, A. Jadbabaie, and J. Kleinberg, “Simplicial closure and higher-order link prediction,” PNAS, vol. 115, no. 48, pp. E11 221–E11 230, 2018.
  2. S. Kim, M. Choe, J. Yoo, and K. Shin, “Reciprocity in directed hypergraphs: Measures, findings, and generators,” in ICDM, 2022.
  3. J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su, “Arnetminer: Extraction and mining of academic social networks,” in KDD, 2008.
  4. S. Exchange, “Stack exchange data dump,” https://archive.org/details/stackexchange, 2020.
  5. J. Wu, J. Liu, W. Chen, H. Huang, Z. Zheng, and Y. Zhang, “Detecting mixing services via mining bitcoin transaction network with hybrid motifs,” IEEE Trans. Syst. Man Cybern.: Syst., vol. 52, no. 4, pp. 2237–2249, 2021.
  6. F. J. M.-R. Moyano and F. Jose, “Strong connectivity in directed hypergraphs and its application to the atomic decomposition of ontologies,” ETSI Informatica, 2016.
  7. L. H. Tran and L. H. Tran, “Directed hypergraph neural network,” arXiv preprint arXiv:2008.03626, 2020.
  8. X. Luo, J. Peng, and J. Liang, “Directed hypergraph attention network for traffic forecasting,” IET Intelligent Transport Systems, vol. 16, no. 1, pp. 85–98, 2022.
  9. T. Gracious, A. Gupta, and A. Dukkipati, “Neural temporal point process for forecasting higher order and directional interactions,” arXiv preprint arXiv:2301.12210, 2023.
  10. N. Yadati, V. Nitin, M. Nimishakavi, P. Yadav, A. Louis, and P. Talukdar, “Nhp: Neural hypergraph link prediction,” in CIKM, 2020.
  11. N. Yadati, R. Dayanidhi, S. Vaishnavi, K. Indira, and G. Srinidhi, “Knowledge base question answering through recursive hypergraphs,” in EACL, 2021.
  12. R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, S. Shen-Orr, I. Ayzenshtat, M. Sheffer, and U. Alon, “Superfamilies of evolved and designed networks,” Science, vol. 303, no. 5663, pp. 1538–1542, 2004.
  13. T. Milenković and N. Pržulj, “Uncovering biological network function via graphlet degree signatures,” Cancer informatics, vol. 6, pp. CIN–S680, 2008.
  14. A. Sarajlić, N. Malod-Dognin, Ö. N. Yaveroğlu, and N. Pržulj, “Graphlet-based characterization of directed networks,” Scientific Reports, vol. 6, no. 1, pp. 1–14, 2016.
  15. G. Lee, J. Ko, and K. Shin, “Hypergraph motifs: Concepts, algorithms, and discoveries,” PVLDB, vol. 13, no. 11, pp. 2256–2269, 2020.
  16. Q. F. Lotito, F. Musciotto, A. Montresor, and F. Battiston, “Higher-order motif analysis in hypergraphs,” Communications Physics, vol. 5, no. 1, pp. 1–8, 2022.
  17. G. Lee and K. Shin, “Thyme+: Temporal hypergraph motifs and fast algorithms for exact counting,” in ICDM, 2021.
  18. A. R. Benson, D. F. Gleich, and J. Leskovec, “Higher-order organization of complex networks,” Science, vol. 353, no. 6295, pp. 163–166, 2016.
  19. G. AbuOda, G. De Francisci Morales, and A. Aboulnaga, “Link prediction via higher-order motif features,” in ECML/PKDD, 2020.
  20. J. Feng and S. Chen, “Link prediction based on orbit counting and graph auto-encoder,” IEEE Access, vol. 8, pp. 226 773–226 783, 2020.
  21. H. Moon, H. Kim, S. Kim, and K. Shin, “Code, datasets, and appendix,” https://github.com/hhyy0401/CODA, 2023.
  22. H. Ajemni, R. El Harrabi, and M. N. Abdelkrim, “Modeling of chemical reaction kinetics using hypergraph tools,” in CISTEM, 2014.
  23. N. Pearcy, J. J. Crofts, and N. Chuzhanova, “Hypergraph models of metabolism,” IJABE, vol. 8, no. 8, pp. 752–756, 2014.
  24. S. Ranshous, C. A. Joslyn, S. Kreyling, K. Nowak, N. F. Samatova, C. L. West, and S. Winters, “Exchange pattern mining in the bitcoin transaction directed hypergraph,” in FC, 2017.
  25. N. Yadati, T. Gao, S. Asoodeh, P. Talukdar, and A. Louis, “Graph neural networks for soft semi-supervised learning on hypergraphs,” in PAKDD, 2021.
  26. C. Comrie and J. Kleinberg, “Hypergraph ego-networks and their temporal evolution,” in ICDM, 2021.
  27. A. R. Benson, R. Kumar, and A. Tomkins, “Sequences of sets,” in KDD, 2018.
  28. G. Lee, M. Choe, and K. Shin, “How do hyperedges overlap in real-world hypergraphs?-patterns, measures, and generators,” in WWW, 2021.
  29. M. T. Do, S.-e. Yoon, B. Hooi, and K. Shin, “Structural patterns and generative models of real-world hypergraphs,” in KDD, 2020.
  30. T. Gao, W. Peng, D. Sisodia, T. K. Saha, F. Li, and M. Al Hasan, “Android malware detection via graphlet sampling,” IEEE Trans. Mob., vol. 18, no. 12, pp. 2754–2767, 2018.
  31. T. Hočevar and J. Demšar, “A combinatorial approach to graphlet counting,” Bioinformatics, vol. 30, no. 4, pp. 559–565, 2014.
  32. N. K. Ahmed, J. Neville, R. A. Rossi, and N. Duffield, “Efficient graphlet counting for large networks,” in ICDM, 2015.
  33. A. Pinar, C. Seshadhri, and V. Vishal, “Escape: Efficiently counting all 5-vertex subgraphs,” in WWW, 2017.
  34. M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, and A. Panconesi, “Counting graphlets: Space vs time,” in WSDM, 2017.
  35. ——, “Motif counting beyond five nodes,” ACM Transactions on Knowledge Discovery from Data, vol. 12, no. 4, pp. 1–25, 2018.
  36. M. Bressan, S. Leucci, and A. Panconesi, “Motivo: Fast motif counting via succinct color coding and adaptive sampling,” PVLDB, vol. 12, no. 11, pp. 1651–1663, 2019.
  37. G. Lee, S. Yoon, J. Ko, H. Kim, and K. Shin, “Hypergraph motifs and their extensions beyond binary,” arXiv preprint arXiv:2310.15668, 2023.
  38. P. S. Chodrow, “Configuration models of random hypergraphs,” Journal of Complex Networks, vol. 8, no. 3, p. cnaa018, 2020.
  39. W. Hoeffding, “Probability inequalities for sums of bounded random variables,” The collected works of Wassily Hoeffding, pp. 409–426, 1994.
  40. P. W. Holland and S. Leinhardt, “A method for detecting structure in sociometric data,” in Social Networks.   Elsevier, 1977, pp. 411–432.
  41. V. Batagelj and A. Mrvar, “A subquadratic triad census algorithm for large sparse networks with small maximum degree,” Social Networks, vol. 23, no. 3, pp. 237–243, 2001.
  42. P. Patil, G. Sharma, and M. N. Murty, “Negative sampling for hyperlink prediction in networks,” in PAKDD, 2020.
  43. A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in KDD, 2016.
  44. J. Huang, C. Chen, F. Ye, J. Wu, Z. Zheng, and G. Ling, “Hyper2vec: Biased random walk for hyper-network embedding,” in DASFAA, 2019.
  45. J. Payne, “Deep hyperedges: a framework for transductive and inductive learning on hypergraphs,” arXiv preprint arXiv:1910.02633, 2019.
  46. F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, “Scikit-learn: Machine learning in Python,” JMLR, vol. 12, pp. 2825–2830, 2011.
  47. T. Chen and C. Guestrin, “Xgboost: A scalable tree boosting system,” in KDD, 2016.
  48. G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, and T.-Y. Liu, “Lightgbm: A highly efficient gradient boosting decision tree,” in NeurIPS, 2017.
  49. Y. Feng, H. You, Z. Zhang, R. Ji, and Y. Gao, “Hypergraph neural networks,” in AAAI, 2019.
  50. N. Yadati, M. Nimishakavi, P. Yadav, V. Nitin, A. Louis, and P. Talukdar, “Hypergcn: A new method for training graph convolutional networks on hypergraphs,” in NeurIPS, 2019.
  51. J. Huang and J. Yang, “Unignn: a unified framework for graph and hypergraph neural networks,” in IJCAI, 2021.
Citations (4)
View on Semantic Scholar

Summary

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

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