{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:15:48Z","timestamp":1725732948963},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385612"},{"type":"electronic","value":"9783642385629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38562-9_1","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T11:14:18Z","timestamp":1371726858000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["Frequent Subgraph Summarization with Error Control"],"prefix":"10.1007","author":[{"given":"Zheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Ruoming","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Borgelt, C., Berthold, M.R.: Mining molecular fragments: Finding relevant substructures of molecules. In: ICDM, p. 51 (2002)"},{"key":"1_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/978-3-540-68125-0_84","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B. Bringmann","year":"2008","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 858\u2013863. Springer, Heidelberg (2008)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Chen, C., Lin, C.X., Yan, X., Han, J.: On effective presentation of graph patterns: a structural representative approach. In: CIKM, pp. 299\u2013308 (2008)","DOI":"10.1145\/1458082.1458124"},{"issue":"8","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M. Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. on Knowl. and Data Eng.\u00a017(8), 1036\u20131050 (2005)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Fiedler, M., Borgelt, C.: Subgraph support in a single large graph. In: ICDM Workshops, pp. 399\u2013404 (2007)","DOI":"10.1109\/ICDMW.2007.74"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Hasan, M.A., Chaoji, V., Salem, S., Besson, J., Zaki, M.J.: Origami: Mining representative orthogonal graph patterns. In: ICDM, pp. 153\u2013162 (2007)","DOI":"10.1109\/ICDM.2007.45"},{"issue":"1","key":"1_CR7","doi-asserted-by":"crossref","first-page":"730","DOI":"10.14778\/1687627.1687710","volume":"2","author":"M.A. Hasan","year":"2009","unstructured":"Hasan, M.A., Zaki, M.J.: Output space sampling for graph patterns. Proc. VLDB Endow.\u00a02(1), 730\u2013741 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: ICDM, p. 549 (2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: KDD, pp. 581\u2013586 (2004)","DOI":"10.1145\/1014052.1014123"},{"key":"1_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Jin, R., Abu-Ata, M., Xiang, Y., Ruan, N.: Effective and efficient itemset pattern summarization: Regression-based approaches. In: KDD, pp. 399\u2013407 (2008)","DOI":"10.1145\/1401890.1401941"},{"key":"1_CR12","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM, pp. 313\u2013320 (2001)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M. Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov.\u00a011(3), 243\u2013271 (2005)","journal-title":"Data Min. Knowl. Discov."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-13818-8_15","volume-title":"Scientific and Statistical Database Management","author":"S. Li","year":"2010","unstructured":"Li, S., Zhang, S., Yang, J.: DESSIN: Mining dense subgraph patterns in a single graph. In: Gertz, M., Lud\u00e4scher, B. (eds.) SSDBM 2010. LNCS, vol.\u00a06187, pp. 178\u2013195. Springer, Heidelberg (2010)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Liu, Y., Li, J., Gao, H.: Summarizing graph patterns. In: ICDE, pp. 903\u2013912 (2008)","DOI":"10.1109\/ICDE.2008.4497499"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD, pp. 419\u2013432 (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: KDD, pp. 647\u2013652 (2004)","DOI":"10.1145\/1014052.1014134"},{"key":"1_CR18","unstructured":"Freund, R.J., Wilson, W.J., Sa, P.: Regression Analysis: Statistical Modeling of a Response Variable, 2nd edn. Academic Press (2006)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Thomas, L.T., Valluri, S.R., Karlapalem, K.: Margin: Maximal frequent subgraph mining. In: ICDM, pp. 1097\u20131101 (2006)","DOI":"10.1109\/ICDM.2006.102"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: SIGMOD, pp. 567\u2013580 (2008)","DOI":"10.1145\/1376616.1376675"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Vanetik, N., Gudes, E., Shimony, S.E.: Computing frequent graph patterns from semistructured data. In: ICDM, p. 458 (2002)","DOI":"10.1109\/ICDM.2002.1183988"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Wang, C., Parthasarathy, S.: Summarizing itemset patterns using probabilistic models. In: KDD, pp. 730\u2013735 (2006)","DOI":"10.1145\/1150402.1150495"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: a profile-based approach. In: KDD, pp. 314\u2013323 (2005)","DOI":"10.1145\/1081870.1081907"},{"key":"1_CR24","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM, p. 721 (2002)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: KDD, pp. 286\u2013295 (2003)","DOI":"10.1145\/956750.956784"},{"issue":"4","key":"1_CR26","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/1114244.1114248","volume":"30","author":"X. Yan","year":"2005","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst.\u00a030(4), 960\u2013993 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, N., Tian, Y., Patel, J.: Discovery-driven graph summarization. In: ICDE, pp. 880\u2013891 (2010)","DOI":"10.1109\/ICDE.2010.5447830"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, J., Li, S.: Ring: An integrated method for frequent representative subgraph mining. In: ICDM, pp. 1082\u20131087 (2009)","DOI":"10.1109\/ICDM.2009.96"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38562-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T19:30:08Z","timestamp":1563219008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38562-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385612","9783642385629"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38562-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}