{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T01:10:06Z","timestamp":1743988206164,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326448"},{"type":"electronic","value":"9783642326455"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32645-5_66","type":"book-chapter","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T08:05:43Z","timestamp":1345536343000},"page":"525-532","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Approach for Mining Frequent Sub-graphs with Support Affinities"],"prefix":"10.1007","author":[{"given":"Gangin","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"Bogdanov, P., Mongiovi, M., Singh, A.K.: Mining Heavy Subgraphs in Time-Evolving Networks. In: ICDM, pp. 81\u201390 (2011)","DOI":"10.1109\/ICDM.2011.101"},{"key":"66_CR2","doi-asserted-by":"crossref","unstructured":"Bifet, A., Holmes, G., Pfahringer, B., Gavalda, R.: Mining Frequent Closed Graphs on Evolving Data Streams. In: KDD, pp. 591\u2013599 (2011)","DOI":"10.1145\/2020408.2020501"},{"key":"66_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-13672-6_14","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S. G\u00fcnnemann","year":"2010","unstructured":"G\u00fcnnemann, S., Seidl, T.: Subgraph Mining on Directed and Weighted Graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS, vol.\u00a06119, pp. 133\u2013146. Springer, Heidelberg (2010)"},{"issue":"2","key":"66_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10115-010-0376-y","volume":"28","author":"Y. Jia","year":"2011","unstructured":"Jia, Y., Zhang, J., Huan, J.: An efficient graph-mining method for complicated and noisy data with real-world applications. Knowl. Inf. Syst.\u00a028(2), 423\u2013447 (2011)","journal-title":"Knowl. Inf. Syst."},{"key":"66_CR5","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Tsuda, K., Uno, T., Kudo, T., Bakir, G.H.: Weighted Substructure Mining for Image Analysis. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383171"},{"issue":"1","key":"66_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","volume":"127","author":"S. Nijssen","year":"2005","unstructured":"Nijssen, S., Kok, J.N.: The Gaston Tool for Frequent Subgraph Mining. Electr. Notes Theor. Comput. Sci.\u00a0127(1), 77\u201387 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"66_CR7","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":"66_CR8","doi-asserted-by":"crossref","unstructured":"Ozaki, T., Etoh, M.: Closed and Maximal Subgraph Mining in Internally and Externally Weighted Graph Databases. In: AINA Workshops, pp. 626\u2013631 (2011)","DOI":"10.1109\/WAINA.2011.48"},{"issue":"5","key":"66_CR9","first-page":"466","volume":"5","author":"A. Silva","year":"2012","unstructured":"Silva, A., Meira Jr., W., Zaki, M.J.: Mining Attribute-structure Correlated Patterns in Large Attributed Graphs. PVLDB\u00a05(5), 466\u2013477 (2012)","journal-title":"PVLDB"},{"issue":"1","key":"66_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10994-008-5089-z","volume":"75","author":"H. Saigo","year":"2009","unstructured":"Saigo, H., Nowozin, S., Kadowaki, T., Kudo, T., Tsuda, K.: gBoost: a mathematical programming approach to graph classification and regression. Machine Learning\u00a075(1), 69\u201389 (2009)","journal-title":"Machine Learning"},{"issue":"1","key":"66_CR11","first-page":"364","volume":"1","author":"H. Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB\u00a01(1), 364\u2013375 (2008)","journal-title":"PVLDB"},{"key":"66_CR12","doi-asserted-by":"crossref","unstructured":"Xiong, H., Tan, P.N., Kumar, V.: Mining Strong Affinity Association Patterns in Data Sets with Skewed Support Distribution. In: ICDM, pp. 387\u2013394 (2003)","DOI":"10.1109\/ICDM.2003.1250944"},{"issue":"3","key":"66_CR13","doi-asserted-by":"publisher","first-page":"336","DOI":"10.4218\/etrij.07.0106.0067","volume":"29","author":"U. Yun","year":"2007","unstructured":"Yun, U.: WIS: Weighted Interesting Sequential Pattern Mining with a Similar Level of Support and\/or Weight. ETRI Journal\u00a029(3), 336\u2013352 (2007)","journal-title":"ETRI Journal"},{"key":"66_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Clustering Large Attributed Graphs: An Efficient Incremental Approach. In: ICDM, pp. 689\u2013698 (2010)","DOI":"10.1109\/ICDM.2010.41"}],"container-title":["Lecture Notes in Computer Science","Convergence and Hybrid Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32645-5_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T00:52:18Z","timestamp":1743987138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32645-5_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326448","9783642326455"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32645-5_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}