{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:59Z","timestamp":1750220399283,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["20K11940,18K11441"],"award-info":[{"award-number":["20K11940,18K11441"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,8]]},"DOI":"10.1145\/3487351.3488275","type":"proceedings-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T20:40:12Z","timestamp":1642624812000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient analytical computation of expected frequency of motifs of small size by marginalization in uncertain network"],"prefix":"10.1145","author":[{"given":"Takayasu","family":"Fushimi","sequence":"first","affiliation":[{"name":"Tokyo University of Technology, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazumi","family":"Saito","sequence":"additional","affiliation":[{"name":"Kanagawa University, Japan and RIKEN, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[{"name":"Osaka University, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_2_1","first-page":"165","volume-title":"ser. WABI'05","author":"Wernicke S.","year":"2005","unstructured":"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."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2007.02.102"},{"key":"e_1_3_2_1_4_1","first-page":"92","volume-title":"RECOMB'07","author":"Grochow J. A.","year":"2007","unstructured":"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."},{"key":"e_1_3_2_1_5_1","first-page":"1431","volume-title":"WWW '17. Republic and Canton of Geneva, CHE: International World Wide Web Conferences Steering Committee","author":"Pinar A.","year":"2017","unstructured":"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."},{"key":"e_1_3_2_1_6_1","first-page":"590","volume-title":"Methods to determine node centrality and clustering in graphs with uncertain structure,\" in Proceedings of the Fifth International Conference on Weblogs and Social Media","author":"Pfeiffer J. J.","year":"2011","unstructured":"J. J. Pfeiffer and J. Neville , \" Methods to determine node centrality and clustering in graphs with uncertain structure,\" in Proceedings of the Fifth International Conference on Weblogs and Social Media . The AAAI Press , 2011 , pp. 590 -- 593 . J. J. Pfeiffer and J. Neville, \"Methods to determine node centrality and clustering in graphs with uncertain structure,\" in Proceedings of the Fifth International Conference on Weblogs and Social Media. The AAAI Press, 2011, pp. 590--593."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002941"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020569"},{"key":"e_1_3_2_1_9_1","first-page":"459","volume-title":"Dec 2012","author":"Liu L.","unstructured":"L. Liu , R. Jin , C. Aggarwal , and Y. Shen , \" Reliable clustering on uncertain graphs,\" in 2012 IEEE 12th International Conference on Data Mining , Dec 2012 , pp. 459 -- 468 . L. Liu, R. Jin, C. Aggarwal, and Y. Shen, \"Reliable clustering on uncertain graphs,\" in 2012 IEEE 12th International Conference on Data Mining, Dec 2012, pp. 459--468."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164135.3164143"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080794"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364330"},{"key":"e_1_3_2_1_13_1","first-page":"1","volume-title":"Efficient graphlet counting for large networks,\" in 2015 IEEE International Conference on Data Mining","author":"Ahmed N. K.","year":"2015","unstructured":"N. K. Ahmed , J. Neville , R. A. Rossi , and N. Duffield , \" Efficient graphlet counting for large networks,\" in 2015 IEEE International Conference on Data Mining , 2015 , pp. 1 -- 10 . N. K. Ahmed, J. Neville, R. A. Rossi, and N. Duffield, \"Efficient graphlet counting for large networks,\" in 2015 IEEE International Conference on Data Mining, 2015, pp. 1--10."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021940"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.2945228"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4137\/CIN.S4744"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0114503"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms3241"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808719.2808731"},{"key":"e_1_3_2_1_23_1","first-page":"217","volume-title":"The enron corpus: A new dataset for email classification research,\" in Machine Learning: ECML","author":"Klimt B.","year":"2004","unstructured":"B. Klimt and Y. Yang , \" The enron corpus: A new dataset for email classification research,\" in Machine Learning: ECML 2004 , J.-F. Boulicaut, F. Esposito, F. Giannotti, and D. Pedreschi, Eds . Berlin, Heidelberg : Springer Berlin Heidelberg , 2004, pp. 217 -- 226 . B. Klimt and Y. Yang, \"The enron corpus: A new dataset for email classification research,\" in Machine Learning: ECML 2004, J.-F. Boulicaut, F. Esposito, F. Giannotti, and D. Pedreschi, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 217--226."}],"event":{"name":"ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Virtual Event Netherlands","acronym":"ASONAM '21"},"container-title":["Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3488275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487351.3488275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:48Z","timestamp":1750191528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3488275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":23,"alternative-id":["10.1145\/3487351.3488275","10.1145\/3487351"],"URL":"https:\/\/doi.org\/10.1145\/3487351.3488275","relation":{},"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"2022-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}