{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:20Z","timestamp":1725750560279},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642408960"},{"type":"electronic","value":"9783642408977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40897-7_15","type":"book-chapter","created":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T20:50:20Z","timestamp":1380487820000},"page":"217-232","source":"Crossref","is-referenced-by-count":9,"title":["Mining Interesting Patterns in Multi-relational Data with N-ary Relationships"],"prefix":"10.1007","author":[{"given":"Eirini","family":"Spyropoulou","sequence":"first","affiliation":[]},{"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Boley","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Knowledge and data engineering group, University of Kassel: Benchmark folksonomy data from bibsonomy, version of January 1 (2012)"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.tcs.2009.10.024","volume":"411","author":"M. Boley","year":"2010","unstructured":"Boley, M., Horvath, T., Poign\u00e9, A., Wrobel, S.: Listing closed sets of strongly accessible set systems with applications to data mining. Theoretical Computer Science\u00a0411(3), 691\u2013700 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"15_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L. Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.-F.: Closed patterns meet n-ary relations. ACM Trans. Knowl. Discov. Data\u00a03(1), 3:1\u20133:36 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T. Bie De","year":"2011","unstructured":"De Bie, T.: Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Mining and Knowledge Discovery\u00a023(3), 407\u2013446 (2011)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"15_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":"15_CR6","unstructured":"Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems. Addison Wesley (2006)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Goethals, B., Page, W.L., Mampaey, M.: Mining interesting sets and rules in relational databases. In: Proc. of the ACM Symposium on Applied Computing (SAC), pp. 997\u20131001 (2010)","DOI":"10.1145\/1774088.1774299"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Jaschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: Trias\u2013an algorithm for mining iceberg tri-lattices. In: Proc. of the Sixth International Conference on Data Mining (ICDM), pp. 907\u2013911 (2006)","DOI":"10.1109\/ICDM.2006.162"},{"key":"15_CR9","unstructured":"Ji, L., Tan, K.-L., Tung, A.K.H.: Mining frequent closed cubes in 3d datasets. In: Proc. of the 32nd International Conference on Very Large Data Bases (VLDB), pp. 811\u2013822 (2006)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Koopman, A., Siebes, A.: Discovering relational item sets efficiently. In: Proc. of the SIAM Conference on Data Mining (SDM), pp. 108\u2013119 (2008)","DOI":"10.1137\/1.9781611972788.10"},{"key":"15_CR11","unstructured":"Ng, E.K.K., Ng, K., Fu, A.W.-C., Wang, K.: Mining association rules from stars. In: Proc. of the 2002 IEEE Int. Conference on Data Mining, ICDM, pp. 322\u2013329 (2002)"},{"key":"15_CR12","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-39804-2_32","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"S. Nijssen","year":"2003","unstructured":"Nijssen, S., Kok, J.N.: Efficient frequent query discovery in farmer. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS(LNAI), vol.\u00a02838, pp. 350\u2013362. Springer, Heidelberg (2003)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Spyropoulou, E., De Bie, T.: Interesting multi-relational patterns. In: Proc. of the IEEE International Conference on Data Mining, ICDM, pp. 675\u2013684 (2011)","DOI":"10.1109\/ICDM.2011.82"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Spyropoulou, E., De Bie, T., Boley, M.: Mining interesting patterns in multirelational data. Data Mining and Knowledge Discovery (in print, 2013)","DOI":"10.1007\/978-3-642-40897-7_15"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40897-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:50:22Z","timestamp":1558097422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40897-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408960","9783642408977"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40897-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}