{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:16:28Z","timestamp":1743048988501,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319462264"},{"type":"electronic","value":"9783319462271"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46227-1_26","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T05:34:10Z","timestamp":1472880850000},"page":"410-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Bayesian Network Model for Interesting Itemsets"],"prefix":"10.1007","author":[{"given":"Jaroslav","family":"Fowkes","sequence":"first","affiliation":[]},{"given":"Charles","family":"Sutton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C., Han, J.: Frequent Pattern Mining. Springer (2014)","DOI":"10.1007\/978-3-319-07821-2"},{"key":"26_CR2","first-page":"487","volume":"1215","author":"R Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. VLDB 1215, 487\u2013499 (1994)","journal-title":"VLDB"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198\u2013203 (1981)","journal-title":"J. Algorithms"},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"26_CR5","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A Dempster","year":"1977","unstructured":"Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B 39, 1\u201338 (1977)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"4","key":"26_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-53917-6_9","volume-title":"Advanced Data Mining and Applications","author":"P Fournier-Viger","year":"2013","unstructured":"Fournier-Viger, P., Mwamikazi, E., Gueniche, T., Faghihi, U.: MEIT: memory efficient itemset tree for targeted association rule mining. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds.) ADMA 2013. LNCS (LNAI), vol. 8347, pp. 95\u2013106. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-53917-6_9"},{"key":"26_CR9","unstructured":"Friedman, N.: The Bayesian structural EM algorithm. In: UAI, pp. 129\u2013138 (1998)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-74976-9_44","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"A Gallo","year":"2007","unstructured":"Gallo, A., Bie, T., Cristianini, N.: MINI: mining informative non-redundant itemsets. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. Lecture Notes in Artificial Intelligence (LNAI), vol. 4702, pp. 438\u2013445. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74976-9_44"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-540-30214-8_22","volume-title":"Discovery Science","author":"Floris Geerts","year":"2004","unstructured":"Geerts, F., Goethals, B., Mielik\u00e4inen, T.: Tiling databases. In: Discovery science, pp. 278\u2013289 (2004)"},{"key":"26_CR12","unstructured":"Goethals, B., Zaki, M.: FIMI repository (2004). http:\/\/fimi.ua.ac.be\/"},{"key":"26_CR13","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. SIGMOD Record 29, 1\u201312 (2000)","journal-title":"SIGMOD Record"},{"key":"26_CR14","unstructured":"He, R., Shapiro, J.: Bayesian mixture models for frequent itemset discovery. arXiv preprint (2012). arXiv:1209.6001"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Jaroszewicz, S., Simovici, D.A.: Interestingness of frequent itemsets using Bayesian networks as background knowledge. In: SIGKDD, pp. 178\u2013186 (2004)","DOI":"10.1145\/1014052.1014074"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Kontonasios, K.N., De Bie, T.: An information-theoretic approach to finding informative noisy tiles in binary databases. In: SDM, pp. 153\u2013164 (2010)","DOI":"10.1137\/1.9781611972801.14"},{"key":"26_CR17","volume-title":"Algorithms and Combinatorics","author":"B Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial optimization: theory and algorithms. In: Korte, B., Vygen, J. (eds.) Algorithms and Combinatorics. Springer, Heidelberg (2012)"},{"key":"26_CR18","volume-title":"Information Theory, Inference, and Learning Algorithms","author":"DJC MacKay","year":"2003","unstructured":"MacKay, D.J.C.: Information Theory, Inference, and Learning Algorithms. Cambridge University Press, Cambridge (2003)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Mampaey, M., Tatti, N., Vreeken, J.: Tell me what i need to know: succinctly summarizing data with itemsets. In: SIGKDD, pp. 573\u2013581 (2011)","DOI":"10.1145\/2020408.2020499"},{"issue":"4","key":"26_CR20","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/2382577.2382580","volume":"6","author":"M Mampaey","year":"2012","unstructured":"Mampaey, M., Vreeken, J., Tatti, N.: Summarizing data succinctly with the most informative itemsets. TKDD 6(4), 16 (2012)","journal-title":"TKDD"},{"key":"26_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"C Manning","year":"2008","unstructured":"Manning, C., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)"},{"issue":"10","key":"26_CR22","first-page":"1348","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen, P., Mielikainen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. IEEE TKDE 20(10), 1348\u20131362 (2008)","journal-title":"IEEE TKDE"},{"key":"26_CR23","unstructured":"Mitchell-Jones, A., Amori, G., Bogdanowicz, W., Kry\u0161tufek, B., Reijnders, P., Spitzenberger, F., Stubbe, M., Thissen, J., Vohral\u00edk, V., Zima, J.: The Atlas of European Mammals. T & AD Poyser (1999)"},{"key":"26_CR24","volume-title":"Machine Learning: A Probabilistic Perspective","author":"K Murphy","year":"2012","unstructured":"Murphy, K.: Machine Learning: A Probabilistic Perspective. MIT Press, Cambridge (2012)"},{"issue":"4","key":"26_CR25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1055\/s-0038-1634846","volume":"30","author":"MA Shwe","year":"1991","unstructured":"Shwe, M.A., Middleton, B., Heckerman, D., Henrion, M., Horvitz, E., Lehmann, H., Cooper, G.: Probabilistic diagnosis using a reformulation of the INTERNIST-1\/QMR knowledge base. Methods Inf. Med. 30(4), 241\u2013255 (1991)","journal-title":"Methods Inf. Med."},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Smets, K., Vreeken, J.: SLIM: Directly mining descriptive patterns. In: SDM, pp. 236\u2013247 (2012)","DOI":"10.1137\/1.9781611972825.21"},{"key":"26_CR27","unstructured":"USDA: The PLANTS Database (2008). http:\/\/plants.usda.gov\/"},{"issue":"1","key":"26_CR28","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken, J., Van Leeuwen, M., Siebes, A.: KRIMP: mining itemsets that compress. Data Min. Knowl. Discovery 23(1), 169\u2013214 (2011)","journal-title":"Data Min. Knowl. Discovery"},{"issue":"3","key":"26_CR29","first-page":"15","volume":"8","author":"GI Webb","year":"2014","unstructured":"Webb, G.I., Vreeken, J.: Efficient discovery of the most interesting associations. TKDD 8(3), 15 (2014)","journal-title":"TKDD"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Young, N.: Greedy set-cover algorithms (1974\u20131979, Chv\u00e1tal, Johnson, Lov\u00e1sz, Stein). In: Kao, M. (ed.) Encyclopedia of Algorithms, pp. 379\u2013381 (2008)","DOI":"10.1007\/978-0-387-30162-4_175"},{"key":"26_CR31","first-page":"457","volume":"2","author":"MJ Zaki","year":"2002","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: an efficient algorithm for closed itemset mining. SDM 2, 457\u2013473 (2002)","journal-title":"SDM"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46227-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T05:47:40Z","timestamp":1718776060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-46227-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319462264","9783319462271"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46227-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riva del Garda","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}