{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:11:20Z","timestamp":1779174680583,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ericsson Research India","award":["PO 9201813513"],"award-info":[{"award-number":["PO 9201813513"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,27]]},"DOI":"10.1145\/2723372.2737791","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"475-489","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["COMMIT"],"prefix":"10.1145","author":[{"given":"Saket","family":"Gurukar","sequence":"first","affiliation":[{"name":"IIT Madras, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"IIT Madras, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balaraman","family":"Ravindran","sequence":"additional","affiliation":[{"name":"IIT Madras, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ENRON http:\/\/www.cs.cmu.edu\/~enron\/.  ENRON http:\/\/www.cs.cmu.edu\/~enron\/."},{"key":"e_1_3_2_1_2_1","unstructured":"http:\/\/en.wikipedia.org\/wiki\/f1_score.  http:\/\/en.wikipedia.org\/wiki\/f1_score."},{"key":"e_1_3_2_1_3_1","unstructured":"SNAP http:\/\/snap.stanford.edu\/.  SNAP http:\/\/snap.stanford.edu\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth402"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1811982.1812090"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.124"},{"key":"e_1_3_2_1_7_1","first-page":"858","volume-title":"What is frequent in a single graph? In PAKDD","author":"Bringmann B.","year":"2008","unstructured":"B. Bringmann and S. Nijssen . What is frequent in a single graph? In PAKDD , pages 858 -- 863 . Springer-Verlag , 2008 . B. Bringmann and S. Nijssen. What is frequent in a single graph? In PAKDD, pages 858--863. Springer-Verlag, 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4018\/jkdb.2010100206"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.1499"},{"key":"e_1_3_2_1_10_1","volume-title":"A review on models and algorithms for motif discovery in protein--protein interaction networks. Briefings in functional genomics & proteomics, 7(2):147--156","author":"Ciriello G.","year":"2008","unstructured":"G. Ciriello and C. Guerra . A review on models and algorithms for motif discovery in protein--protein interaction networks. Briefings in functional genomics & proteomics, 7(2):147--156 , 2008 . G. Ciriello and C. Guerra. A review on models and algorithms for motif discovery in protein--protein interaction networks. Briefings in functional genomics & proteomics, 7(2):147--156, 2008."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.104"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"e_1_3_2_1_13_1","first-page":"031014","article-title":"How people interact in evolving online affiliation networks","volume":"2","author":"Gallos L. K.","year":"2012","unstructured":"L. K. Gallos , D. Rybski , F. Liljeros , S. Havlin , and H. A. Makse . How people interact in evolving online affiliation networks . Phys. Rev. X , 2 : 031014 , Aug 2012 . L. K. Gallos, D. Rybski, F. Liljeros, S. Havlin, and H. A. Makse. How people interact in evolving online affiliation networks. Phys. Rev. X, 2:031014, Aug 2012.","journal-title":"Phys. Rev. X"},{"key":"e_1_3_2_1_14_1","volume-title":"ICWSM","author":"Jurgens D.","year":"2012","unstructured":"D. Jurgens and T.-C. Lu . Temporal motifs reveal the dynamics of editor interactions in wikipedia . In ICWSM , 2012 . D. Jurgens and T.-C. Lu. Temporal motifs reveal the dynamics of editor interactions in wikipedia. In ICWSM, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-318"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133915"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/11\/P11005"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1307941110"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30220-6_18"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1089167"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_25_1","volume-title":"Network analysis of recurring youtube spam campaigns. CoRR, abs\/1201.3783","author":"O'Callaghan D.","year":"2012","unstructured":"D. O'Callaghan , M. Harrigan , J. Carthy , and P. Cunningham . Network analysis of recurring youtube spam campaigns. CoRR, abs\/1201.3783 , 2012 . D. O'Callaghan, M. Harrigan, J. Carthy, and P. Cunningham. Network analysis of recurring youtube spam campaigns. CoRR, abs\/1201.3783, 2012."},{"key":"e_1_3_2_1_26_1","first-page":"0215","volume-title":"ICDE","author":"Pei J.","year":"2001","unstructured":"J. Pei , J. Han , B. Mortazavi-Asl , H. Pinto , Q. Chen , U. Dayal , and M.-C. Hsu . Prefixspan : Mining sequential patterns efficiently by prefix-projected pattern growth . In ICDE , pages 0215 -- 0215 , 2001 . J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE, pages 0215--0215, 2001."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/minf.201100058"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487692"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.133"},{"key":"e_1_3_2_1_30_1","volume-title":"Mining statistically significant molecular substructures for efficient molecular classification. Journal of chemical information and modeling, 49(11):2537--2550","author":"Ranu S.","year":"2009","unstructured":"S. Ranu and A. K. Singh . Mining statistically significant molecular substructures for efficient molecular classification. Journal of chemical information and modeling, 49(11):2537--2550 , 2009 . S. Ranu and A. K. Singh. Mining statistically significant molecular substructures for efficient molecular classification. Journal of chemical information and modeling, 49(11):2537--2550, 2009."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1038\/ng881"},{"key":"e_1_3_2_1_32_1","volume-title":"The proof and measurement of association between two things. The American journal of psychology, 15(1):72--101","author":"Spearman C.","year":"1904","unstructured":"C. Spearman . The proof and measurement of association between two things. The American journal of psychology, 15(1):72--101 , 1904 . C. Spearman. The proof and measurement of association between two things. The American journal of psychology, 15(1):72--101, 1904."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.51"},{"key":"e_1_3_2_1_35_1","first-page":"721","volume-title":"ICDM","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gspan: Graph-based substructure pattern mining . In ICDM , pages 721 -- 724 , 2002 . X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, pages 721--724, 2002."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871694"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764441.1764481"}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2737791","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723372.2737791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:37Z","timestamp":1750227397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2737791"}},"subtitle":["A Scalable Approach to Mining Communication Motifs from Dynamic Networks"],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":38,"alternative-id":["10.1145\/2723372.2737791","10.1145\/2723372"],"URL":"https:\/\/doi.org\/10.1145\/2723372.2737791","relation":{},"subject":[],"published":{"date-parts":[[2015,5,27]]},"assertion":[{"value":"2015-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}