Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network-Reference-Cited by-同舟云学术

Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network

Published:2021-11-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
language:
Short-container-title:

Author:

Fushimi Takayasu¹,Saito Kazumi²,Motoda Hiroshi³

Affiliation:

1. Tokyo University of Technology, Japan

2. Kanagawa University, Japan and RIKEN, Japan

3. Osaka University, Japan

Funder

JSPS KAKENHI

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3487351.3488275

Reference23 articles.

1. Network Motifs: Simple Building Blocks of Complex Networks

2. S. Wernicke , " A faster algorithm for detecting network motifs," in Proceedings of the 5th International Conference on Algorithms in Bioinformatics , ser. WABI'05 . Berlin, Heidelberg : Springer-Verlag , 2005 , pp. 165 -- 177 . S. Wernicke, "A faster algorithm for detecting network motifs," in Proceedings of the 5th International Conference on Algorithms in Bioinformatics, ser. WABI'05. Berlin, Heidelberg: Springer-Verlag, 2005, pp. 165--177.

3. An optimal algorithm for counting network motifs

4. J. A. Grochow and M. Kellis , " Network motif discovery using subgraph enumeration and symmetry-breaking," in Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology, ser . RECOMB'07 . Berlin, Heidelberg : Springer-Verlag, 2007 , pp. 92 -- 106 . J. A. Grochow and M. Kellis, "Network motif discovery using subgraph enumeration and symmetry-breaking," in Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology, ser. RECOMB'07. Berlin, Heidelberg: Springer-Verlag, 2007, pp. 92--106.

5. A. Pinar , C. Seshadhri , and V. Vishal , " Escape: Efficiently counting all 5-vertex subgraphs," in Proceedings of the 26th International Conference on World Wide Web, ser . WWW '17. Republic and Canton of Geneva, CHE: International World Wide Web Conferences Steering Committee , 2017 , pp. 1431 -- 1440 . A. Pinar, C. Seshadhri, and V. Vishal, "Escape: Efficiently counting all 5-vertex subgraphs," in Proceedings of the 26th International Conference on World Wide Web, ser. WWW '17. Republic and Canton of Geneva, CHE: International World Wide Web Conferences Steering Committee, 2017, pp. 1431--1440.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Personalized privacy-preserving semi-centralized recommendation system in a social network;Proceedings of the International Conference on Advances in Social Networks Analysis and Mining;2023-11-06

2. Social network mining and analytics for quantitative patterns;Proceedings of the International Conference on Advances in Social Networks Analysis and Mining;2023-11-06

3. Generalized Universal Domain Adaptation with Generative Flow Networks;Proceedings of the 31st ACM International Conference on Multimedia;2023-10-26

4. Universal Domain Adaptive Network Embedding for Node Classification;Proceedings of the 31st ACM International Conference on Multimedia;2023-10-26

5. Efficient computation of expected motif frequency in uncertain graphs by exploiting possible world marginalization and motif transition;Social Network Analysis and Mining;2022-09-03