Heterogeneous Network Motif Coding, Counting, and Profiling
Authors: 
Shuo Yu, Feng Xia, Honglong Chen, Ivan Lee, 
Lianhua Chi, Hanghang Tong Associate Editor: Shuiwang JiAuthors Info & Claims
Shuo Yu, Feng Xia, Honglong Chen, Ivan Lee, Lianhua Chi, Hanghang Tong Associate Editor: Shuiwang JiAuthors Info & ClaimsArticle No.: 231, Pages 1 - 21
Abstract
Network motifs, as a fundamental higher-order structure in large-scale networks, have received significant attention over recent years. Particularly in heterogeneous networks, motifs offer a higher capacity to uncover diverse information compared to homogeneous networks. However, the structural complexity and heterogeneity pose challenges in coding, counting, and profiling heterogeneous motifs. This work addresses these challenges by first introducing a novel heterogeneous motif coding method, adaptable to homogeneous motifs as well. Building upon this coding framework, we then propose GIFT, a heterogeneous network motif counting algorithm. GIFT effectively leverages combined structures of heterogeneous motifs through three key procedures: neighborhood searching, motif combination, and redundant motif filtering. We apply GIFT to count three-order and four-order motifs across eight distinct heterogeneous networks. Subsequently, we profile these detected motifs using four classical motif-based indicators. Experimental results demonstrate that by appropriately selecting motifs tailored to specific networks, heterogeneous motifs emerge as significant features in characterizing the underlying network structure.
References
[1]
Nesreen K. Ahmed, Jennifer Neville, Ryan A. Rossi, and Nick Duffield. 2015. Efficient Graphlet Counting for Large Networks. In Proceedings of the IEEE International Conference on Data Mining, 1–10.
[2]
Xiaomei Bai, Fuli Zhang, Jiaying Liu, and Feng Xia. 2023. Quantifying the impact of scientific collaboration and papers via motif-based heterogeneous networks. Journal of Informetrics 17, 2 (2023), 101397.
[3]
Timothy L. Bailey. 2021. STREME: Accurate and versatile sequence motif discovery. Bioinformatics 37, 18 (2021), 2834–2840.
[4]
Hayat Dino Bedru, Shuo Yu, Xinru Xiao, Da Zhang, Liangtian Wan, He Guo, and Feng Xia. 2020. Big networks: A survey. Computer Science Review 37 (2020), 100247.
[5]
Maciej Besta, Raphael Grob, Cesare Miglioli, Nicola Bernold, Grzegorz Kwasniewski, Gabriel Gjini, Raghavendra Kanakagiri, Saleh Ashkboos, Lukas Gianinazzi, Nikoli Dryden, and Torsten Hoefler. 2022. Motif prediction with graph neural networks. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 35–45.
[6]
Giorgos Bouritsas, Fabrizio Frasca, Stefanos Zafeiriou, and Michael M Bronstein. 2022. Improving graph neural network expressivity via subgraph isomorphism counting. IEEE Transactions on Pattern Analysis and Machine Intelligence 45, 1 (2022), 657–668.
[7]
Marco Bressan, Stefano Leucci, and Alessandro Panconesi. 2021. Faster motif counting via succinct color coding and adaptive sampling. ACM Transactions on Knowledge Discovery from Data 15, 6 (May 2021), Article 96, 27 pages. DOI:
[8]
Zhongqiang Gao, Chuanqi Cheng, Yanwei Yu, Lei Cao, Chao Huang, and Junyu Dong. 2022. Scalable motif counting for large-scale temporal graphs. In Proceedings of the IEEE 38th International Conference on Data Engineering (ICDE), 2656–2668. DOI:
[9]
Shawn Gu, John Johnson, Fazle E. Faisal, and Tijana Milenković. 2018. From homogeneous to heterogeneous network alignment via colored graphlets. Scientific Reports 8, 1 (2018), 12524.
[10]
Himanshu and Sarika Jain. 2017. Impact of memory space optimization technique on fast network motif search algorithm. In Proceedings of the International Conference on Computational Science: Advances in Computer and Computational Sciences, Vol. 1, 559–567.
[11]
Qian Hu, Fan Lin, Beizhan Wang, and Chunyan Li. 2022. MBRep: Motif-based representation learning in heterogeneous networks. Expert Systems with Applications 190 (2022), 116031.
[12]
Ling Huang, Chang-Dong Wang, and Hong-Yang Chao. 2018. A harmonic motif modularity approach for multi-layer network community detection. In Proceedings of the IEEE International Conference on Data Mining, 1043–1048. DOI:
[13]
Jiawei Jiang, Yusong Hu, Xiaosen Li, Wen Ouyang, Zhitao Wang, Fangcheng Fu, and Bin Cui. 2022. Analyzing online transaction networks with network motifs. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 3098–3106.
[14]
Penghang Liu, Valerio Guarrasi, and Ahmet Erdem Sariyüce. 2022. Temporal network motifs: Models, limitations, evaluation. In Proceedings of the IEEE 38th International Conference on Data Engineering, 1531–1532.
[15]
Yafang Liu, Aiwen Li, An Zeng, Jianlin Zhou, Ying Fan, and Zengru Di. 2024. Motif-based community detection in heterogeneous multilayer networks. Scientific Reports 14, 1 (2024), 8769.
[16]
Quintino Francesco Lotito, Federico Musciotto, Alberto Montresor, and Federico Battiston. 2022. Higher-order motif analysis in hypergraphs. Communications Physics 5, 1 (2022), 79.
[17]
D. Marcus and Y. Shavitt. 2012. RAGE – A rapid graphlet enumerator for large networks. Computer Networks 56, 2 (2012), 810–819.
[18]
Ine Melckenbeeck, Pieter Audenaert, Didier Colle, and Mario Pickavet. 2018. Efficiently counting all orbits of graphlets of any order in a graph using autogenerated equations. Bioinformatics 34, 8 (2018), 1372–1380.
[19]
Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: Simple building blocks of complex networks. Science 298, 5594 (2002), 824–827.
[20]
Mohammad Matin Najafi, Chenhao Ma, Xiaodong Li, Reynold Cheng, and Laks V. S. Lakshmanan. 2023. MOSER: Scalable network motif discovery using serial test. Proceedings of the VLDB Endowment 17, 3 (Nov 2023), 591–603. DOI:
[21]
Pavel V. Paulau, Christoph Feenders, and Bernd Blasius. 2015. Motif analysis in directed ordered networks and applications to food webs. Scientific Reports 5, 1 (2015), 11926.
[22]
Ali Pinar, C. Seshadhri, and Vaidyanathan Vishal. 2017. Escape: Efficiently counting all 5-vertex subgraphs. In Proceedings of the 26th International Conference on World Wide Web, 1431–1440.
[23]
Samuel Rey, T. Mitchell Roddenberry, Santiago Segarra, and Antonio G. Marques. 2023. Enhanced graph-learning schemes driven by similar distributions of motifs. IEEE Transactions on Signal Processing (2023).
[24]
Pedro Ribeiro, Pedro Paredes, Miguel E. P. Silva, David Aparicio, and Fernando Silva. 2022. A survey on subgraph counting: Concepts, algorithms, and applications to network motifs and graphlets. ACM Computing Surveys 54, 2 (Mar 2022), Article 28, 36 pages. DOI:
[25]
Ryan A. Rossi, Nesreen K. Ahmed, Aldo Carranza, David Arbour, Anup Rao, Sungchul Kim, and Eunyee Koh. 2019. Heterogeneous network motifs. arXiv:1901.10026. Retrieved from https://arxiv.org/abs/1901.10026
[26]
Ryan A. Rossi, Nesreen K. Ahmed, Aldo Carranza, David Arbour, Anup Rao, Sungchul Kim, and Eunyee Koh. 2020. Heterogeneous graphlets. ACM Transactions on Knowledge Discovery from Data 15, 1 (2020), 1–43.
[27]
Ping Shao, Yang Yang, Shengyao Xu, and Chunping Wang. 2021. Network embedding via motifs. ACM Transactions on Knowledge Discovery from Data 16, 3 (2021), 1–20.
[28]
Lorenzo De Stefani, Erisa Terolli, and Eli Upfal. 2021. Tiered sampling: An efficient method for counting sparse motifs in massive graph streams. ACM Transactions on Knowledge Discovery from Data 15, 5 (2021), 1–52.
[29]
Alexandru Topirceanu, Alexandra Duma, and Mihai Udrescu. 2016. Uncovering the fingerprint of online social networks using a network motif based approach. Computer Communications 73 (2016), 167–175.
[30]
Huiling Tu, Shuo Yu, Vidya Saikrishna, Feng Xia, and Karin Verspoor. 2023. Deep outdated fact detection in knowledge graphs. In Proceedings of the IEEE International Conference on Data Mining Workshops (ICDMW), 1443–1452.
[31]
Chenxu Wang, Minnan Luo, Zhen Peng, Yixiang Dong, and Huaping Liu. 2023. Heterogeneous graph attention network with motif clique. Neurocomputing 555 (2023), 126608. DOI:
[32]
Huan Wang, Guoquan Liu, and Po Hu. 2024. TDAN: Transferable domain adversarial network for link prediction in heterogeneous social networks. ACM Transactions on Knowledge Discovery from Data 18, 1 (2024), Article 11, 22 pages. DOI:
[33]
Jingjing Wang, Yanhao Wang, Wenjun Jiang, Yuchen Li, and Kian-Lee Tan. 2020. Efficient sampling algorithms for approximate temporal motif counting. In Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM ’20), 1505–1514. DOI:
[34]
Fang Wu, Dragomir Radev, and Stan Z. Li. 2023. Molformer: Motif-based transformer on 3D heterogeneous molecular graphs. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37, 5312–5320.
[35]
Feng Xia, Haoran Wei, Shuo Yu, Da Zhang, and Bo Xu. 2019. A survey of measures for network motifs. IEEE Access 7 (2019), 106576–106587.
[36]
Feng Xia, Shuo Yu, Chengfei Liu, Jianxin Li, and Ivan Lee. 2021. CHIEF: Clustering with higher-order motifs in big networks. IEEE Transactions on Network Science and Engineering 9, 3 (2021), 990–1005.
[37]
Jin Xu, Shuo Yu, Ke Sun, Jing Ren, Ivan Lee, Shirui Pan, and Feng Xia. 2020. Multivariate relations aggregation learning in social networks. In Proceedings of the ACM/IEEE Joint Conference on Digital Libraries in 2020 (JCDL’20), 77–86. DOI:
[38]
Pengwei Yan, Kaisong Song, Zhuoren Jiang, Yangyang Kang, Tianqianjin Lin, Changlong Sun, and Xiaozhong Liu. 2024. Empowering dual-level graph self-supervised pretraining with motif discovery. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38, 9223–9231.
[39]
Carl Yang, Yuxin Xiao, Yu Zhang, Yizhou Sun, and Jiawei Han. 2022. Heterogeneous network representation learning: A unified framework with survey and benchmark. IEEE Transactions on Knowledge and Data Engineering 34, 10 (2022), 4854–4873. DOI:
[40]
Shuo Yu, Jin Xu, Chen Zhang, Feng Xia, Zafer Almakhadmeh, and Amr Tolba. 2019. Motifs in big networks: Methods and applications. IEEE Access 7 (2019), 183322–183338.
[41]
Tengchan Zeng, Omid Semiari, Walid Saad, and My T. Thai. 2019. Spatial motifs for device-to-device network analysis in cellular networks. IEEE Transactions on Communications 67, 8 (2019), 5474–5489.
[42]
Giselle Zeno, Timothy La Fond, and Jennifer Neville. 2020. Dynamic network modeling from motif-activity. In Companion Proceedings of the Web Conference, 390–397.
[43]
Shuangquan Zhang, Xiaotian Wu, Zhichao Lian, Chunman Zuo, and Yan Wang. 2024. GNNMF: A multi-view graph neural network for ATAC-seq motif finding. BMC Genomics 25, 1 (2024), 300.
Index Terms
- Heterogeneous Network Motif Coding, Counting, and Profiling
Recommendations
Network motif & triad significance profile analyses on software system
There has been considerable recent interest in network motif for understanding network local features, as well as the growth and evolution mechanisms. In order to discover the local features in software networks, we extended the network motif research ...
NemoLib: Network Motif Libraries for Network Motif Detection and Analysis
Bioinformatics Research and ApplicationsAbstractNetwork motifs are frequent and unique subgraph patterns located inside networks, and have been applied to solve various biological problems. Due to the high computational costs of performing network motif analysis, various tools have been created ...
Comments
Information & Contributors
Information
Published In
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 30 October 2024
Online AM: 28 August 2024
Accepted: 20 July 2024
Revised: 04 May 2024
Received: 20 October 2022
Published in TKDD Volume 18, Issue 9
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- National Natural Science Foundation of China
- SMP-IDATA Open Youth
- Fundamental Research Funds for the Central Universities
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 147Total Downloads
- Downloads (Last 12 months)147
- Downloads (Last 6 weeks)54
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in