Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Betweenness Approximation for Edge Computing with Hypergraph Neural Network (2203.03958v2)

Published 8 Mar 2022 in cs.SI

Abstract: Edge computing is highly demanded to achieve their full potentials Internet of Things (IoT), since various IoT systems have been generating big data facilitating modern latency-sensitive applications. As a basic problem, network dismantling tries to find an optimal set of nodes of which will maximize the connectivity degradation in a network. However, current approaches mainly focus on simple networks modeling only pairwise interactions between two nodes, while higher order groupwise interactions among arbitrary number of nodes are ubiquitous in real world which can be better modeled as hypernetwork. The structural difference between simple network and hypernetwork restricts the direct application of simple network dismantling methods to hypernetwork. Even though some hypernetwork centrality measures such as betweenness can be used for hypernetwork dismantling, they face the problem of balancing effectiveness and efficiency. Therefore, we propose a betweenness approximation-based hypernetwork dismantling method with hypergraph neural network, namely HND. HND trains a transferable hypergraph neural network-based regression model on plenty of generated small-scale synthetic hypernetwork in a supervised way, and utilizes the well-trained model to approximate nodes' betweenness. Extensive experiments on five real hypernetworks demonstrate the effectiveness and efficiency of HND comparing with various baselines.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. L. Qi, Y. Liu, Y. Zhang, X. Zhang, M. Bilal, and H. Song, “Privacy-aware point-of-interest category recommendation in internet of things,” IEEE Internet of Things Journal, vol. 9, no. 21, pp. 21 398–21 408, 2022.
  2. Y. Liu, D. Li, S. Wan, F. Wang, W. Dou, X. Xu, S. Li, R. Ma, and L. Qi, “A long short-term memory-based model for greenhouse climate prediction,” International Journal Of Intelligent Systems, vol. 37, no. 1, pp. 135–151, 2022.
  3. Q. Wang, C. Zhu, Y. Zhang, H. Zhong, J. Zhong, V.S. Sheng, “Short text topic learning using heterogeneous information network,”IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 0, pp. 5269–5281, 2023.
  4. D. Li and J. Liu, “Modeling influence diffusion over signed social networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 2, pp. 613–625, 2021.
  5. W. Luo, D. Zhang, L. Ni, and N. Lu, “Multiscale local community detection in social networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 3, pp. 1102–1112, 2021.
  6. X. Yin, X. Hu, Y. Chen, X. Yuan, and B. Li, “Signed-pagerank: An efficient influence maximization framework for signed social networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 5, pp. 2208–2222, 2021.
  7. D. Liu, C. K. Tse, and X. Zhang, “Robustness assessment and enhancement of power grids from a complex network?s perspective using decision trees,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66, no. 5, pp. 833–837, 2019.
  8. H. Tu, Y. Xia, H. H.-C. Iu, and X. Chen, “Optimal robustness in power grids from a network science perspective,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66, no. 1, pp. 126–130, 2019.
  9. Z. Chen, B. Yao, Z.-J. Wang, X. Gao, S. Shang, S. Ma, and M. Guo, “Flexible aggregate nearest neighbor queries and its keyword-aware variant on road networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 12, pp. 3701–3715, 2021.
  10. H. Pei, Y. Zhang, Q. Tao, S. Feng, and L. Li, “Distributed cooperative driving in multi-intersection road networks,” IEEE Transactions on Vehicular Technology, vol. 70, no. 6, pp. 5390–5403, 2021.
  11. A. Braunstein, L. Dall’Asta, G. Semerjian, and L. Zdeborová, “Network dismantling,” Proceedings of the National Academy of Sciences, vol. 113, no. 44, pp. 12 368–12 373, 2016.
  12. M. Doostmohammadian, H. R. Rabiee, and U. A. Khan, “Centrality-based epidemic control in complex social networks,” Social Network Analysis and Mining, vol. 10, no. 1, pp. 32:1–32:11, 2020.
  13. D. Kempe, J. Kleinberg, and E. Tardos, “Maximizing the spread of influence through a social network,” in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, D.C., USA, 2003, pp. 137–146.
  14. X.-L. Ren, N. Gleinig, D. Helbing, and N. Antulov-Fantulin, “Generalized network dismantling,” Proceedings of the National Academy of Sciences, vol. 116, no. 14, pp. 6554–6559, 2019.
  15. C. Fan, L. Zeng, Y. Sun, and Y.-Y. Liu, “Finding key players in complex networks through deep reinforcement learning,” Nature Machine Intelligence, vol. 2, pp. 317–324, 2020.
  16. F. Battiston, G. Cencetti, I. Iacopini, V. Latora, M. Lucas, A. Patania, J.-G. Young, and G. Petri, “Networks beyond pairwise interactions: Structure and dynamics,” Physics Reports, vol. 874, pp. 1–92, 2020.
  17. C. Fan, L. Zeng, Y. Ding, M. Chen, Y. Sun, and Z. Liu, “Learning to identify high betweenness centrality nodes from scratch: A novel graph neural network approach,” in Proceedings of the 28th ACM International Conference on Information and Knowledge Management, New York, USA, 2019, p. 559?568.
  18. S. K. Maurya, X. Liu, and T. Murata, “Graph neural networks for fast node ranking approximation,” ACM Transactions on Knowledge Discovery from Data, vol. 15, no. 5, pp. 1556–4681, 2021.
  19. F. Morone and H. A. Makse, “Influence maximization in complex networks through optimal percolation,” Nature, vol. 524, pp. 65–68, 2015.
  20. L. Zdeborova, P. Zhang, and H.-J. Zhou, “Fast and simple decycling and dismantling of networks,” Scientific Reports, vol. 6, no. 1, p. 37954, 2016.
  21. S. Mugisha and H.-J. Zhou, “Identifying optimal targets of network attack by belief propagation,” Physical Review E, vol. 94, no. 1, p. 012305, 2016.
  22. M. Grassia, M. De Domenico, and G. Mangioni, “Machine learning dismantling and early-warning signals of disintegration in complex systems,” Nature Communications, vol. 12, no. 1, p. 5190, 2021.
  23. D. Yan, W. Xie, Y. Zhang, Q. He, and Y. Yang, “Hypernetwork dismantling via deep reinforcement learning,” IEEE Transactions on Network Science and Engineering, 2022.
  24. T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in 5th International Conference on Learning Representations, Toulon, France, 2017.
  25. Y. Liu, H. Wu, K. Rezaee, M. R. Rezaee, O. I. Khalaf, A. A. Khan, D. Ramesh, and L. Qi, “Interaction-enhanced and time-aware graph convolutional network for successive point-of-interest recommendation in traveling enterprises,” IEEE Transactions on Industrial Informatics, vol. 19, no. 1, pp. 635–643, 2023.
  26. P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in 6th International Conference on Learning Representations, Vancouver, BC, Canada, 2018.
  27. W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems, Long Beach, CA, USA, 2017, pp. 1024–1034.
  28. X. Wang, X. He, M. Wang, F. Feng, and T.-S. Chua, “Neural graph collaborative filtering,” in Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Paris, France, 2019, p. 165?174.
  29. X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, “Lightgcn: Simplifying and powering graph convolution network for recommendation,” in Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2020, p. 639?648.
  30. T. Chen and R. C.-W. Wong, “Handling information loss of graph neural networks for session-based recommendation,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, 2020, p. 1172?1180.
  31. W. Chen, Y. Gu, Z. Ren, X. He, H. Xie, T. Guo, D. Yin, and Y. Zhang, “Semi-supervised user profiling with heterogeneous graph attention networks,” in Proceedings of the 28th International Joint Conference on Artificial Intelligence, 2019, pp. 2116–2122.
  32. D. Wang, P. Wang, K. Liu, Y. Zhou, C. E. Hughes, and Y. Fu, “Reinforced imitative graph representation learning for mobile user profiling: An adversarial training perspective,” in Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 4410–4417.
  33. Y. Feng, H. You, Z. Zhang, R. Ji, and Y. Gao, “Hypergraph neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence, Honolulu, Hawaii, USA, 2019, pp. 3558–3565.
  34. 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 Advances in Neural Information Processing Systems, Vancouver, BC, Canada, 2019, pp. 1511–1522.
  35. J. Huang and J. Yang, “Unignn: a unified framework for graph and hypergraph neural networks,” in Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021, pp. 2563–2569.
  36. K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in 7th International Conference on Learning Representations, New Orleans, LA, USA, 2019.
  37. M. T. Do, S.-E. Yoon, B. Hooi, and K. Shin, “Structural patterns and generative models of real-world hypergraphs,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, 2020, p. 176?186.
  38. Y. Kook, J. Ko, and K. Shin, “Evolution of real-world hypergraphs: Patterns and models without oracles,” in IEEE International Conference on Data Mining, 2020, pp. 272–281.
  39. S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt T., “Bpr: Bayesian personalized ranking from implicit feedback,” in Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, 2009, p. 452?461.
  40. D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in 3rd International Conference on Learning Representations, San Diego, CA, USA, 2015.
  41. A. Sinha, Z. Shen, Y. Song, H. Ma, D. Eide, B.-J. P. Hsu, and K. Wang, “An overview of microsoft academic service (MAS) and applications,” in Proceedings of the 24th International Conference on World Wide Web, Florence, Italy, 2015, p. 243?246.
  42. A. R. Benson, R. Abebe, M. T. Schaub, A. Jadbabaie, and J. Kleinberg, “Simplicial closure and higher-order link prediction,” Proceedings of the National Academy of Sciences, vol. 115, no. 48, pp. E11 221–E11 230, 2018.
  43. A. Antelmi, G. Cordasco, C. Spagnuolo, and P. Szufel, “Social influence maximization in hypergraphs,” Entropy, vol. 23, no. 7, p. 796, 2021.
  44. C. M. Schneider, A. A. Moreira, J. S. Andrade, S. Havlin, and H. J. Herrmann, “Mitigation of malicious attacks on networks,” Proceedings of the National Academy of Sciences, vol. 108, no. 10, pp. 3838–3841, 2011.
  45. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
Citations (1)
View on Semantic Scholar

Summary

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

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