{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T02:09:11Z","timestamp":1773194951073,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":66,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T00:00:00Z","timestamp":1548806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1830274"],"award-info":[{"award-number":["DMS-1830274"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,1,30]]},"DOI":"10.1145\/3289600.3290988","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T12:33:01Z","timestamp":1552307581000},"page":"294-302","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Sampling Methods for Counting Temporal Motifs"],"prefix":"10.1145","author":[{"given":"Paul","family":"Liu","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Austin R.","family":"Benson","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Moses","family":"Charikar","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,1,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The CAIDA UCSD Anonymized Internet Traces -- February 17 2011. http:\/\/www.caida.org\/data\/passive\/passive_dataset.xml.  The CAIDA UCSD Anonymized Internet Traces -- February 17 2011. http:\/\/www.caida.org\/data\/passive\/passive_dataset.xml."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623757"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"e_1_3_2_1_4_1","volume-title":"Workshop on Large-scale Data Mining: Theory and Applications","volume":"10","author":"Avron H.","year":"2010","unstructured":"H. Avron . Counting triangles in large graphs using randomized matrix trace estimation . In Workshop on Large-scale Data Mining: Theory and Applications , volume 10 , 2010 . H. Avron. Counting triangles in large graphs using randomized matrix trace estimation. In Workshop on Large-scale Data Mining: Theory and Applications, volume 10, 2010."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4979282"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9029"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_1_8_1","volume-title":"Data mining curriculum: A proposal","author":"Chakrabarti S.","year":"2006","unstructured":"S. Chakrabarti , M. Ester , U. Fayyad , J. Gehrke , J. Han , S. Morishita , G. Piatetsky-Shapiro , and W. Wang . Data mining curriculum: A proposal . Intensive Working Group of ACM SIGKDD Curriculum Committee , 140, 2006 . S. Chakrabarti, M. Ester, U. Fayyad, J. Gehrke, J. Han, S. Morishita, G. Piatetsky-Shapiro, and W. Wang. Data mining curriculum: A proposal. Intensive Working Group of ACM SIGKDD Curriculum Committee, 140, 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.0233"},{"key":"e_1_3_2_1_10_1","volume-title":"BMC Bioinformatics","author":"Dobrin R.","year":"2004","unstructured":"R. Dobrin , Q. Beg , A.-L. Barab\u00e1 si, and Z. Oltvai . Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network . BMC Bioinformatics , 2004 . R. Dobrin, Q. Beg, A.-L. Barab\u00e1 si, and Z. Oltvai. Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network. BMC Bioinformatics, 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1054389"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883082"},{"key":"e_1_3_2_1_13_1","first-page":"1954","volume-title":"Advances in Neural Information Processing Systems","author":"Farajtabar M.","year":"2015","unstructured":"M. Farajtabar , Y. Wang , M. G. Rodriguez , S. Li , H. Zha , and L. Song . Coevolve: A joint point process model for information diffusion and network co-evolution . In Advances in Neural Information Processing Systems , pages 1954 -- 1962 , 2015 . M. Farajtabar, Y. Wang, M. G. Rodriguez, S. Li, H. Zha, and L. Song. Coevolve: A joint point process model for information diffusion and network co-evolution. In Advances in Neural Information Processing Systems, pages 1954--1962, 2015."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"key":"e_1_3_2_1_15_1","volume-title":"Finding remarkably dense sequences of contacts in link streams. Social Network Analysis and Mining, 6(1), sep","author":"Gaumont N.","year":"2016","unstructured":"N. Gaumont , C. Magnien , and M. Latapy . Finding remarkably dense sequences of contacts in link streams. Social Network Analysis and Mining, 6(1), sep 2016 . N. Gaumont, C. Magnien, and M. Latapy. Finding remarkably dense sequences of contacts in link streams. Social Network Analysis and Mining, 6(1), sep 2016."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214507000000068"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737791"},{"key":"e_1_3_2_1_18_1","volume-title":"Data mining: concepts and techniques","author":"Han J.","year":"2011","unstructured":"J. Han , J. Pei , and M. Kamber . Data mining: concepts and techniques . Elsevier , 2011 . J. Han, J. Pei, and M. Kamber. Data mining: concepts and techniques. Elsevier, 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339723"},{"key":"e_1_3_2_1_20_1","volume-title":"ICWSM","author":"Hessel J.","year":"2016","unstructured":"J. Hessel , C. Tan , and L. Lee . Science, askscience, and badscience: On the coexistence of highly related communities . In ICWSM , 2016 . J. Hessel, C. Tan, and L. Lee. Science, askscience, and badscience: On the coexistence of highly related communities. In ICWSM, 2016."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2202-13-S1-P43"},{"key":"e_1_3_2_1_23_1","volume-title":"Bioinformatics","author":"Hulovatyy Y.","year":"2015","unstructured":"Y. Hulovatyy , H. Chen , and T. Milenkovi\u0107 . Exploring the structure and function of temporal networks with dynamic graphlets . Bioinformatics , 2015 . Y. Hulovatyy, H. Chen, and T. Milenkovi\u0107 . Exploring the structure and function of temporal networks with dynamic graphlets. Bioinformatics, 2015."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052636"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.92"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/12\/125003"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401945"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11267"},{"key":"e_1_3_2_1_29_1","volume-title":"Mech.: Theory and Experiment","author":"Kovanen L.","year":"2011","unstructured":"L. Kovanen , M. Karsai , K. Kaski , J. Kert\u00e9 sz, and J. Saram\"aki. Temporal motifs in time-dependent networks. J. of Stat . Mech.: Theory and Experiment , 2011 . L. Kovanen, M. Karsai, K. Kaski, J. Kert\u00e9 sz, and J. Saram\"aki. Temporal motifs in time-dependent networks. J. of Stat. Mech.: Theory and Experiment, 2011."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1307941110"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2007.368850"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of ICWSM","author":"Leskovec J.","year":"2010","unstructured":"J. Leskovec , D. P. Huttenlocher , and J. M. Kleinberg . Governance in social media: A case study of the wikipedia promotion process . In Proceedings of ICWSM , 2010 . J. Leskovec, D. P. Huttenlocher, and J. M. Kleinberg. Governance in social media: A case study of the wikipedia promotion process. In Proceedings of ICWSM, 2010."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.926194"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783285"},{"key":"e_1_3_2_1_36_1","volume-title":"A chronological edge-driven approach to temporal subgraph isomorphism. arXiv","author":"Mackey P.","year":"2018","unstructured":"P. Mackey , K. Porterfield , E. Fitzhenry , S. Choudhury , and G. Chin Jr . A chronological edge-driven approach to temporal subgraph isomorphism. arXiv , 2018 . P. Mackey, K. Porterfield, E. Fitzhenry, S. Choudhury, and G. Chin Jr. A chronological edge-driven approach to temporal subgraph isomorphism. arXiv, 2018."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2133841100"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S2-S13"},{"key":"e_1_3_2_1_40_1","volume-title":"Science","author":"Milo R.","year":"2004","unstructured":"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 , 2004 . 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, 2004."},{"key":"e_1_3_2_1_41_1","volume-title":"Science","author":"Milo R.","year":"2002","unstructured":"R. Milo , S. Shen-Orr , S. Itzkovitz , N. Kashtan , D. Chklovskii , and U. Alon . Network motifs: Simple building blocks of complex networks . Science , 2002 . R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 2002."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956831"},{"key":"e_1_3_2_1_43_1","volume-title":"Monte Carlo theory, methods and examples","author":"Owen A. B.","year":"2013","unstructured":"A. B. Owen . Monte Carlo theory, methods and examples . 2013 . A. B. Owen. Monte Carlo theory, methods and examples. 2013."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1543767.1543769"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"e_1_3_2_1_48_1","first-page":"197","volume-title":"Security and Privacy in Social Networks","author":"Reid F.","year":"2012","unstructured":"F. Reid and M. Harrigan . An analysis of anonymity in the bitcoin system . In Security and Privacy in Social Networks , pages 197 -- 223 . 2012 . F. Reid and M. Harrigan. An analysis of anonymity in the bitcoin system. In Security and Privacy in Social Networks, pages 197--223. 2012."},{"key":"e_1_3_2_1_49_1","volume-title":"The blessing of transitivity in sparse and stochastic networks. arXiv","author":"Rohe K.","year":"2013","unstructured":"K. Rohe and T. Qin . The blessing of transitivity in sparse and stochastic networks. arXiv , 2013 . K. Rohe and T. Qin. The blessing of transitivity in sparse and stochastic networks. arXiv, 2013."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2014.2349913"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098145"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.2"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/2891460.2891645"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1038\/ng881"},{"key":"e_1_3_2_1_55_1","volume-title":"Phylogibbs-mp: module prediction and discriminative motif-finding by gibbs sampling. PLoS computational biology","author":"Siddharthan R.","year":"2008","unstructured":"R. Siddharthan . Phylogibbs-mp: module prediction and discriminative motif-finding by gibbs sampling. PLoS computational biology , 2008 . R. Siddharthan. Phylogibbs-mp: module prediction and discriminative motif-finding by gibbs sampling. PLoS computational biology, 2008."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3059194"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281266"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488502"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.030"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.01.006"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0055437"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/108\/58001"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871694"}],"event":{"name":"WSDM '19: The Twelfth ACM International Conference on Web Search and Data Mining","location":"Melbourne VIC Australia","acronym":"WSDM '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289600.3290988","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3289600.3290988","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3289600.3290988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:21Z","timestamp":1750208541000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289600.3290988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,30]]},"references-count":66,"alternative-id":["10.1145\/3289600.3290988","10.1145\/3289600"],"URL":"https:\/\/doi.org\/10.1145\/3289600.3290988","relation":{},"subject":[],"published":{"date-parts":[[2019,1,30]]},"assertion":[{"value":"2019-01-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}