{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:53Z","timestamp":1750307093476,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,10,29]]},"DOI":"10.1145\/2396761.2396818","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"435-444","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Utilizing common substructures to speedup tensor factorization for mining dynamic graphs"],"prefix":"10.1145","author":[{"given":"Wei","family":"Liu","sequence":"first","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}]},{"given":"Jeffrey","family":"Chan","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}]},{"given":"James","family":"Bailey","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}]},{"given":"Christopher","family":"Leckie","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}]},{"given":"Ramamohanarao","family":"Kotagiri","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/060676489"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1974-0331751-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/070690730"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"J.","year":"2006","unstructured":"J. Dem\\vsar . Statistical comparisons of classifiers over multiple data sets . Journal of Machine Learning Research , 7 : 1 -- 30 , 2006 . J. Dem\\vsar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1--30, 2006.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_7_1","volume-title":"Matrix computations","author":"Golub G.","year":"1996","unstructured":"G. Golub and C. Van Loan . Matrix computations , volume 3 . Johns Hopkins Univ Pr , 1996 . G. Golub and C. Van Loan. Matrix computations, volume 3. Johns Hopkins Univ Pr, 1996."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293984"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.89"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835905"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293599"},{"key":"e_1_3_2_1_13_1","first-page":"481","volume-title":"String Processing and Information Retrieval","author":"Ley M.","year":"2002","unstructured":"M. Ley . ThetextDBLP computer science bibliography: evolution, research issues, perspectives . In String Processing and Information Retrieval , pages 481 -- 486 . Springer , 2002 . M. Ley. ThetextDBLP computer science bibliography: evolution, research issues, perspectives. In String Processing and Information Retrieval, pages 481--486. Springer, 2002."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276320"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063762"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.169"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409620.1409621"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Maui Hawaii USA","acronym":"CIKM'12"},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396818","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2396818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:38Z","timestamp":1750239278000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":19,"alternative-id":["10.1145\/2396761.2396818","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2396818","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}