{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:34Z","timestamp":1725566134584},"publisher-location":"New York, NY","reference-count":30,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781441965141"},{"type":"electronic","value":"9781441965158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-1-4419-6515-8_18","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T16:56:10Z","timestamp":1284569770000},"page":"475-501","source":"Crossref","is-referenced-by-count":2,"title":["Mining Large Information Networks by Graph Summarization"],"prefix":"10.1007","author":[{"given":"Chen","family":"Chen","sequence":"first","affiliation":[]},{"given":"Cindy Xide","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Matt","family":"Fredrikson","sequence":"additional","affiliation":[]},{"given":"Mihai","family":"Christodorescu","sequence":"additional","affiliation":[]},{"given":"Xifeng","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,13]]},"reference":[{"key":"18_CR1","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487\u2013499, 1994."},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D. Chakrabarti","year":"2006","unstructured":"D. Chakrabarti and C. Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Computing Survey, 38(1):1\u201369, 2006.","journal-title":"ACM Computing Survey"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"C. Chen, X. Yan, F. Zhu, J. Han, and P. S. Yu. Graph OLAP: Towards online analytical processing on graphs. In ICDM, pages 103\u2013112, 2008.","DOI":"10.1109\/ICDM.2008.30"},{"key":"18_CR4","doi-asserted-by":"crossref","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, pages 106\u2013115, 2006.","DOI":"10.1145\/1150402.1150418"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"M. Christodorescu, S. Jha, and C. Kruegel. Mining specifications of malicious behavior. In ESEC\/SIGSOFT FSE, pages 5\u201314, 2007.","DOI":"10.1145\/1287624.1287628"},{"issue":"8","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M. Deshpande","year":"2005","unstructured":"M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 17(8):1036\u20131050, 2005.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"18_CR7","unstructured":"M. N. Garofalakis and P. B. Gibbons. Approximate query processing: Taming the terabytes (tutorial). In VLDB, 2001."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD Conference, pages 1\u201312, 2000.","DOI":"10.1145\/342009.335372"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"M. A. Hasan, V. Chaoji, S. Salem, J. Besson, and M. J. Zaki. Origami: Mining representative orthogonal graph patterns. In ICDM, pages 153\u2013162, 2007.","DOI":"10.1109\/ICDM.2007.45"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"H. He and A. K. Singh. Efficient algorithms for mining significant substructures in graphs with quality guarantees. In ICDM, pages 163\u2013172, 2007.","DOI":"10.1109\/ICDM.2007.11"},{"key":"18_CR11","unstructured":"L. B. Holder, D. J. Cook, and S. Djoko. Substucture discovery in the subdue system. In KDD Workshop, pages 169\u2013180, 1994."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"J. Huan, W. Wang, J. Prins, and J. Yang. Spin: Mining maximal frequent subgraphs from graph databases. In KDD, pages 581\u2013586, 2004.","DOI":"10.1145\/1014052.1014123"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokuchi","year":"2003","unstructured":"A. Inokuchi, T. Washio, and H. Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, 50(3):321\u2013354, 2003.","journal-title":"Machine Learning"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"S. Kramer, L. De Raedt, and C. Helma. Molecular feature mining in hiv data. In KDD, pages 136\u2013143, 2001.","DOI":"10.1145\/502512.502533"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313\u2013320, 2001.","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M. Kuramochi","year":"2005","unstructured":"M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. Data Mining and Knowledge Discovery, 11(3):243\u2013271, 2005.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"18_CR17","first-page":"78","volume":"1","author":"A. Lachmann","year":"2008","unstructured":"A. Lachmann and M. Riedewald. Finding relevant patterns in bursty sequences. PVLDB, 1(1):78\u201389, 2008.","journal-title":"PVLDB"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In KDD, pages 177\u2013187, 2005.","DOI":"10.1145\/1081870.1081893"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In SIGMOD Conference, pages 419\u2013432, 2008.","DOI":"10.1145\/1376616.1376661"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasi-cliques. In KDD, pages 228\u2013238, 2005.","DOI":"10.1145\/1081870.1081898"},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1145\/1166074.1166082","volume":"31","author":"N. Polyzotis","year":"2006","unstructured":"N. Polyzotis and M. N. Garofalakis. Xsketch synopses for xml data graphs. ACM Transactions on Database Systems, 31(3):1014\u20131063, 2006.","journal-title":"ACM Transactions on Database Systems"},{"key":"18_CR22","unstructured":"S. Raghavan and H. Garcia-Molina. Representing web graphs. In ICDE, pages 405\u2013416, 2003."},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"S. Reinhardt and G. Karypis. A multi-level parallel implementation of a program for finding frequent patterns in a large sparse graph. In IPDPS, pages 1\u20138, 2007.","DOI":"10.1109\/IPDPS.2007.370404"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"T. Sarl\u00f3s, A. A. Bencz\u00far, K. Csalog\u00e1ny, D. Fogaras, and B. R\u00e1cz. To randomize or not to randomize: Space optimal summaries for hyperlink analysis. In WWW, pages 297\u2013306, 2006.","DOI":"10.1145\/1135777.1135823"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In SIGMOD Conference, pages 567\u2013580, 2008.","DOI":"10.1145\/1376616.1376675"},{"key":"18_CR26","unstructured":"H. Toivonen. Sampling large databases for association rules. In VLDB, pages 134\u2013145, 1996."},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by leap search. In SIGMOD Conference, pages 433\u2013444, 2008.","DOI":"10.1145\/1376616.1376662"},{"key":"18_CR28","unstructured":"X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, pages 721\u2013724, 2002."},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD Conference, pages 335\u2013346, 2004.","DOI":"10.1145\/1007568.1007607"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"N. Zhang, V. Kacholia, and M. T. \u00d6zsu. A succinct physical storage scheme for efficient evaluation of path queries in xml. In ICDE, pages 54\u201365, 2004.","DOI":"10.1109\/ICDE.2004.1319984"}],"container-title":["Link Mining: Models, Algorithms, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-6515-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T20:12:28Z","timestamp":1559679148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4419-6515-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9781441965141","9781441965158"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-6515-8_18","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}