{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:33Z","timestamp":1773481953329,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T00:00:00Z","timestamp":1660435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832001"],"award-info":[{"award-number":["61832001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,14]]},"DOI":"10.1145\/3534678.3539096","type":"proceedings-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:06:41Z","timestamp":1660331201000},"page":"3098-3106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Analyzing Online Transaction Networks with Network Motifs"],"prefix":"10.1145","author":[{"given":"Jiawei","family":"Jiang","sequence":"first","affiliation":[{"name":"Wuhan University & ETH Z\u00fcrich, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusong","family":"Hu","sequence":"additional","affiliation":[{"name":"Tencent Inc., Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaosen","family":"Li","sequence":"additional","affiliation":[{"name":"Tencent Inc., Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Ouyang","sequence":"additional","affiliation":[{"name":"Tencent Inc., Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhitao","family":"Wang","sequence":"additional","affiliation":[{"name":"Tencent Inc., Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangcheng","family":"Fu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Da Conceicc ao, \"Acc-motif: accelerated network motif detection,\" IEEE ACM T COMPUT BI","author":"Meira L. A.","year":"2014","unstructured":"L. A. Meira, V. R. M\u00e1ximo, \u00c1. L. Fazenda, and A. F. Da Conceicc ao, \"Acc-motif: accelerated network motif detection,\" IEEE ACM T COMPUT BI, 2014."},{"key":"e_1_3_2_1_2_1","volume-title":"Ahrabian et al., \"Kavosh: a new algorithm for finding network motifs,\" BMC bioinformatics","author":"Kashani Z. R. M.","year":"2009","unstructured":"Z. R. M. Kashani, H. Ahrabian et al., \"Kavosh: a new algorithm for finding network motifs,\" BMC bioinformatics, 2009."},{"key":"e_1_3_2_1_3_1","volume-title":"Moda: an efficient algorithm for network motif discovery in biological networks,\" Genes & genetic systems","author":"Omidi S.","year":"2009","unstructured":"S. Omidi, F. Schreiber, and A. Masoudi-Nejad, \"Moda: an efficient algorithm for network motif discovery in biological networks,\" Genes & genetic systems, 2009."},{"key":"e_1_3_2_1_4_1","volume-title":"Chen et al., \"Scalable graph learning for anti-money laundering: A first look,\" arXiv","author":"Weber M.","year":"2018","unstructured":"M. Weber, J. Chen et al., \"Scalable graph learning for anti-money laundering: A first look,\" arXiv, 2018."},{"key":"e_1_3_2_1_5_1","volume-title":"A network motif based approach for classifying online social networks,\" in SACI","author":"Duma A.","year":"2014","unstructured":"A. Duma and A. Topirceanu, \"A network motif based approach for classifying online social networks,\" in SACI, 2014."},{"key":"e_1_3_2_1_6_1","volume-title":"Local topology of social network based on motif analysis,\" in KES","author":"Juszczyszyn K.","year":"2008","unstructured":"K. Juszczyszyn, P. Kazienko, and K. Musia\u0142, \"Local topology of social network based on motif analysis,\" in KES, 2008."},{"key":"e_1_3_2_1_7_1","volume-title":"Dissecting genome-wide protein-protein interactions with meso-scale network motifs,\" in KDD","author":"Chen J.","year":"2006","unstructured":"J. Chen, W. Hsu, M. L. Lee, and S.-K. Ng, \"Nemofinder: Dissecting genome-wide protein-protein interactions with meso-scale network motifs,\" in KDD, 2006."},{"key":"e_1_3_2_1_8_1","volume-title":"Fanmod: a tool for fast network motif detection,\" Bioinformatics","author":"Wernicke S.","year":"2006","unstructured":"S. Wernicke and F. Rasche, \"Fanmod: a tool for fast network motif detection,\" Bioinformatics, 2006."},{"key":"e_1_3_2_1_9_1","volume-title":"Netmode: Network motif detection without nauty,\" PloS one","author":"Li X.","year":"2012","unstructured":"X. Li, D. S. Stones, H. Wang, H. Deng, X. Liu, and G. Wang, \"Netmode: Network motif detection without nauty,\" PloS one, 2012."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_11_1","volume-title":"Gemini: A computation-centric distributed graph processing system,\" in OSDI","author":"Zhu X.","year":"2016","unstructured":"X. Zhu, W. Chen, W. Zheng, and X. Ma, \"Gemini: A computation-centric distributed graph processing system,\" in OSDI, 2016."},{"key":"e_1_3_2_1_12_1","volume-title":"Local higher-order graph clustering,\" in KDD","author":"Yin H.","year":"2017","unstructured":"H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich, \"Local higher-order graph clustering,\" in KDD, 2017."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_14_1","volume-title":"Powergraph: Distributed graph-parallel computation on natural graphs,\" in OSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, \"Powergraph: Distributed graph-parallel computation on natural graphs,\" in OSDI, 2012."},{"key":"e_1_3_2_1_15_1","volume-title":"The parallel bgl: A generic library for distributed graph computations,\" POOSC","author":"Gregor D.","year":"2005","unstructured":"D. Gregor and A. Lumsdaine, \"The parallel bgl: A generic library for distributed graph computations,\" POOSC, 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_17_1","volume-title":"Stoica et al., \"Spark: Cluster computing with working sets.\" HotCloud","author":"Zaharia M.","year":"2010","unstructured":"M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, I. Stoica et al., \"Spark: Cluster computing with working sets.\" HotCloud, 2010."},{"key":"e_1_3_2_1_18_1","volume-title":"Graphx: Graph processing in a distributed dataflow framework,\" in OSDI","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez and et al., \"Graphx: Graph processing in a distributed dataflow framework,\" in OSDI, 2014."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_20_1","volume-title":"Angel: a new large-scale machine learning system,\" National Science Review","author":"Jiang J.","year":"2018","unstructured":"J. Jiang, L. Yu, J. Jiang, Y. Liu, and B. Cui, \"Angel: a new large-scale machine learning system,\" National Science Review, 2018."},{"key":"e_1_3_2_1_21_1","volume-title":"Psgraph: How tencent trains extremely large-scale graphs with spark?\" in ICDE","author":"Jiang J.","year":"2020","unstructured":"J. Jiang, P. Xiao, L. Yu, X. Li, J. Cheng, X. Miao, Z. Zhang, and B. Cui, \"Psgraph: How tencent trains extremely large-scale graphs with spark?\" in ICDE, 2020."},{"key":"e_1_3_2_1_22_1","unstructured":"Twitter \"Social graph \" 2021 https:\/\/snap.stanford.edu\/data\/ego-Twitter.html."},{"key":"e_1_3_2_1_23_1","volume-title":"Inductive representation learning on large graphs,\" in NIPS","author":"Hamilton W. L.","year":"2017","unstructured":"W. L. Hamilton, R. Ying, and J. Leskovec, \"Inductive representation learning on large graphs,\" in NIPS, 2017."},{"key":"e_1_3_2_1_24_1","volume-title":"Semi-supervised classification with graph convolutional networks,\" arXiv","author":"Kipf T. N.","year":"2016","unstructured":"T. N. Kipf and M. Welling, \"Semi-supervised classification with graph convolutional networks,\" arXiv, 2016."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_1_26_1","volume-title":"motif2vec: Motif aware node representation learning for heterogeneous networks,\" in BigData","author":"Dareddy M. R.","year":"2019","unstructured":"M. R. Dareddy, M. Das, and H. Yang, \"motif2vec: Motif aware node representation learning for heterogeneous networks,\" in BigData, 2019."},{"key":"e_1_3_2_1_27_1","volume-title":"Model: Motif-based deep feature learning for link prediction,\" TCSS","author":"Wang L.","year":"2020","unstructured":"L. Wang, J. Ren, B. Xu, J. Li, W. Luo, and F. Xia, \"Model: Motif-based deep feature learning for link prediction,\" TCSS, 2020."},{"key":"e_1_3_2_1_28_1","volume-title":"An apriori-based algorithm for mining frequent substructures from graph data,\" in PKDD","author":"Inokuchi A.","year":"2000","unstructured":"A. Inokuchi, T. Washio, and H. Motoda, \"An apriori-based algorithm for mining frequent substructures from graph data,\" in PKDD, 2000."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"S. Wernicke \"A faster algorithm for detecting network motifs \" in WABI 2005.","DOI":"10.1007\/11557067_14"},{"key":"e_1_3_2_1_30_1","volume-title":"Parallel discovery of network motifs,\" JPDC","author":"Ribeiro P.","year":"2012","unstructured":"P. Ribeiro, F. Silva, and L. Lopes, \"Parallel discovery of network motifs,\" JPDC, 2012."},{"key":"e_1_3_2_1_31_1","unstructured":"M. Schatz E. Cooper-Balis and A. Bazinet \"Parallel network motif finding.\""},{"key":"e_1_3_2_1_32_1","volume-title":"Parallel calculation of subgraph census in biological networks.\" in Bioinformatics","author":"Ribeiro P. M. P.","year":"2010","unstructured":"P. M. P. Ribeiro, F. M. Silva, and L. M. Lopes, \"Parallel calculation of subgraph census in biological networks.\" in Bioinformatics, 2010."},{"key":"e_1_3_2_1_33_1","volume-title":"Efficient parallel subgraph counting using g-tries,\" in Cluster","author":"Ribeiro P.","year":"2010","unstructured":"P. Ribeiro, F. Silva, and L. Lopes, \"Efficient parallel subgraph counting using g-tries,\" in Cluster, 2010."},{"key":"e_1_3_2_1_34_1","volume-title":"A gpu approach,\" TKDE","author":"Lin W.","year":"2016","unstructured":"W. Lin, X. Xiao, X. Xie, and X.-L. Li, \"Network motif discovery: A gpu approach,\" TKDE, 2016."},{"key":"e_1_3_2_1_35_1","volume-title":"Comparison of co-authorship networks across scientific fields using motifs,\" in ASONAM","author":"Choobdar S.","year":"2012","unstructured":"S. Choobdar, P. Ribeiro, S. Bugla, and F. Silva, \"Comparison of co-authorship networks across scientific fields using motifs,\" in ASONAM, 2012."},{"key":"e_1_3_2_1_36_1","volume-title":"Simple trophic modules for complex food webs,\" Ecology","author":"Bascompte J.","year":"2005","unstructured":"J. Bascompte and C. J. Meli\u00e1n, \"Simple trophic modules for complex food webs,\" Ecology, 2005."},{"key":"e_1_3_2_1_37_1","volume-title":"Motifs in brain networks,\" PLoS biology","author":"Sporns O.","year":"2004","unstructured":"O. Sporns, R. K\u00f6tter, and K. J. Friston, \"Motifs in brain networks,\" PLoS biology, 2004."}],"event":{"name":"KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Washington DC USA","acronym":"KDD '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539096","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534678.3539096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:51Z","timestamp":1750183791000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,14]]},"references-count":37,"alternative-id":["10.1145\/3534678.3539096","10.1145\/3534678"],"URL":"https:\/\/doi.org\/10.1145\/3534678.3539096","relation":{},"subject":[],"published":{"date-parts":[[2022,8,14]]},"assertion":[{"value":"2022-08-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}