{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:26:19Z","timestamp":1758273979252},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,5,9]],"date-time":"2013-05-09T00:00:00Z","timestamp":1368057600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10618-013-0318-x","type":"journal-article","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T17:34:37Z","timestamp":1368034477000},"page":"444-477","source":"Crossref","is-referenced-by-count":5,"title":["An efficiently computable subgraph pattern support measure: counting independent observations"],"prefix":"10.1007","volume":"27","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"}]},{"given":"Thomas","family":"Fannes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,9]]},"reference":[{"key":"318_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD\u201993, Washington DC, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"318_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A, Albert R (1999) Emergence of scaling in random networks. Science 286:509\u2013512","journal-title":"Science"},{"key":"318_CR3","doi-asserted-by":"crossref","unstructured":"Berlingerio M, Bonchi F, Bringmann B, Gionis A (2009) Mining graph evolution rules. In: Proceedings of ECML\/PKDD\u201909, Bled, pp 115\u2013130","DOI":"10.1007\/978-3-642-04180-8_25"},{"key":"318_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"318_CR5","doi-asserted-by":"crossref","unstructured":"Bringmann B, Nijssen S (2008) What is frequent in a single graph? In: Proceedings of PAKDD\u201908, Osaka, pp 858\u2013863","DOI":"10.1007\/978-3-540-68125-0_84"},{"issue":"3","key":"318_CR6","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10618-011-0217-y","volume":"23","author":"T Calders","year":"2011","unstructured":"Calders T, Ramon J, Dyck DV (2011) All normalized anti-monotonic overlap graph measures are bounded. Data Min Knowl Discov 23(3):503\u2013548","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"318_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti D, Faloutsos C (2006) Graph mining: laws, generators, and algorithms. ACM Comput Surv 38(1):1\u201369","journal-title":"ACM Comput Surv"},{"key":"318_CR8","unstructured":"Chan T, Chang KL, Raman R (2009) An SDP primal-dual algorithm for approximating the Lovsz-theta function. In: Proceedings of the IEEE ISIT\u201909, pp 2808\u20132812"},{"key":"318_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory","author":"R Diestel","year":"2010","unstructured":"Diestel R (2010) Graph theory. Springer, Heidelberg"},{"key":"318_CR10","doi-asserted-by":"crossref","unstructured":"Dreweke A, W\u00f6rlein M, Fischer I, Schell D, Meinl Th, Philippsen M (2007) Graph-based procedural abstraction. In: Proceedings of the international symposium on code generation and optimization\u201907, San Jose, pp 259\u2013270","DOI":"10.1109\/CGO.2007.14"},{"issue":"1","key":"318_CR11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","volume":"41","author":"R Fagin","year":"1976","unstructured":"Fagin R (1976) Probabilities on finite models. J Symb Logic 41(1):50\u201358","journal-title":"J Symb Logic"},{"key":"318_CR12","unstructured":"Fiedler M, Borgelt C (2007) Support computation for mining frequent subgraphs in a single graph. In: Proceedings of the workshop on mining and learning with graphs (MLG\u201907), Firenze"},{"key":"318_CR13","doi-asserted-by":"crossref","unstructured":"Feige U, Goldwasser S, Lov\u00e1sz L, Safra S, Szegedy M (1991) Approximating clique is almost NP-complete. In: FOCS IEEE Computer Society, pp 2\u201312","DOI":"10.1109\/SFCS.1991.185341"},{"key":"318_CR14","volume-title":"Computers and intractibility, a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractibility, a guide to the theory of NP-completeness. W. H. Freeman and Company, New York"},{"key":"318_CR15","doi-asserted-by":"crossref","unstructured":"Gjoka M, Kurant M, Butts C, Markopoulou A (2010) Walking in facebook: a case study of unbiased sampling of OSNs. In: Proceedings of IEEE INFOCOM\u201910, San Diego, pp 1\u20139","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"1","key":"318_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/090762671","volume":"21","author":"G Iyengar","year":"2011","unstructured":"Iyengar G, Phillips DJ, Stein C (2011) Approximating semidefinite packing programs. SIAM J Optim 21(1):231\u2013268","journal-title":"SIAM J Optim"},{"key":"318_CR17","doi-asserted-by":"crossref","unstructured":"Kibriya A, Ramon J (2012) Nearly exact mining of frequent trees in large networks. In: Proceedings of ECML-PKDD 2012, Bristol, pp 426\u2013441","DOI":"10.1007\/978-3-642-33460-3_33"},{"key":"318_CR18","unstructured":"Klein PN, Lu H (1996) Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING. In: Proceedings of ACM STOC\u201996, pp 338\u2013347"},{"key":"318_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1193","volume":"1","author":"DE Knuth","year":"1994","unstructured":"Knuth DE (1994) The sandwich theorem. Electron J Comb 1:1\u201348","journal-title":"Electron J Comb"},{"issue":"3","key":"318_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M, Karypis G (2005) Finding frequent subgraph patterns in a large sparse graph. Data Mining Knowl Discov 11(3):243\u2013271","journal-title":"Data Mining Knowl Discov"},{"issue":"1","key":"318_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L (1979) On the Shannon capacity of a graph. IEEE Trans Inf Theory 25(1):1\u20137","journal-title":"IEEE Trans Inf Theory"},{"issue":"10","key":"318_CR22","doi-asserted-by":"crossref","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 (2004) A subgraph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"318_CR23","doi-asserted-by":"crossref","unstructured":"Schrijver A (1979) A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans Inf Theory 25:425\u2013429","DOI":"10.1109\/TIT.1979.1056072"},{"key":"318_CR24","unstructured":"Vanetik N, Gudes E, Shimony SE (2002) Computing frequent graph subgraph patterns from semistructured data. In: Proceeding of the IEEE international conference on data mining (ICDM\u201902), Maebashi, pp 458\u2013465"},{"issue":"2","key":"318_CR25","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-006-0044-8","volume":"13","author":"N Vanetik","year":"2006","unstructured":"Vanetik N, Shimony SE, Gudes E (2006) Support measures for graph data. Data Mining Knowl Discov 13(2):243\u2013260","journal-title":"Data Mining Knowl Discov"},{"key":"318_CR26","doi-asserted-by":"crossref","unstructured":"Wang Y, Ramon J (2012) An efficiently computable support measure for frequent subgraph pattern mining. In: Proceedings of ECML-PKDD 2012, Bristol, pp 362\u2013377","DOI":"10.1007\/978-3-642-33460-3_29"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0318-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-013-0318-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0318-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T13:18:39Z","timestamp":1595769519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-013-0318-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["318"],"URL":"https:\/\/doi.org\/10.1007\/s10618-013-0318-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,9]]}}}