{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:05:57Z","timestamp":1725563157614},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151040"},{"type":"electronic","value":"9783642151057"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15105-7_11","type":"book-chapter","created":{"date-parts":[[2010,8,30]],"date-time":"2010-08-30T06:21:03Z","timestamp":1283149263000},"page":"130-141","source":"Crossref","is-referenced-by-count":4,"title":["Mining Non-redundant Information-Theoretic Dependencies between Itemsets"],"prefix":"10.1007","author":[{"given":"Michael","family":"Mampaey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Mampaey, M.: Mining non-redundant information-theoretic dependencies between itemsets. Technical Report, University of Antwerp (2010)","DOI":"10.1007\/978-3-642-15105-7_11"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Record\u00a022(2), 207\u2013216 (1993)","journal-title":"ACM SIGMOD Record"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Record\u00a029(2), 1\u201312 (2000)","journal-title":"ACM SIGMOD Record"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Zaki, M., Parthasarathy, S., Ogihara, M., Li, W., et al.: New algorithms for fast discovery of association rules. In: Proceedings of KDD (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/235968.233311","volume":"25","author":"R. Srikant","year":"1996","unstructured":"Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. ACM SIGMOD Record\u00a025(2), 1\u201312 (1996)","journal-title":"ACM SIGMOD Record"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J. Kivinen","year":"1995","unstructured":"Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theoretical Computer Science\u00a0149(1), 129\u2013149 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y. Huhtala","year":"1999","unstructured":"Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: TANE: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal\u00a042(2), 100\u2013111 (1999)","journal-title":"The Computer Journal"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: Proceedings of KDD, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Balc\u00e1zar, J.L.: Minimum-size bases of association rules. In: Proceedings of ECML PKDD, pp. 86\u2013101 (2008)","DOI":"10.1007\/978-3-540-87479-9_24"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Dalkilic, M.M., Robertson, E.L.: Information dependencies. In: Proceedings of ACM PODS, pp. 245\u2013253 (2000)","DOI":"10.1145\/335168.336059"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Heikinheimo, H., Hinkkanen, E., Mannila, H., Mielik\u00e4inen, T., Sepp\u00e4nen, J.K.: Finding low-entropy sets and trees from binary data. In: Proceedings of KDD, pp. 350\u2013359 (2007)","DOI":"10.1145\/1281192.1281232"},{"key":"11_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-47887-6_13","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S. Jaroszewicz","year":"2002","unstructured":"Jaroszewicz, S., Simovici, D.A.: Pruning redundant association rules using maximum entropy principle. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 135\u2013147. Springer, Heidelberg (2002)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423 (1948)","journal-title":"Bell System Technical Journal"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Bayardo Jr., R.: Efficiently mining long patterns from databases. In: Proceedings of ACM SIGMOD, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.: Efficiently mining maximal frequent itemsets. In: Proceedings of IEEE ICDM, pp. 163\u2013170 (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceedings of ICDT, pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10618-006-0054-6","volume":"14","author":"T. Calders","year":"2007","unstructured":"Calders, T., Goethals, B.: Non-derivable itemset mining. Data Mining and Knowledge Discovery\u00a014(1), 171\u2013206 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/11733492_6","volume-title":"Knowledge Discovery in Inductive Databases","author":"T. Calders","year":"2006","unstructured":"Calders, T., Goethals, B.: Quick inclusion-exclusion. In: Bonchi, F., Boulicaut, J.-F. (eds.) KDID 2005. LNCS, vol.\u00a03933, pp. 86\u2013103. Springer, Heidelberg (2006)"},{"key":"11_CR19","unstructured":"Goethals, B.: Frequent itemset mining implementations repository, http:\/\/fimi.cs.helsinki.fi\/data"},{"key":"11_CR20","unstructured":"Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: TANE homepage, http:\/\/www.cs.helsinki.fi\/research\/fdk\/datamining\/tane"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15105-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T12:04:37Z","timestamp":1559477077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15105-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151040","9783642151057"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15105-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}