{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T19:18:17Z","timestamp":1771615097222,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T00:00:00Z","timestamp":1588636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T00:00:00Z","timestamp":1588636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1253980"],"award-info":[{"award-number":["IIS-1253980"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1513126"],"award-info":[{"award-number":["CNS-1513126"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10618-020-00686-9","type":"journal-article","created":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T20:03:31Z","timestamp":1588709011000},"page":"980-1021","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Counting frequent patterns in large labeled graphs: a hypergraph-based approach"],"prefix":"10.1007","volume":"34","author":[{"given":"Jinghan","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Napath","family":"Pitaksirianan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4062-2694","authenticated-orcid":false,"given":"Yi-Cheng","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,5]]},"reference":[{"key":"686_CR1","doi-asserted-by":"publisher","unstructured":"Borgelt C, Berthold MR (2002) Mining molecular fragments: finding relevant substructures of molecules. In: Proceedings of the 2002 IEEE international conference on data mining, pp 51\u201358. https:\/\/doi.org\/10.1109\/ICDM.2002.1183885","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"686_CR2","doi-asserted-by":"crossref","unstructured":"Bringmann B, Nijssen S (2008) What is frequent in a single graph? In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 858\u2013863","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"686_CR3","doi-asserted-by":"crossref","unstructured":"Calders T, Ramon J, Van yck D (2008) Anti-monotonic overlap-graph support measures. In: 2008 eighth IEEE international conference on data mining. IEEE, pp 73\u201382","DOI":"10.1109\/ICDM.2008.114"},{"key":"686_CR4","doi-asserted-by":"crossref","unstructured":"Chan YH, Lau LC (2010) On linear and semidefinite programming relaxations for hypergraph matching. In: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp 1500\u20131511","DOI":"10.1137\/1.9781611973075.122"},{"key":"686_CR5","doi-asserted-by":"crossref","unstructured":"Cygan M (2013) Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: 2013 IEEE 54th annual symposium on foundations of computer science (FOCS). IEEE, pp 509\u2013518","DOI":"10.1109\/FOCS.2013.61"},{"issue":"7","key":"686_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/2732286.2732289","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy M, Abdelhamid E, Skiadopoulos S, Kalnis P (2014) Grami: frequent subgraph and pattern mining in a single large graph. Proc VLDB Endow 7(7):517\u2013528","journal-title":"Proc VLDB Endow"},{"key":"686_CR7","unstructured":"Fiedler M, Borgelt C (2007) Support computation for mining frequent subgraphs in a single graph. In: MLG, Citeseer"},{"issue":"2","key":"686_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01303202","volume":"13","author":"Z F\u00fcredi","year":"1993","unstructured":"F\u00fcredi Z, Kahn J, Seymour PD (1993) On the fractional matching polytope of a hypergraph. Combinatorica 13(2):167\u2013180","journal-title":"Combinatorica"},{"key":"686_CR9","doi-asserted-by":"crossref","unstructured":"Holmerin J (2002) Improved inapproximability results for vertex cover on k-uniform hypergraphs. In: Proceedings of the 29th international colloquium on automata, languages and programming. Springer, London, ICALP \u201902, pp 1005\u20131016. http:\/\/dl.acm.org\/citation.cfm?id=646255.756764","DOI":"10.1007\/3-540-45465-9_86"},{"key":"686_CR10","doi-asserted-by":"crossref","unstructured":"Hong M, Zhou H, Wang W, Shi B (2003) An efficient algorithm of frequent connected subgraph extraction. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 40\u201351","DOI":"10.1007\/3-540-36175-8_5"},{"key":"686_CR11","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: Third IEEE international conference on data mining, 2003. ICDM 2003. IEEE, pp 549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"1","key":"686_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens CAJ, Schrijver A (1989) On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems. SIAM J Discrete Math 2(1):68\u201372. https:\/\/doi.org\/10.1137\/0402008","journal-title":"SIAM J Discrete Math"},{"key":"686_CR13","unstructured":"IBM (2011) IBM ILOG CPLEX optimization studio CPLEX user\u2019s manual"},{"issue":"3","key":"686_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A Inokuchi","year":"2003","unstructured":"Inokuchi A, Washio T, Motoda H (2003) Complete mining of frequent patterns from graphs: mining graph data. Mach Learn 50(3):321\u2013354","journal-title":"Mach Learn"},{"key":"686_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller R (ed) Complexity of computer computations. Springer, New York, pp 85\u2013103"},{"key":"686_CR16","unstructured":"Kunegis J (2018) Konect. http:\/\/konect.uni-koblenz.de\/"},{"issue":"9","key":"686_CR17","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi M, Karypis G (2004a) An efficient algorithm for discovering frequent subgraphs. IEEE Trans Knowl Data Eng 16(9):1038\u20131051","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"686_CR18","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 (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Discov 11(3):243\u2013271","journal-title":"Data Min Knowl Discov"},{"key":"686_CR19","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2004b) Grew-a scalable frequent subgraph discovery algorithm. In: Fourth IEEE international conference on data mining, 2004, ICDM\u201904. IEEE, pp 439\u2013442","DOI":"10.21236\/ADA439436"},{"issue":"1","key":"686_CR20","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 (1979) On the shannon capacity of a graph. IEEE Trans Inf Theory 25(1):1\u20137","journal-title":"IEEE Trans Inf Theory"},{"key":"686_CR21","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay BD, Piperno A (2014) Practical graph isomorphism, II. J Symb Comput 60:94\u2013112. https:\/\/doi.org\/10.1016\/j.jsc.2013.09.003","journal-title":"J Symb Comput"},{"key":"686_CR22","doi-asserted-by":"publisher","unstructured":"Meng J, Tu Yc (2017) Flexible and feasible support measures for mining frequent patterns in large labeled graphs. In: Proceedings of the 2017 ACM international conference on management of data. ACM, New York, SIGMOD \u201917, pp 391\u2013402. https:\/\/doi.org\/10.1145\/3035918.3035936","DOI":"10.1145\/3035918.3035936"},{"key":"686_CR23","volume-title":"Combinatorial geometry","author":"J Pach","year":"2011","unstructured":"Pach J, Agarwal PK (2011) Combinatorial geometry, vol 37. Wiley, New York"},{"key":"686_CR24","unstructured":"Pitaksirianan N (2019) Graphmining. https:\/\/github.com\/napath-pitaksirianan\/GraphMining"},{"issue":"3","key":"686_CR25","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"DA Spielman","year":"2004","unstructured":"Spielman DA, Teng SH (2004) Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J ACM 51(3):385\u2013463. https:\/\/doi.org\/10.1145\/990308.990310","journal-title":"J ACM"},{"issue":"5","key":"686_CR26","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1007\/s10618-016-0466-x","volume":"30","author":"N Talukder","year":"2016","unstructured":"Talukder N, Zaki MJ (2016) A distributed approach for graph mining in massive networks. Data Min Knowl Discov 30(5):1024\u20131052","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"686_CR27","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 SE, Gudes E (2006) Support measures for graph data. Data Min Knowl Discov 13(2):243\u2013260","journal-title":"Data Min Knowl Discov"},{"key":"686_CR28","doi-asserted-by":"crossref","unstructured":"Vanetik N, Gudes E, Shimony SE (2002) Computing frequent graph patterns from semistructured data. In: Proceedings of the 2002 IEEE international conference on data mining. IEEE Computer Society, Washington, ICDM \u201902, pp 458\u2013465","DOI":"10.1109\/ICDM.2002.1183988"},{"issue":"3","key":"686_CR29","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s10618-013-0318-x","volume":"27","author":"Y Wang","year":"2013","unstructured":"Wang Y, Ramon J, Fannes T (2013) An efficiently computable subgraph pattern support measure: counting independent observations. Data Min Knowl Discov 27(3):444\u2013477","journal-title":"Data Min Knowl Discov"},{"key":"686_CR30","doi-asserted-by":"crossref","unstructured":"Wang Y, Ramon J (2012) An efficiently computable support measure for frequent subgraph pattern mining. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 362\u2013377","DOI":"10.1007\/978-3-642-33460-3_29"},{"key":"686_CR31","doi-asserted-by":"publisher","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE international conference on data mining (ICDM 2002), 9\u201312 December 2002, Maebashi City, Japan, pp 721\u2013724. https:\/\/doi.org\/10.1109\/ICDM.2002.1184038","DOI":"10.1109\/ICDM.2002.1184038"},{"key":"686_CR32","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) Closegraph: mining closed frequent graph patterns. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 286\u2013295","DOI":"10.1145\/956750.956784"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00686-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-020-00686-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00686-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:59:05Z","timestamp":1620172745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-020-00686-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,5]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["686"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00686-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,5]]},"assertion":[{"value":"22 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}