{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T22:58:22Z","timestamp":1791154702294,"version":"4.1.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T00:00:00Z","timestamp":1353024000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10472-012-9324-8","type":"journal-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T14:17:41Z","timestamp":1352989061000},"page":"315-342","source":"Crossref","is-referenced-by-count":11,"title":["Mining closed patterns in relational, graph and network data"],"prefix":"10.1007","volume":"69","author":[{"given":"Gemma C.","family":"Garriga","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roni","family":"Khardon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luc","family":"De Raedt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,11,16]]},"reference":[{"key":"9324_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of ACM SIGMOD Conference on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"9324_CR2","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328 (1996)"},{"key":"9324_CR3","doi-asserted-by":"crossref","unstructured":"Arimura, H., Uno, T.: An output-polynomial time algorithm for mining frequent closed attribute trees. In: Proc. 15th Conference on Inductive Logic Programming, pp. 1\u201319 (2005)","DOI":"10.1007\/11536314_1"},{"key":"9324_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.tcs.2006.11.009","volume":"371","author":"J Balc\u00e1zar","year":"2007","unstructured":"Balc\u00e1zar, J., Garriga, G.: Horn axiomatizations for sequential data. Theor. Comput. Sci. 371, 247\u2013264 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9324_CR5","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume":"1861","author":"Y Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. Lect. Notes Comput. Sci. 1861, 972\u2013986 (2000)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9324_CR6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1093\/toxsci\/54.1.138","volume":"54","author":"R Blair","year":"2000","unstructured":"Blair, R., Fang, H., Branham, W., Hass, B., Dial, S., Moland, C., Tong, W., Shi, L., Perkins, R., Sheehan, D.: The estrogen receptor relative binding affinities of 188 natural and xenochemicals: structural diversity of ligands. Toxicol. Sci. 54, 138\u2013153 (2000)","journal-title":"Toxicol. Sci."},{"key":"9324_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1024605820527","volume":"39","author":"E Boros","year":"2003","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On maximal frequent and minimal infrequent sets in binary matrices. Ann. Math. Artif. Intell. 39, 211\u2013221 (2003)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9324_CR8","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1093\/jn\/132.4.658","volume":"132","author":"W Branham","year":"2002","unstructured":"Branham, W., Dial, S., Moland, C., Hass, B., Blair, R., Fang, H., Shi, L., Tong, W., Perkins, R., Sheehan, D.: Binding of phytoestrogens and mycoestrogens to the rat uterine estrogen receptor. J. Nutr. 132, 658\u2013664 (2002)","journal-title":"J. Nutr."},{"key":"9324_CR9","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Proceedings 12th Pacific-Asia Conference on Knowledge Discovery in Databases, pp. 858\u2013863. Springer (2008)","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"9324_CR10","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt, L.: Logical and Relational Learning. Springer (2008)","DOI":"10.1007\/978-3-540-88190-2_1"},{"key":"9324_CR11","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1023\/A:1007361123060","volume":"26","author":"L Raedt De","year":"1997","unstructured":"De Raedt, L., Dehaspe, L.: Clausal discovery. Mach. Learn. 26, 1058\u20131063 (1997)","journal-title":"Mach. Learn."},{"key":"9324_CR12","unstructured":"De Raedt, L., Ramon, J.: Condensed representations for Inductive Logic Programming. In: Proc. of the 9th International Conference on Principles of Knowledge Representation and Reasoning, pp. 438\u2013446 (2004)"},{"key":"9324_CR13","first-page":"189","volume-title":"Discovery of relational association rules. Relational Data Mining","author":"L Dehaspe","year":"2000","unstructured":"Dehaspe, L., Toivonen, H.: Discovery of relational association rules. Relational Data Mining, pp. 189\u2013208. Springer-Verlag New York, Inc. New York, NY, USA (2000)"},{"key":"9324_CR14","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Kuramochi, M., & Karypis, G.: Frequent sub-structure-based approaches for classifying chemical compounds. In: Proc. of the Third IEEE International Conference on Data Mining, pp. 35\u201342 (2003)","DOI":"10.1109\/ICDM.2003.1250900"},{"key":"9324_CR15","doi-asserted-by":"crossref","unstructured":"Di\u00a0Mauro, N., Basile, T., Ferilli, S., Esposito, F., Fanizzi, N.: An exhaustive matching procedure for the improvement of learning efficiency. In: Proceedings 13th International Conference on Inductive Logic Programming, pp. 112\u2013129. Springer (2003)","DOI":"10.1007\/978-3-540-39917-9_9"},{"key":"9324_CR16","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1021\/tx000208y","volume":"14","author":"H Fang","year":"2001","unstructured":"Fang, H., Tong, W., Shi, L., Blair, R., Perkins, R., Branham, W., Hass, B., Xie, Q., Dial, S., Moland, C., Sheehan, D.: Structure-activity relationships for a large diverse set of natural, synthetic, and environmental estrogens. Chem. Res. Toxicol. 14, 280\u2013294 (2001)","journal-title":"Chem. Res. Toxicol."},{"key":"9324_CR17","unstructured":"Fiedler, M., Borgelt, C.: Support computation for mining frequent subgraphs in a single graph. In: Proceedings of the Workshop on Mining and Learning with Graphs (2007)"},{"key":"9324_CR18","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer (1998)","DOI":"10.1007\/978-3-642-59830-2"},{"key":"9324_CR19","unstructured":"Garriga, G., Khardon, R., De\u00a0Raedt, L.: On mining closed sets in multi-relational data. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (2007)"},{"key":"9324_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1007730.1007744","volume":"6","author":"B Goethals","year":"2004","unstructured":"Goethals, B., Zaki, M.: Advances in frequent itemset mining implementations: report on FIMI\u201903. SIGKDD Explor. Newsl. 6, 109\u2013117 (2004)","journal-title":"SIGKDD Explor. Newsl."},{"key":"9324_CR21","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.: Discovering all most specific sentences. ACM Trans. Database Syst. 28, 140\u2013174 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"9324_CR22","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y. Mining frequent patterns without candidate generation. In: Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"9324_CR23","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Alexin, Z., Gyim\u00f3thy, T., Wrobel, S.: Application of different learning methods to Hungarian part-of-speech tagging. In: Proceedings 9th International Workshop on Inductive Logic Programming, pp. 128\u2013139 (1999)","DOI":"10.1007\/3-540-48751-4_13"},{"key":"9324_CR24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(01)00062-5","volume":"128","author":"T Horv\u00e1th","year":"2001","unstructured":"Horv\u00e1th, T., Tur\u00e1n, G.: Learning logic programs with structured background knowledge. Artif. Intell. 128, 31\u201397 (2001)","journal-title":"Artif. Intell."},{"key":"9324_CR25","unstructured":"Kramer, S., De Raedt, L.: Feature construction with version spaces for biochemical applications. In: Proceedings of the 18th International Conference on Machine Learning, pp. 258\u2013265 (2001)"},{"key":"9324_CR26","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. In: Proceedings of the Fourth SIAM International Conference on Data Mining. SIAM (2004)","DOI":"10.1137\/1.9781611972740.32"},{"key":"9324_CR27","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S.: Learning of simple conceptual graphs from positive and negative examples. In: Proceedings of the 3rd European Conference on Principles and Practive of Knowledge Discovery in Databases, pp. 384\u2013391 (1999)","DOI":"10.1007\/978-3-540-48247-5_47"},{"key":"9324_CR28","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S.: Machine learning and formal concept analysis. In: Proceedings of the 2nd International Conference on Formal Concept Analysis, pp. 287\u2013312 (2004)","DOI":"10.1007\/978-3-540-24651-0_25"},{"key":"9324_CR29","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S., Samokhin, M.: Learning closed sets of labeled graphs for chemical applications. In: Proceedings of the 15th International Conference on Inductive Logic Programming, pp. 190\u2013208 (2005)","DOI":"10.1007\/11536314_12"},{"key":"9324_CR30","doi-asserted-by":"crossref","unstructured":"Lloyd, J.: Foundations of Logic Programming. Springer (1987)","DOI":"10.1007\/978-3-642-83189-8"},{"key":"9324_CR31","doi-asserted-by":"crossref","unstructured":"Malerba, D., Lisi, F.: Discovering associations between spatial objects: an ILP application. In: 11th International Conference on ILP, pp. 156\u2013163 (2001)","DOI":"10.1007\/3-540-44797-0_13"},{"key":"9324_CR32","first-page":"220","volume-title":"Improving efficiency of frequent query discovery by eliminating nonrelevant candidates. Discovery Science","author":"J Maloberti","year":"2003","unstructured":"Maloberti, J., Suzuki, E.: Improving efficiency of frequent query discovery by eliminating non-relevant candidates. Discovery Science, pp. 220\u2013232. Springer Berlin Heidelberg, Heidelberg (2003)"},{"key":"9324_CR33","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Disc. 1, 241\u2013258 (1997)","journal-title":"Data Min. Knowl. Disc."},{"key":"9324_CR34","unstructured":"McCallum, A., Nigam, K., Rennie, J., Seymore, K.: A machine learning approach to building domain-specific search engines. In: Proc. of the 16th International Joint Conference on Artificial Intelligence (1999)"},{"key":"9324_CR35","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"20","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S., De\u00a0Raedt, L.: Inductive logic programming: theory and methods. J. Log. Program. 20, 629\u2013679 (1994)","journal-title":"J. Log. Program."},{"key":"9324_CR36","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng, S., De\u00a0Wolf, R.: Foundations of inductive logic programming. In: Lecture Notes in Artificial Intelligence, no. 1228. Springer (1997)","DOI":"10.1007\/3-540-62927-0"},{"key":"9324_CR37","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.: Efficient frequent query discovery in FARMER. In: Proc. of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 350\u2013362 (2003)","DOI":"10.1007\/978-3-540-39804-2_32"},{"key":"9324_CR38","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proc. of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"9324_CR39","unstructured":"Plotkin, G.D.: A note on inductive generalization. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 5, pp. 153\u2013163. American Elsevier (1970)"},{"key":"9324_CR40","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10994-010-5193-8","volume":"83","author":"L Schietgat","year":"2011","unstructured":"Schietgat, L., Costa, F., Ramon, J., De Raedt, L.: Effective feature construction by maximum common subgraph sampling. Mach. Learn. 83, 137\u2013161 (2011)","journal-title":"Mach. Learn."},{"key":"9324_CR41","doi-asserted-by":"crossref","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Proceedings of the 7th International Conference on Discovery Science, pp. 16\u201331 (2004)","DOI":"10.1007\/978-3-540-30214-8_2"},{"key":"9324_CR42","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proceedings of the 2nd IEEE International Conference on Data Mining, pp. 721\u2013724 (2002)"},{"key":"9324_CR43","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 286\u2013295 (2003)","DOI":"10.1145\/956755.956784"},{"key":"9324_CR44","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"4","author":"M Zaki","year":"2004","unstructured":"Zaki, M.: Mining non-redundant association rules. Data Min. Knowl. Disc. 4, 223\u2013248 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"9324_CR45","doi-asserted-by":"crossref","unstructured":"Zaki, M., Hsiao, C.: CHARM: an efficient algorithm for closed itemset mining. In: Proc. of the 2nd. SIAM International Conference on Data Mining (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-012-9324-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-012-9324-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-012-9324-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T17:20:47Z","timestamp":1562347247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-012-9324-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,16]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9324"],"URL":"https:\/\/doi.org\/10.1007\/s10472-012-9324-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,16]]}}}