{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:21:46Z","timestamp":1777962106415,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540887362","type":"print"},{"value":"9783540887379","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88737-9_16","type":"book-chapter","created":{"date-parts":[[2008,10,17]],"date-time":"2008-10-17T02:59:22Z","timestamp":1224212362000},"page":"205-213","source":"Crossref","is-referenced-by-count":10,"title":["On Reducing Redundancy in Mining Relational Association Rules from the Semantic Web"],"prefix":"10.1007","author":[{"given":"Joanna","family":"J\u00f3zefowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnieszka","family":"\u0141awrynowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"\u0141ukaszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0004-3702(88)90001-X","volume":"36","author":"W. Buntine","year":"1988","unstructured":"Buntine, W.: Generalized subsumption and its applications to induction and redundancy. Artificial Intelligence\u00a036(2), 149\u2013176 (1988)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"16_CR2","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(1), 7\u201336 (1999)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11580072_8","volume-title":"Rules and Rule Markup Languages for the Semantic Web","author":"J. J\u00f3zefowska","year":"2005","unstructured":"J\u00f3zefowska, J., \u0141awrynowicz, A., \u0141ukaszewski, T.: Towards discovery of frequent patterns in description logics with rules. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, vol.\u00a03791, pp. 84\u201397. Springer, Heidelberg (2005)"},{"key":"16_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11891451_26","volume-title":"Managing Knowledge in a World of Networks","author":"J. J\u00f3zefowska","year":"2006","unstructured":"J\u00f3zefowska, J., \u0141awrynowicz, A., \u0141ukaszewski, T.: Frequent pattern discovery in OWL DLP knowledge bases. In: Staab, S., Sv\u00e1tek, V. (eds.) EKAW 2006. LNCS (LNAI), vol.\u00a04248, pp. 287\u2013302. Springer, Heidelberg (2006)"},{"key":"16_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-30109-7_18","volume-title":"Inductive Logic Programming","author":"F.A. Lisi","year":"2004","unstructured":"Lisi, F.A., Esposito, F.: Efficient Evaluation of Candidate Hypotheses in \n                    \n                      \n                    \n                    $\\mathcal{AL}$\n                  -log. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol.\u00a03194, pp. 216\u2013233. Springer, Heidelberg (2004)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/B:MACH.0000023151.65011.a3","volume":"55","author":"F.A. Lisi","year":"2004","unstructured":"Lisi, F.A., Malerba, D.: Inducing Multi-Level Association Rules from Multiple Relation. Machine Learning Journal\u00a055, 175\u2013210 (2004)","journal-title":"Machine Learning Journal"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-540-30475-3_38","volume-title":"The Semantic Web \u2013 ISWC 2004","author":"B. Motik","year":"2004","unstructured":"Motik, B., Sattler, U., Studer, R.: Query Answering for OWL-DL with Rules. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol.\u00a03298, pp. 549\u2013563. Springer, Heidelberg (2004)"},{"key":"16_CR8","unstructured":"Nijssen, S., Kok, J.N.: Faster Association Rules for Multiple Relations. In: Proceedings of the IJCAI 2001, pp. 891\u2013897 (2001)"},{"key":"16_CR9","unstructured":"De Raedt, L., Ramon, J.: Condensed representations for Inductive Logic Programming. In: Proc. of the KR 2004, pp. 438\u2013446 (2004)"}],"container-title":["Lecture Notes in Computer Science","Web Reasoning and Rule Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88737-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T15:35:56Z","timestamp":1551627356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88737-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540887362","9783540887379"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88737-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}