{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:04:26Z","timestamp":1725890666487},"publisher-location":"Berlin, Heidelberg","reference-count":31,"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_33","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T02:18:14Z","timestamp":1347070694000},"page":"426-441","source":"Crossref","is-referenced-by-count":2,"title":["Nearly Exact Mining of Frequent Trees in Large Networks"],"prefix":"10.1007","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","reference":[{"key":"33_CR1","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)"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/ICDM.2011.101","volume-title":"Proceedings of the 2011 IEEE 11th International Conference on Data Mining, ICDM 2011","author":"P. Bogdanov","year":"2011","unstructured":"Bogdanov, P., Mongiov\u00ec, M., Singh, A.K.: Mining heavy subgraphs in time-evolving networks. In: Proceedings of the 2011 IEEE 11th International Conference on Data Mining, ICDM 2011, pp. 81\u201390. IEEE Computer Society, Washington, DC (2011)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/ICDM.2002.1183885","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002","author":"C. Borgelt","year":"2002","unstructured":"Borgelt, C., Berthold, M.R.: Mining molecular fragments: Finding relevant substructures of molecules. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002, pp. 51\u201358. IEEE Computer Society, Washington, DC (2002)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1133905.1133908","volume-title":"Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, OSDM 2005","author":"C. Borgelt","year":"2005","unstructured":"Borgelt, C., Meinl, T., Berthold, M.: Moss: a program for molecular substructure mining. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, OSDM 2005, pp. 6\u201315. ACM, New York (2005)"},{"key":"33_CR5","unstructured":"Bringmann, B., Nijssen, S.: 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 (2007)"},{"issue":"3","key":"33_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., Van Dyck, D.: All normalized anti-monotonic overlap graph measures are bounded. Data Mining and Knowl. Disc.\u00a023(3), 503\u2013548 (2011)","journal-title":"Data Mining and Knowl. Disc."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Xia, Y., Yang, Y., Muntz, R.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans. on Knowl. and Data Eng.\u00a017, 190\u2013202 (2005)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"33_CR8","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, Cuen, pp. 149\u2013159 (2001)"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L.P. Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026, 1367\u20131372 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn., electronic edn. Springer (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Dries, A., Nijssen, S.: Mining Patterns in Networks using Homomorphism. In: Proceedings of the Twelfth SIAM International Conference on Data Mining, pp. 260\u2013271. Omnipress (April 2012), \n                    \n                      https:\/\/lirias.kuleuven.be\/handle\/123456789\/350328","DOI":"10.1137\/1.9781611972825.23"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/1401890.1401925","volume-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008","author":"B. Gallagher","year":"2008","unstructured":"Gallagher, B., Tong, H., Eliassi-Rad, T., Faloutsos, C.: 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 2008, pp. 256\u2013264. ACM, New York (2008)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C., Markopoulou, A.: Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In: Proc. of IEEE INFOCOM 2010 (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"1","key":"33_CR14","doi-asserted-by":"crossref","first-page":"730","DOI":"10.14778\/1687627.1687710","volume":"2","author":"M.A. Hasan","year":"2009","unstructured":"Hasan, M.A., Zaki, M.J.: Output space sampling for graph patterns. Proceedings of the VLDB Endowment\u00a02(1), 730\u2013741 (2009)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1145\/2020408.2020512","volume-title":"Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2011","author":"K. Henderson","year":"2011","unstructured":"Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., Faloutsos, C.: 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 2011, pp. 663\u2013671. ACM, New York (2011)"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/ICDM.2003.1250974","volume-title":"Proceedings of the 2003 Third IEEE International Conference on Data Mining, ICDM 2003","author":"J. Huan","year":"2003","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceedings of the 2003 Third IEEE International Conference on Data Mining, ICDM 2003, pp. 549\u2013556. IEEE Computer Society, Washington, DC (2003)"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1145\/1014052.1014123","volume-title":"Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2004","author":"J. Huan","year":"2004","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2004, pp. 581\u2013586. ACM, New York (2004)"},{"key":"33_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2008","unstructured":"Koutis, I.: Faster Algebraic Algorithms for Path and Packing Problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 575\u2013586. Springer, Heidelberg (2008)"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-02927-1_54","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2009","unstructured":"Koutis, I., Williams, R.: Limits and Applications of Group Algebras for Parameterized Problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 653\u2013664. Springer, Heidelberg (2009)"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/ICDM.2001.989534","volume-title":"Proceedings of the 2001 IEEE International Conference on Data Mining, ICDM 2001","author":"M. Kuramochi","year":"2001","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the 2001 IEEE International Conference on Data Mining, ICDM 2001, pp. 313\u2013320. IEEE Computer Society, Washington, DC (2001)"},{"key":"33_CR22","first-page":"45","volume":"10","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congr. Numerantium\u00a010, 45\u201387 (1981)","journal-title":"Congr. Numerantium"},{"key":"33_CR23","series-title":"LNAI","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"S.-H. Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS (LNAI), vol.\u00a01228. Springer, Heidelberg (1997)"},{"key":"33_CR24","unstructured":"Nijssen, S., Kok, J.: There is no optimal, theta-subsumption based refinement operator, personal communication"},{"key":"33_CR25","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/1014052.1014134","volume-title":"Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2004","author":"S. Nijssen","year":"2004","unstructured":"Nijssen, S., Kok, J.N.: 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 2004, pp. 647\u2013652. ACM, New York (2004)"},{"issue":"1","key":"33_CR26","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. Electronic Notes in Theoretical Computer Science\u00a0127(1), 77\u201387 (2005); Proceedings of the International Workshop on Graph-Based Tools (GraBaTs 2004)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"33_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1839490.1839491","volume":"4","author":"L.T. Thomas","year":"2010","unstructured":"Thomas, L.T., Valluri, S.R., Karlapalem, K.: Margin: Maximal frequent subgraph mining. ACM Trans. Knowl. Discov. Data\u00a04, 10:1\u201310:42 (2010)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"1","key":"33_CR28","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J. Ullmann","year":"1976","unstructured":"Ullmann, J.: An algorithm for subgraph isomorphism. JACM\u00a023(1), 31\u201342 (1976)","journal-title":"JACM"},{"key":"33_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/11564126_39","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"M. W\u00f6rlein","year":"2005","unstructured":"W\u00f6rlein, M., Meinl, T., Fischer, I., Philippsen, M.: A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 392\u2013403. Springer, Heidelberg (2005)"},{"key":"33_CR30","first-page":"721","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002","author":"X. Yan","year":"2002","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002, pp. 721\u2013724. IEEE Computer Society, Washington, DC (2002)"},{"key":"33_CR31","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 286\u2013295. ACM, New York (2003)"}],"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_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T04:52:55Z","timestamp":1557204775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33460-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334597","9783642334603"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33460-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}