{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:32:31Z","timestamp":1770975151772,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540738466","type":"print"},{"value":"9783540738473","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73847-3_26","type":"book-chapter","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T23:23:12Z","timestamp":1190157792000},"page":"244-259","source":"Crossref","is-referenced-by-count":18,"title":["Frequent Hypergraph Mining"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Bringmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"De Raedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI\/MIT Press (1996)"},{"key":"26_CR2","series-title":"North Holland Mathematical Library","volume-title":"Hypergraphs","author":"C. Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs. North Holland Mathematical Library, vol.\u00a0445. Elsevier, Amsterdam (1989)"},{"key":"26_CR3","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L., Makino, K.: Dual bounded hypergraphs: A survey. In: Proc. of the 2nd SIAM Conference on Data Mining, pp. 87\u201398 (2002)"},{"key":"26_CR4","first-page":"161","volume":"66","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Nijssen, S., Muntz, R.R., Kok, J.N.: Frequent subtree mining\u2013an overview. Fundamenta Informaticae\u00a066, 161\u2013198 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"Dehaspe, L., Toivonen, H.: Discovery of frequent DATALOG patterns. Data Mining and Knowledge Discovery\u00a03, 7\u201336 (1999)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"26_CR6","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"26_CR7","volume-title":"Relational Data Mining","year":"2002","unstructured":"D\u017eeroski, S., Lavra\u010d, N. (eds.): Relational Data Mining. Springer, New York (2002)"},{"key":"26_CR8","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"issue":"6","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing\u00a024(6), 1278\u20131304 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM\u00a030(3), 514\u2013550 (1983)","journal-title":"Journal of the ACM"},{"key":"26_CR11","volume-title":"Computers and Intractability: A Guide to NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to NP-Completeness. Freeman, San Francisco, CA (1979)"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","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., Sharm, R.S.: Discovering all most specific sentences. ACM Transactions on Database Systems\u00a028(2), 140\u2013174 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/1150402.1150427","volume-title":"Proc. of the 12th ACM SIGKDD International Conference on Knowledge discovery and Data Mining","author":"T. Horv\u00e1th","year":"2006","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: Proc. of the 12th ACM SIGKDD International Conference on Knowledge discovery and Data Mining, pp. 197\u2013206. ACM Press, New York (2006)"},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","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 Mining and Knowledge Discovery\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"26_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery\u00a01(3), 259\u2013289 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"26_CR17","first-page":"891","volume-title":"Proc. of the 17th International Joint Conference on Artificial Intelligence","author":"S. Nijssen","year":"2001","unstructured":"Nijssen, S., Kok, J.N.: Efficient frequent query discovery in FARMER. In: Proc. of the 17th International Joint Conference on Artificial Intelligence, pp. 891\u2013896. Morgan Kaufmann, San Francisco (2001)"},{"key":"26_CR18","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","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, pp. 647\u2013652. ACM Press, New York (2004)"},{"key":"26_CR19","first-page":"721","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining","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, pp. 721\u2013724. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"26_CR20","first-page":"306","volume-title":"Proceedings of Computer Software and Applications Conference","author":"C.T. Yu","year":"1979","unstructured":"Yu, C.T., Ozsoyoglu, M.Z.: An algorithm for tree-query membership of a distributed query. In: Proceedings of Computer Software and Applications Conference, pp. 306\u2013312. IEEE Computer Society Press, Los Alamitos (1979)"},{"key":"26_CR21","first-page":"71","volume-title":"Proceedings of the 8th ACM SIGKDD International Conference","author":"M.J. Zaki","year":"2002","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proceedings of the 8th ACM SIGKDD International Conference, pp. 71\u201380. ACM Press, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73847-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:25:48Z","timestamp":1558261548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73847-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540738466","9783540738473"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73847-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}