{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:10Z","timestamp":1740099610202,"version":"3.37.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030351656"},{"type":"electronic","value":"9783030351663"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35166-3_14","type":"book-chapter","created":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T10:01:27Z","timestamp":1573898487000},"page":"193-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Number of Minimal Hypergraph Transversals and Complexity of IFM with Infrequency: High in Theory, but Often Not so Much in Practice!"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3584-5372","authenticated-orcid":false,"given":"Domenico","family":"Sacc\u00e0","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0689-5063","authenticated-orcid":false,"given":"Edoardo","family":"Serra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,12]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, SIGMOD 1993, pp. 207\u2013216. ACM, New York (1993). https:\/\/doi.org\/10.1145\/170035.170072","DOI":"10.1145\/170035.170072"},{"key":"14_CR2","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland Pub. Co., Amsterdam (1973)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1024605820527","volume":"39","author":"E Boros","year":"2003","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On maximal frequent and minimal infrequent sets in binary matrices. Ann. Math. Artif. Intell. 39, 211\u2013221 (2003). https:\/\/doi.org\/10.1023\/A:1024605820527","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20132","key":"14_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2007.11.003","volume":"394","author":"T Calders","year":"2008","unstructured":"Calders, T.: Itemset frequency satisfiability: complexity and axiomatization. Theoret. Comput. Sci. 394(1\u20132), 84\u2013111 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.11.003","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.disopt.2010.02.006","volume":"8","author":"P Damaschke","year":"2011","unstructured":"Damaschke, P.: Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. Discret. Optim. 8(1), 18\u201324 (2011). https:\/\/doi.org\/10.1016\/j.disopt.2010.02.006","journal-title":"Discret. Optim."},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b135457","volume-title":"Column Generation","author":"G Desaulniers","year":"2005","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation. Springer, New York (2005). https:\/\/doi.org\/10.1007\/b135457"},{"key":"14_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"issue":"6","key":"14_CR8","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 J. Comput. 24(6), 1278\u20131304 (1995). https:\/\/doi.org\/10.1137\/S0097539793250299","journal-title":"SIAM J. Comput."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-45220-1_18","volume-title":"Computer Science Logic","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Makino, K.: Generating all abductive explanations for queries on propositional horn theories. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 197\u2013211. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45220-1_18"},{"key":"14_CR10","unstructured":"Elbassioni, K.M., Rauf, I., Ray, S.: Enumerating minimal transversals of geometric hypergraphs. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, 10\u201312 August (2011)"},{"key":"14_CR11","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996). https:\/\/doi.org\/10.1006\/jagm.1996.0062","journal-title":"J. Algorithms"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/15M1027267","volume":"47","author":"G Gottlob","year":"2018","unstructured":"Gottlob, G., Malizia, E.: Achieving new upper bounds for the hypergraph duality problem through logic. SIAM J. Comput. 47(2), 456\u2013492 (2018). https:\/\/doi.org\/10.1137\/15M1027267","journal-title":"SIAM J. Comput."},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Gottlob, G.: Deciding monotone duality and identifying frequent itemsets in quadratic logspace. In: Hull, R., Fan, W. (eds.) PODS, pp. 25\u201336. ACM (2013). https:\/\/doi.org\/10.1145\/2463664.2463673","DOI":"10.1145\/2463664.2463673"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: Mendelzon, A.O., \u00d6zsoyoglu, Z.M. (eds.) PODS 1997, pp. 209\u2013216. ACM Press (1997). https:\/\/doi.org\/10.1145\/263661.263684","DOI":"10.1145\/263661.263684"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2541268.2541271","volume":"7","author":"A Guzzo","year":"2013","unstructured":"Guzzo, A., Moccia, L., Sacc\u00e0, D., Serra, E.: Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs. ACM Trans. Knowl. Discov. Data 7(4), 18:1\u201318:39 (2013). https:\/\/doi.org\/10.1145\/2541268.2541271","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-57568-5_271","volume-title":"Algorithms and Computation","author":"D Kavvadias","year":"1993","unstructured":"Kavvadias, D., Papadimitriou, C.H., Sideri, M.: On horn envelopes and hypergraph transversals. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 399\u2013405. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57568-5_271"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2007.03.005","volume":"382","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K.M., Gurvich, V.: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. 382(2), 139\u2013150 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.03.005","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-007-0111-5","volume":"17","author":"G Liu","year":"2008","unstructured":"Liu, G., Li, J., Wong, L.: A new concise representation of frequent itemsets using generators and a positive border. Knowl. Inf. Syst. 17(1), 35\u201356 (2008). https:\/\/doi.org\/10.1007\/s10115-007-0111-5","journal-title":"Knowl. Inf. Syst."},{"key":"14_CR20","unstructured":"Mielikainen, T.: On inverse frequent set mining. In: Proceedings of 2nd Workshop on Privacy Preserving Data Mining, PPDM 2003, pp. 18\u201323. IEEE Computer Society, Washington, DC (2003)"},{"key":"14_CR21","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57\u201395 (1987). https:\/\/doi.org\/10.1016\/0004-3702(87)90062-2","journal-title":"Artif. Intell."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Sacc\u00e0, D., Serra, E.: On line appendix to: number of minimal hypergraph transversals and complexity of IFM with infrequency: high in theory, but often not so much in practice! Version of 12 September 2019. http:\/\/sacca.deis.unical.it\/#view=object&format=object&id=1490\/gid=160","DOI":"10.1007\/978-3-030-35166-3_14"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-28472-4_20","volume-title":"Foundations of Information and Knowledge Systems","author":"D Sacc\u00e0","year":"2012","unstructured":"Sacc\u00e0, D., Serra, E., Guzzo, A.: Count constraints and the inverse OLAP problem: definition, complexity and a step toward aggregate data exchange. In: Lukasiewicz, T., Sali, A. (eds.) FoIKS 2012. LNCS, vol. 7153, pp. 352\u2013369. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28472-4_20"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1007\/s10618-019-00643-1","volume":"33","author":"D Sacc\u00e1","year":"2019","unstructured":"Sacc\u00e1, D., Serra, E., Rullo, A.: Extending inverse frequent itemsets miningto generate realistic datasets: complexity, accuracy and emerging applications. Data Min. Knowl. Discov. 33, 1736\u20131774 (2019). https:\/\/doi.org\/10.1007\/s10618-019-00643-1","journal-title":"Data Min. Knowl. Discov."},{"issue":"3","key":"14_CR26","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/3306448","volume":"62","author":"MY Vardi","year":"2019","unstructured":"Vardi, M.Y.: Lost in math? Commun. ACM 62(3), 7 (2019). https:\/\/doi.org\/10.1145\/3306448","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2019 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35166-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T06:29:37Z","timestamp":1576132177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35166-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030351656","9783030351663"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35166-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aiia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}