{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T02:29:02Z","timestamp":1680834542135},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,6,15]],"date-time":"2013-06-15T00:00:00Z","timestamp":1371254400000},"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-0321-2","type":"journal-article","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T11:45:02Z","timestamp":1371210302000},"page":"478-504","source":"Crossref","is-referenced-by-count":7,"title":["Nearly exact mining of frequent trees in large networks"],"prefix":"10.1007","volume":"27","author":[{"given":"Ashraf M.","family":"Kibriya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,15]]},"reference":[{"key":"321_CR1","doi-asserted-by":"crossref","unstructured":"Berlingerio M, Bonchi F, Bringmann B, Gionis A (2009) Mining graph evolution rules. In: Proceedings of the European conference on machine learning and knowledge discovery in databases: part I, ECML-PKDD \u201909. Springer, Berlin, pp 115\u2013130","DOI":"10.1007\/978-3-642-04180-8_25"},{"issue":"1","key":"321_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M Blum","year":"1995","unstructured":"Blum M, Kannan S (1995) Designing programs that check their work. J ACM 42(1):269\u2013291","journal-title":"J ACM"},{"key":"321_CR3","unstructured":"Bogdanov P, Mongiov\u00ec M, Singh AK (2011) Mining heavy subgraphs in time-evolving networks. In: Proceedings of the (2011) IEEE 11th international conference on data mining, ICDM \u201911. IEEE Computer Society, Washington, DC, pp 81\u201390"},{"key":"321_CR4","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, ICDM \u201902. IEEE Computer Society, Washington, DC, pp 51\u201358"},{"key":"321_CR5","doi-asserted-by":"crossref","unstructured":"Borgelt C, Meinl T, Berthold M (2005) Moss: a program for molecular substructure mining. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, OSDM \u201905. ACM, New York, pp 6\u201315","DOI":"10.1145\/1133905.1133908"},{"key":"321_CR6","unstructured":"Bringmann B, Nijssen S (2007) What is frequent in a single graph? In: Frasconi P, Kersting K, Wrobel S (eds) Proceedings of MLG-2007: 5th international workshop on mining and learning with graphs, pp 1\u20134"},{"issue":"3","key":"321_CR7","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, Van Dyck D (2011) All normalized anti-monotonic overlap graph measures are bounded. Data Min Knowl Discov 23(3):503\u2013548","journal-title":"Data Min Knowl Discov"},{"key":"321_CR8","doi-asserted-by":"crossref","unstructured":"Chehreghani M (2011) Efficiently mining unordered trees. In: 2011 IEEE 11th international conference on data mining (ICDM), pp 111\u2013120","DOI":"10.1109\/ICDM.2011.62"},{"issue":"2","key":"321_CR9","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J Chen","year":"2001","unstructured":"Chen J, Kanj IA, Jia W (2001) Vertex cover: further observations and further improvements. J Algorithm 41(2):280\u2013301","journal-title":"J Algorithm"},{"key":"321_CR10","unstructured":"Chi Y, Yang Y, Muntz R (2004) Hybridtreeminer: an efficient algorithm for mining frequent rooted trees and free trees using canonical forms. In: Proceedings of 16th international conference on scientific and statistical database management, 2004, pp 11\u201320"},{"key":"321_CR11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y Chi","year":"2005","unstructured":"Chi Y, Xia Y, Yang YR, Muntz R (2005) Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans Knowl Data Eng 17:190\u2013202","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"321_CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1994","unstructured":"Cook DJ, Holder LB (1994) Substructure discovery using minimum description length and background knowledge. J Artif Intell Res 1(1):231\u2013255","journal-title":"J Artif Intell Res"},{"key":"321_CR13","doi-asserted-by":"crossref","unstructured":"Cook DJ, Holder LB (2000) Graph-based data mining. IEEE Intell Syst 15(2):32\u201341","DOI":"10.1109\/5254.850825"},{"key":"321_CR14","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2001) An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 workshop on graph-based representations in pattern recognition, Cuen, pp 149\u2013159"},{"key":"321_CR15","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26:1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"321_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory, 4th edn","author":"R Diestel","year":"2010","unstructured":"Diestel R (2010) Graph theory, 4th edn, electronic edn. Springer, New York","edition":"electronic"},{"key":"321_CR17","doi-asserted-by":"crossref","unstructured":"Dries A, Nijssen S (2012) Mining patterns in networks using homomorphism. In: Proceedings of the twelfth SIAM international conference on data mining, pp 260\u2013271. Omnipress, Madison. https:\/\/lirias.kuleuven.be\/handle\/123456789\/350328","DOI":"10.1137\/1.9781611972825.23"},{"key":"321_CR18","doi-asserted-by":"crossref","unstructured":"Fierens D, Blockeel H, Bruynooghe M, Ramon J (2005) Logical Bayesian networks and their relation to other probabilistic logical models. In: Proceedings of the 15th international conference on inductive logic programming. Lecture notes in computer science, vol 3625. Springer, New York, pp 121\u2013135","DOI":"10.1007\/11536314_8"},{"key":"321_CR19","doi-asserted-by":"crossref","unstructured":"Gallagher B, Tong H, Eliassi-Rad T, Faloutsos C (2008) Using ghost edges for classification in sparsely labeled networks. In: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201908. ACM, New York, pp 256\u2013264","DOI":"10.1145\/1401890.1401925"},{"key":"321_CR20","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"An Introduction to statistical relational learning","author":"L Getoor","year":"2007","unstructured":"Getoor L, Taskar B (2007) An Introduction to statistical relational learning. MIT Press, Cambridge"},{"key":"321_CR21","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","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"1","key":"321_CR22","doi-asserted-by":"crossref","first-page":"730","DOI":"10.14778\/1687627.1687710","volume":"2","author":"MA Hasan","year":"2009","unstructured":"Hasan MA, Zaki MJ (2009) Output space sampling for graph patterns. Proc VLDB Endow 2(1):730\u2013741","journal-title":"Proc VLDB Endow"},{"key":"321_CR23","doi-asserted-by":"crossref","unstructured":"Henderson K, Gallagher B, Li L, Akoglu L, Eliassi-Rad T, Tong H, Faloutsos C (2011) It\u2019s who you know: graph mining using recursive structural features. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201911. ACM, New York, pp 663\u2013671","DOI":"10.1145\/2020408.2020512"},{"key":"321_CR24","doi-asserted-by":"crossref","first-page":"2784","DOI":"10.1016\/j.tcs.2010.03.030","volume":"411","author":"T Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th T, Ramon J (2010) Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theor Comput Sci 411:2784\u20132797","journal-title":"Theor Comput Sci"},{"issue":"3","key":"321_CR25","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/s10618-009-0162-1","volume":"21","author":"T Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th T, Ramon J, Wrobel S (2010) Frequent subgraph mining in outerplanar graphs. Knowl Discov Data Min 21(3):472\u2013508","journal-title":"Knowl Discov Data Min"},{"key":"321_CR26","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceedings of the (2003) third IEEE international conference on data mining, ICDM \u201903. IEEE Computer Society, Washington, DC, pp 549\u2013556"},{"key":"321_CR27","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J, Yang J (2004) Spin: mining maximal frequent subgraphs from graph databases. In: Proceedings of the 10th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201904. ACM, New York, pp 581\u2013586","DOI":"10.1145\/1014052.1014123"},{"key":"321_CR28","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of the 4th European conference on principles of data mining and knowledge discovery, PKDD \u201900. Springer, London, pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"10","key":"321_CR29","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1016\/j.datak.2009.04.008","volume":"68","author":"X Jiang","year":"2009","unstructured":"Jiang X, Xiong H, Wang C, Tan AH (2009) Mining globally distributed frequent subgraphs in a single labeled graph. Data Knowl Eng 68(10):1034\u20131058","journal-title":"Data Knowl Eng"},{"key":"321_CR30","unstructured":"Kibriya AM, Ramon J (2012) Nearly exact mining of frequent trees in large networks. Proceedings of the (2012) European conference on machine learning and knowledge discovery in databases\u2013volume part I, ECML PKDD\u201912. Springer, Berlin, pp 426\u2013441"},{"key":"321_CR31","doi-asserted-by":"crossref","unstructured":"Koutis I (2008) Faster algebraic algorithms for path and packing problems. In: Proceedings of ICALP \u201908. Springer, New York, pp 575\u2013586","DOI":"10.1007\/978-3-540-70575-8_47"},{"key":"321_CR32","doi-asserted-by":"crossref","unstructured":"Koutis I, Williams R (2009) Limits and applications of group algebras for parameterized problems. In: Proceedings of ICALP \u201909. Springer, New York, pp 653\u2013664","DOI":"10.1007\/978-3-642-02927-1_54"},{"key":"321_CR33","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of the (2001) IEEE international conference on data mining, ICDM \u201901. IEEE Computer Society, Washington, DC, pp 313\u2013320"},{"issue":"3","key":"321_CR34","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 patterns in a large sparse graph*. Data Min Knowl Discov 11(3):243\u2013271","journal-title":"Data Min Knowl Discov"},{"key":"321_CR35","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge University Press, New York"},{"key":"321_CR36","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng SH, De Wolf R (1997) Foundations of inductive logic programming. Lecture notes in computer science and lecture notes in artificial intelligence, vol 1228. Springer, New York","DOI":"10.1007\/3-540-62927-0"},{"key":"321_CR37","unstructured":"Nijssen S, Kok J There is no optimal, theta-subsumption based refinement operator. Personal communication"},{"key":"321_CR38","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201904. ACM, New York, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"key":"321_CR39","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2005) The gaston tool for frequent subgraph mining. Electron Notes Theor Comput Sci 127(1):77\u201387; Proceedings of the international workshop on graph-based tools (GraBaTs 2004)","DOI":"10.1016\/j.entcs.2004.12.039"},{"issue":"3","key":"321_CR40","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"JM Robson","year":"1986","unstructured":"Robson JM (1986) Algorithms for maximum independent sets. J Algorithm 7(3):425\u2013440","journal-title":"J Algorithm"},{"key":"321_CR41","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1613\/jair.3659","volume":"45","author":"RA Rossi","year":"2012","unstructured":"Rossi RA, McDowell LK, Aha DW, Neville J (2012) Transforming graph data for statistical relational learning. J Artif Intell Res 45:363\u2013441","journal-title":"J Artif Intell Res"},{"key":"321_CR42","doi-asserted-by":"crossref","unstructured":"Thomas LT, Valluri SR, Karlapalem K (2010) Margin: maximal frequent subgraph mining. ACM Trans Knowl Discov Data 4:10:1\u201310:42","DOI":"10.1145\/1839490.1839491"},{"issue":"1","key":"321_CR43","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J Ullmann","year":"1976","unstructured":"Ullmann J (1976) An algorithm for subgraph isomorphism. J Assoc Comput Mach 23(1):31\u201342","journal-title":"J Assoc Comput Mach"},{"key":"321_CR44","unstructured":"Wang Y, Ramon J, (2012) An efficiently computable support measure for frequent subgraph pattern mining. In: Proceedings of ECML\/PKDD, (2012) Lecture notes in computer science, vol 7523. Springe, New York, pp 362\u2013379"},{"key":"321_CR45","doi-asserted-by":"crossref","unstructured":"W\u00f6rlein M, Meinl T, Fischer I, Philippsen M (2005) A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston. Proceedings of the 9th European conference on principles and practice of knowledge discovery in databases, PKDD \u201905. Springer, Berlin, pp 392\u2013403","DOI":"10.1007\/11564126_39"},{"key":"321_CR46","unstructured":"Yan X, Han J (2002) gspan: Graph-based substructure pattern mining. In: Proceedings of the (2002) IEEE international conference on data mining, ICDM \u201902. IEEE Computer Society, Washington, DC, pp 721\u2013724"},{"key":"321_CR47","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) Closegraph: mining closed frequent graph patterns. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201903. ACM, New York, pp 286\u2013295","DOI":"10.1145\/956750.956784"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0321-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-013-0321-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0321-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T12:01:26Z","timestamp":1563192086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-013-0321-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,15]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["321"],"URL":"https:\/\/doi.org\/10.1007\/s10618-013-0321-2","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,15]]}}}