{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T02:10:03Z","timestamp":1744078203365,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334597"},{"type":"electronic","value":"9783642334603"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33460-3_29","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T06:18:14Z","timestamp":1347085094000},"page":"362-377","source":"Crossref","is-referenced-by-count":6,"title":["An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining"],"prefix":"10.1007","author":[{"given":"Yuyi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Vanetik, N., Gudes, E., Shimony, S.E.: Computing frequent graph patterns from semistructured data. In: Proceeding of ICDM 2002, pp. 458\u2013465 (2002)","DOI":"10.1109\/ICDM.2002.1183988"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-006-0044-8","volume":"13","author":"N. Vanetik","year":"2006","unstructured":"Vanetik, N., Shimony, S.E., Gudes, E.: Support measures for graph data. Data Min. Knowl. Discov.\u00a013(2), 243\u2013260 (2006)","journal-title":"Data Min. Knowl. Discov."},{"key":"29_CR4","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":"29_CR5","unstructured":"Fiedler, M., Borgelt, C.: Support Computation for Mining Frequent Subgraphs in a Single Graph. In: Proceedings of MLG 2007 (2007)"},{"issue":"3","key":"29_CR6","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10618-011-0217-y","volume":"23","author":"T. Calders","year":"2011","unstructured":"Calders, T., Ramon, J., Dyck, D.V.: All normalized anti-monotonic overlap graph measures are bounded. Data Min. Knowl. Discov.\u00a023(3), 503\u2013548 (2011)","journal-title":"Data Min. Knowl. Discov."},{"issue":"3","key":"29_CR7","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":"29_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractibility, a guide to the theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Approximating clique is almost NP-Complete. In: FOCS, pp. 2\u201312. IEEE Computer Society (1991)","DOI":"10.1109\/SFCS.1991.185341"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Transactions on Information Theory\u00a025(1), 1\u20137 (1979)","journal-title":"IEEE Transactions on Information Theory"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1193","volume":"1","author":"D.E. Knuth","year":"1994","unstructured":"Knuth, D.E.: The sandwich theorem. Electr. J. Comb.\u00a01, 1\u201348 (1994)","journal-title":"Electr. J. Comb."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Chan, T., Chang, K.L., Raman, R.: An SDP primal-dual algorithm for approximating the Lovsz-theta function. In: Proceedings of the IEEE ISIT 2009, pp. 2808\u20132812 (2009)","DOI":"10.1109\/ISIT.2009.5205779"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory. Springer (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D. Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: laws, generators, and algorithms. ACM Comput. Surv.\u00a038(1), 1\u201369 (2006)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"29_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/090762671","volume":"21","author":"G. Iyengar","year":"2011","unstructured":"Iyengar, G., Phillips, D.J., Stein, C.: Approximating semidefinite packing programs. SIAM Journal on Optimization\u00a021(1), 231\u2013268 (2011)","journal-title":"SIAM Journal on Optimization"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge Univ. Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Klein, P.N., Lu, H.: Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING. In: Proc. of ACM STOC 1996, pp. 338\u2013347 (1996)","DOI":"10.1145\/237814.237980"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-04180-8_25","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M. Berlingerio","year":"2009","unstructured":"Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining Graph Evolution Rules. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part I. LNCS, vol.\u00a05781, pp. 115\u2013130. Springer, Heidelberg (2009)"},{"issue":"10","key":"29_CR19","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"P. Luigi","year":"2004","unstructured":"Luigi, P., Pasquale, F., Carlo, S., Mario, V.: A subgraph isomorphism algorithm for matching large graphs. IEEE Trans. Pat. Anal. Mach. Intell.\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pat. Anal. Mach. Intell."},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"issue":"1","key":"29_CR21","doi-asserted-by":"publisher","first-page":"50","DOI":"10.2307\/2272945","volume":"41","author":"R. Fagin","year":"1976","unstructured":"Fagin, R.: Probabilities on finite models. J. of Symbolic Logic\u00a041(1), 50\u201358 (1976)","journal-title":"J. of Symbolic Logic"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Kibriya, A., Ramon, J.: Nearly exact mining of frequent trees in large networks. In: Proceedings of ECML-PKDD 2012 (in press)","DOI":"10.1007\/978-3-642-33460-3_33"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33460-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T01:48:37Z","timestamp":1744076917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33460-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334597","9783642334603"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33460-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}