{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:33:51Z","timestamp":1771374831473,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012659","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61632009"],"award-info":[{"award-number":["61632009"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Singapore Ministry of Education","award":["MOE2017-T2-1-141"],"award-info":[{"award-number":["MOE2017-T2-1-141"]}]},{"name":"the China Scholarships Council","award":["201906130131"],"award-info":[{"award-number":["201906130131"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3411862","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T06:32:45Z","timestamp":1603089165000},"page":"1505-1514","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Efficient Sampling Algorithms for Approximate Temporal Motif Counting"],"prefix":"10.1145","author":[{"given":"Jingjing","family":"Wang","sequence":"first","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"given":"Yanhao","family":"Wang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Wenjun","family":"Jiang","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"given":"Yuchen","family":"Li","sequence":"additional","affiliation":[{"name":"Singapore Management University & Alibaba-Zhejiang University Joint Research Institute of Frontier Technologies, Singapore, Singapore"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Nesreen K. Ahmed Nick G. Duffield Jennifer Neville and Ramana Rao Kompella. 2014. Graph sample and hold: a framework for big-graph analytics. In KDD. 1446--1455.  Nesreen K. Ahmed Nick G. Duffield Jennifer Neville and Ramana Rao Kompella. 2014. Graph sample and hold: a framework for big-graph analytics. In KDD. 1446--1455.","DOI":"10.1145\/2623330.2623757"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Lorenzo De Stefani Alessandro Epasto Matteo Riondato and Eli Upfal. 2016. TRI\u00c8ST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. In KDD. 825--834.  Lorenzo De Stefani Alessandro Epasto Matteo Riondato and Eli Upfal. 2016. TRI\u00c8ST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. In KDD. 825--834.","DOI":"10.1145\/2939672.2939771"},{"key":"e_1_3_2_2_4_1","volume-title":"Tsin","author":"Etemadi Roohollah","year":"2016","unstructured":"Roohollah Etemadi , Jianguo Lu , and Yung H . Tsin . 2016 . Efficient Estimation of Triangles in Very Large Graphs. In CIKM. 1251--1260. Roohollah Etemadi, Jianguo Lu, and Yung H. Tsin. 2016. Efficient Estimation of Triangles in Very Large Graphs. In CIKM. 1251--1260."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Edoardo Galimberti Alain Barrat Francesco Bonchi Ciro Cattuto and Francesco Gullo. 2018. Mining (maximal) Span-cores from Temporal Networks. In CIKM. 107--116.  Edoardo Galimberti Alain Barrat Francesco Bonchi Ciro Cattuto and Francesco Gullo. 2018. Mining (maximal) Span-cores from Temporal Networks. In CIKM. 107--116.","DOI":"10.1145\/3269206.3271767"},{"key":"e_1_3_2_2_7_1","unstructured":"Wentian Guo Yuchen Li Mo Sha Bingsheng He Xiaokui Xiao and Kian-Lee Tan. 2020. GPU-Accelerated Subgraph Enumeration on Partitioned Graphs. In SIGMOD. 1067--1082.  Wentian Guo Yuchen Li Mo Sha Bingsheng He Xiaokui Xiao and Kian-Lee Tan. 2020. GPU-Accelerated Subgraph Enumeration on Partitioned Graphs. In SIGMOD. 1067--1082."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151113.3151121"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737791"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Anne-Sophie Himmel Hendrik Molter Rolf Niedermeier and Manuel Sorge. 2016. Enumerating maximal cliques in temporal graphs. In ASONAM. 337--344.  Anne-Sophie Himmel Hendrik Molter Rolf Niedermeier and Manuel Sorge. 2016. Enumerating maximal cliques in temporal graphs. In ASONAM. 337--344.","DOI":"10.1109\/ASONAM.2016.7752255"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Shweta Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1n's Theorem. In WWW. 441--449.  Shweta Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1n's Theorem. In WWW. 441--449.","DOI":"10.1145\/3038912.3052636"},{"key":"e_1_3_2_2_13_1","unstructured":"Madhav Jha C. Seshadhri and Ali Pinar. 2013. A space efficient streaming algorithm for triangle counting using the birthday paradox. In KDD. 589--597.  Madhav Jha C. Seshadhri and Ali Pinar. 2013. A space efficient streaming algorithm for triangle counting using the birthday paradox. In KDD. 589--597."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_2_15_1","volume-title":"Graphs: The Power of Wedge Sampling. In SDM. 10--18.","author":"Kolda Tamara G.","year":"2013","unstructured":"Tamara G. Kolda , Ali Pinar , and C. Seshadhri . 2013 . Triadic Measures on Graphs: The Power of Wedge Sampling. In SDM. 10--18. Tamara G. Kolda, Ali Pinar, and C. Seshadhri. 2013. Triadic Measures on Graphs: The Power of Wedge Sampling. In SDM. 10--18."},{"key":"e_1_3_2_2_16_1","unstructured":"Chrysanthi Kosyfaki Nikos Mamoulis Evaggelia Pitoura and Panayiotis Tsaparas. 2019. Flow Motifs in Interaction Networks. In EDBT. 241--252.  Chrysanthi Kosyfaki Nikos Mamoulis Evaggelia Pitoura and Panayiotis Tsaparas. 2019. Flow Motifs in Interaction Networks. In EDBT. 241--252."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/11\/P11005"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236197"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_2_2_20_1","volume-title":"Jeffrey Xu Yu, and Qiangqiang Dai","author":"Li Rong-Hua","year":"2018","unstructured":"Rong-Hua Li , Jiao Su , Lu Qin , Jeffrey Xu Yu, and Qiangqiang Dai . 2018 . Persistent Community Search in Temporal Networks. In ICDE. 797--808. Rong-Hua Li, Jiao Su, Lu Qin, Jeffrey Xu Yu, and Qiangqiang Dai. 2018. Persistent Community Search in Temporal Networks. In ICDE. 797--808."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783285"},{"key":"e_1_3_2_2_22_1","volume-title":"Austin R. Benson, and Moses Charikar","author":"Liu Paul","year":"2019","unstructured":"Paul Liu , Austin R. Benson, and Moses Charikar . 2019 . Sampling Methods for Counting Temporal Motifs. In WSDM. 294--302. Paul Liu, Austin R. Benson, and Moses Charikar. 2019. Sampling Methods for Counting Temporal Motifs. In WSDM. 294--302."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Patrick Mackey Katherine Porterfield Erin Fitzhenry Sutanay Choudhury and George Chin Jr. 2018. A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism. In BigData. 3972--3979.  Patrick Mackey Katherine Porterfield Erin Fitzhenry Sutanay Choudhury and George Chin Jr. 2018. A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism. In BigData. 3972--3979.","DOI":"10.1109\/BigData.2018.8622100"},{"key":"e_1_3_2_2_24_1","volume-title":"Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 5594(2002), 824--827.","author":"Milo R.","year":"2002","unstructured":"R. Milo , S. Shen-Orr , S. Itzkovitz , N. Kashtan , D. Chklovskii , and U. Alon . 2002 . Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 5594(2002), 824--827. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. 2002. Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 5594(2002), 824--827."},{"key":"e_1_3_2_2_25_1","unstructured":"Mohammad Hossein Namaki Yinghui Wu Qi Song Peng Lin and Tingjian Ge. 2017. Discovering Graph Temporal Association Rules. In CIKM. 1697--1706.  Mohammad Hossein Namaki Yinghui Wu Qi Song Peng Lin and Tingjian Ge. 2017. Discovering Graph Temporal Association Rules. In CIKM. 1697--1706."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_2_27_1","volume-title":"Austin R. Benson, and Jure Leskovec","author":"Paranjape Ashwin","year":"2017","unstructured":"Ashwin Paranjape , Austin R. Benson, and Jure Leskovec . 2017 . Motifs in Temporal Networks. In WSDM. 601--610. Ashwin Paranjape, Austin R. Benson, and Jure Leskovec. 2017. Motifs in Temporal Networks. In WSDM. 601--610."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"e_1_3_2_2_29_1","volume-title":"ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. InWWW. 1431--1440.","author":"Pinar Ali","year":"2017","unstructured":"Ali Pinar , C. Seshadhri , and Vaidyanathan Vishal . 2017 . ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. InWWW. 1431--1440. Ali Pinar, C. Seshadhri, and Vaidyanathan Vishal. 2017. ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. InWWW. 1431--1440."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_2_31_1","volume-title":"Ahmet Erdem Sariy\u00fcce, and Srikanta Tirthapura","author":"Sanei-Mehri Seyed-Vahid","year":"2018","unstructured":"Seyed-Vahid Sanei-Mehri , Ahmet Erdem Sariy\u00fcce, and Srikanta Tirthapura . 2018 .Butterfly Counting in Bipartite Networks. In KDD. 2150--2159. Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariy\u00fcce, and Srikanta Tirthapura. 2018.Butterfly Counting in Bipartite Networks. In KDD. 2150--2159."},{"key":"e_1_3_2_2_32_1","volume-title":"Accelerating Dynamic Graph Analytics on GPUs.PVLDB11, 1","author":"Sha Mo","year":"2017","unstructured":"Mo Sha , Yuchen Li , Bingsheng He , and Kian-Lee Tan . 2017. Accelerating Dynamic Graph Analytics on GPUs.PVLDB11, 1 ( 2017 ), 107--120. Mo Sha, Yuchen Li, Bingsheng He, and Kian-Lee Tan. 2017. Accelerating Dynamic Graph Analytics on GPUs.PVLDB11, 1 (2017), 107--120."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Charalampos E. Tsourakakis U Kang Gary L. Miller and Christos Faloutsos. 2009. DOULION: counting triangles in massive graphs with a coin. In KDD. 837--846.  Charalampos E. Tsourakakis U Kang Gary L. Miller and Christos Faloutsos. 2009. DOULION: counting triangles in massive graphs with a coin. In KDD. 837--846.","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Ata Turk and Duru T\u00fcrkoglu. 2019. Revisiting Wedge Sampling for Triangle Counting. In WWW. 1875--1885.  Ata Turk and Duru T\u00fcrkoglu. 2019. Revisiting Wedge Sampling for Triangle Counting. In WWW. 1875--1885.","DOI":"10.1145\/3308558.3313534"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Duru T\u00fcrkoglu and Ata Turk. 2017. Edge-Based Wedge Sampling to Estimate Triangle Counts in Very Large Graphs. In ICDM. 455--464.  Duru T\u00fcrkoglu and Ata Turk. 2017. Edge-Based Wedge Sampling to Estimate Triangle Counts in Very Large Graphs. In ICDM. 455--464.","DOI":"10.1109\/ICDM.2017.55"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_2_37_1","volume-title":"Wit","author":"Uzupyte Ruta","year":"2020","unstructured":"Ruta Uzupyte and Ernst C . Wit . 2020 . Test for triadic closure and triadic protection in temporal relational event data. Social Netw. Analys. Mining 10, Article 21 (2020). Ruta Uzupyte and Ernst C. Wit. 2020. Test for triadic closure and triadic protection in temporal relational event data. Social Netw. Analys. Mining 10, Article 21 (2020)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1001066"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Jordan Viard Matthieu Latapy and Cl\u00e9mence Magnien. 2015. Revealing contact patterns among high-school students using maximal cliques in link streams. In ASONAM. 1517--1522.  Jordan Viard Matthieu Latapy and Cl\u00e9mence Magnien. 2015. Revealing contact patterns among high-school students using maximal cliques in link streams. In ASONAM. 1517--1522.","DOI":"10.1145\/2808797.2809291"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.030"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Jingjing Wang Yanhao Wang Wenjun Jiang Yuchen Li and Kian-Lee Tan. 2020. Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Ex-tended Version). arXiv:2007.14028 [cs.SI]  Jingjing Wang Yanhao Wang Wenjun Jiang Yuchen Li and Kian-Lee Tan. 2020. Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Ex-tended Version). arXiv:2007.14028 [cs.SI]","DOI":"10.1145\/3340531.3411862"},{"key":"e_1_3_2_2_42_1","volume-title":"Efficiently Estimating Motif Statistics of Large Networks. TKDD 9, 2","author":"Wang Pinghui","year":"2014","unstructured":"Pinghui Wang , John C. S. Lui , Bruno F. Ribeiro , Don Towsley , Junzhou Zhao , and Xiaohong Guan . 2014. Efficiently Estimating Motif Statistics of Large Networks. TKDD 9, 2 ( 2014 ), 8:1--8:27. Pinghui Wang, John C. S. Lui, Bruno F. Ribeiro, Don Towsley, Junzhou Zhao, and Xiaohong Guan. 2014. Efficiently Estimating Motif Statistics of Large Networks. TKDD 9, 2 (2014), 8:1--8:27."},{"key":"e_1_3_2_2_43_1","volume-title":"Minfer: A method of inferring motif statistics from sampled edges. In ICDE. 1050--1061.","author":"Wang Pinghui","year":"2016","unstructured":"Pinghui Wang , John C. S. Lui , Donald F. Towsley , and Junzhou Zhao . 2016 . Minfer: A method of inferring motif statistics from sampled edges. In ICDE. 1050--1061. Pinghui Wang, John C. S. Lui, Donald F. Towsley, and Junzhou Zhao. 2016. Minfer: A method of inferring motif statistics from sampled edges. In ICDE. 1050--1061."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149197"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_2_46_1","volume-title":"Real-Time Influence Maximization on Dynamic Social Streams.PVLDB10, 7","author":"Wang Yanhao","year":"2017","unstructured":"Yanhao Wang , Qi Fan , Yuchen Li , and Kian-Lee Tan . 2017. Real-Time Influence Maximization on Dynamic Social Streams.PVLDB10, 7 ( 2017 ), 805--816. Yanhao Wang, Qi Fan, Yuchen Li, and Kian-Lee Tan. 2017. Real-Time Influence Maximization on Dynamic Social Streams.PVLDB10, 7 (2017), 805--816."},{"key":"e_1_3_2_2_47_1","article-title":"Location-aware Influence Maximization over Dynamic Social Streams.ACM","volume":"36","author":"Wang Yanhao","year":"2018","unstructured":"Yanhao Wang , Yuchen Li , Ju Fan , and Kian-Lee Tan . 2018 . Location-aware Influence Maximization over Dynamic Social Streams.ACM Trans. Inf. Syst. 36 , 4(2018), 43:1--43:35. Yanhao Wang, Yuchen Li, Ju Fan, and Kian-Lee Tan. 2018. Location-aware Influence Maximization over Dynamic Social Streams.ACM Trans. Inf. Syst.36, 4(2018), 43:1--43:35.","journal-title":"Trans. Inf. Syst."},{"key":"e_1_3_2_2_48_1","unstructured":"Yanhao Wang Yuchen Li and Kian-Lee Tan. 2019. Semantic and Influence aware k-Representative Queries over Social Streams. In EDBT. 181--192.  Yanhao Wang Yuchen Li and Kian-Lee Tan. 2019. Semantic and Influence aware k-Representative Queries over Social Streams. In EDBT. 181--192."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2556663"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Qiankun Zhao Yuan Tian Qi He Nuria Oliver Ruoming Jin and Wang-Chien Lee. 2010. Communication motifs: a tool to characterize social communications. In CIKM. 1645--1648.  Qiankun Zhao Yuan Tian Qi He Nuria Oliver Ruoming Jin and Wang-Chien Lee. 2010. Communication motifs: a tool to characterize social communications. In CIKM. 1645--1648.","DOI":"10.1145\/1871437.1871694"}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411862","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3411862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:49Z","timestamp":1750206349000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":50,"alternative-id":["10.1145\/3340531.3411862","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3411862","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}