{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:40:07Z","timestamp":1748814007343,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662497838"},{"type":"electronic","value":"9783662497845"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49784-5_2","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T16:25:59Z","timestamp":1458318359000},"page":"32-60","source":"Crossref","is-referenced-by-count":2,"title":["Frequent Itemset Border Approximation by Dualization"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Durand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Quafafou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,18]]},"reference":[{"key":"2_CR1","unstructured":"Abreu, R., van Gemund, A.: A low-cost approximate minimal hitting set algorithm and its application to model-based diagnosis. In: Proceedings of the 8th Symposium on Abstraction, Reformulation and Approximation (SARA 2009), Lake Arrowhead, CA, USA, July 2009"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Afrati, F., Gionis, A., Mannila, H.: Approximating a collection of frequent sets. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pp. 12\u201319, Seattle, WA, USA, August 2004","DOI":"10.1145\/1014052.1014057"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large database. In: ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216, May 1993","DOI":"10.1145\/170036.170072"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bailey, J., Manoukian, T., Ramamohanarao, K.: A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 485\u2013488, Melbourne, Florida, USA, November 2003","DOI":"10.1109\/ICDM.2003.1250958"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo, R.: Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 85\u201393, Seattle, June 1998","DOI":"10.1145\/276305.276313"},{"key":"2_CR6","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets. North Holland Mathematical Library, vol. 45 (1989)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-75488-6_8","volume-title":"Discovery Science","author":"M Boley","year":"2007","unstructured":"Boley, M.: On approximating minimum infrequent and maximum frequent sets. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol. 4755, pp. 68\u201377. Springer, Heidelberg (2007)"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"JF Boulicaut","year":"2003","unstructured":"Boulicaut, J.F., Bykowski, A., Rigotti, R.: Free-sets : a condensed representation of boolean data for the approximation of frequency queries. Data Min. Knowl. Discov. 7(1), 5\u201322 (2003)","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: a maximal frequent itemset algorithm for transactional databases. In: Proceedings of International Conference on Data Engineering (ICDE 2001), pp. 443\u2013452, Heidelberg, Germany (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"De Marchi, F., Petit, J.: Zigzag: a new algorithm for mining large inclusion dependencies in database. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 27\u201334, Melbourne, Florida, USA, November 2003","DOI":"10.1109\/ICDM.2003.1250899"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD 1999), pp. 43\u201352, San Diego, USA, August 1999","DOI":"10.1145\/312129.312191"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10115-004-0178-1","volume":"8","author":"G Dong","year":"2005","unstructured":"Dong, G., Li, J.: Mining border descriptions of emerging patterns from datasetpairs. Knowl. Inf. Syst. 8(2), 178\u2013202 (2005)","journal-title":"Knowl. Inf. Syst."},{"issue":"7","key":"2_CR13","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1016\/j.patcog.2012.01.005","volume":"45","author":"A Ducournau","year":"2012","unstructured":"Ducournau, A., Bretto, A., Rital, S., Laget, B.: A reductive approach to hypergraph clustering: an application to image segmentation. Pattern Recogn. 45(7), 2788\u20132803 (2012)","journal-title":"Pattern Recogn."},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-1-4471-0651-7_13","volume-title":"Research and Development in Intelligent Systems XIX","author":"Nicolas Durand","year":"2003","unstructured":"Durand, N., Cr\u00e9milleux, B.: ECCLAT: a new approach of clusters discovery in categorical data. In: Proceedings of the 22nd SGAI International Conference on Knowledge Based Systems and Applied Artificial Intelligence (ES 2002), pp. 177\u2013190, Cambridge, UK, December 2002"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/978-3-319-10160-6_32","volume-title":"Data Warehousing and Knowledge Discovery","author":"N Durand","year":"2014","unstructured":"Durand, N., Quafafou, M.: Approximation of frequent itemset border by computing approximate minimal hypergraph transversals. In: Bellatreche, L., Mohania, M.K. (eds.) DaWaK 2014. LNCS, vol. 8646, pp. 357\u2013368. Springer, Heidelberg (2014)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T Eiter","year":"2002","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10844-008-0077-0","volume":"34","author":"F Flouvat","year":"2010","unstructured":"Flouvat, F., De Marchi, F., Petit, J.M.: A new classification of datasets for frequent itemsets. Intell. Inf. Syst. 34, 1\u201319 (2010)","journal-title":"Intell. Inf. Syst."},{"key":"2_CR18","unstructured":"Flouvat, F., De Marchi, F., Petit, J.: ABS: adaptive borders search of frequent itemsets. In: Proceedings of IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2004), Brighton, UK, November 2004"},{"issue":"3","key":"2_CR19","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. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"Algorithms"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K Gouda","year":"2005","unstructured":"Gouda, K., Zaki, M.J.: GenMax: an efficient algorithm for mining maximal frequent itemsets. Data Min. Knowl. Discov. 11, 1\u201320 (2005)","journal-title":"Data Min. Knowl. Discov."},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.S.: Discovering all most specific sentences. ACM Trans. Database Syst. 28(2), 140\u2013174 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15, 55\u201386 (2007)","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Hasan, M., Zaki, M.J.: MUSK: uniform sampling of k maximal patterns. In: SIAM Data Mining Conference (SDM 2009), pp. 650\u2013661, Sparks, Nevada, USA (2009)","DOI":"10.1137\/1.9781611972795.56"},{"issue":"4","key":"2_CR24","doi-asserted-by":"crossref","first-page":"415","DOI":"10.3233\/FUN-2007-80404","volume":"80","author":"C H\u00e9bert","year":"2007","unstructured":"H\u00e9bert, C., Bretto, A., Cr\u00e9milleux, B.: A data mining formalization to improve hypergraph transversal computation. Fundamenta Informaticae, IOS Press 80(4), 415\u2013433 (2007)","journal-title":"Fundamenta Informaticae, IOS Press"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Liu, L.: Cartesian contour: a concise representation for a collection of frequent sets. In: Proceedings of the 15th International Conference on Knowledge Discovery and Data Mining (KDD 2009), pp. 417\u2013425, Paris, France, June 2009","DOI":"10.1145\/1557019.1557069"},{"issue":"1","key":"2_CR26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.4064\/am-16-1-47-57","volume":"16","author":"M Karonski","year":"1977","unstructured":"Karonski, M., Palka, Z.: One standard Marczewski-Steinhaus outdistances between hypergraphs. Zastosowania Matematyki Applicationes Mathematicae 16(1), 47\u201357 (1977)","journal-title":"Zastosowania Matematyki Applicationes Mathematicae"},{"issue":"1","key":"2_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 7(1), 69\u201379 (1999)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"issue":"2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"239","DOI":"10.7155\/jgaa.00107","volume":"9","author":"D Kavvadias","year":"2005","unstructured":"Kavvadias, D., Stavropoulos, E.: An efficient algorithm for the transversal hypergraph generation. Graph Algorithms Appl. 9(2), 239\u2013264 (2005)","journal-title":"Graph Algorithms Appl."},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","first-page":"105","volume-title":"Advances in Database Technology - EDBT \u201998","author":"D-I Lin","year":"1998","unstructured":"Lin, D.-I., Kedem, Z.M.: Pincer search: a new algorithm for discovering the maximum frequent set. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 105\u2013119. Springer, Heidelberg (1998)"},{"issue":"3","key":"2_CR30","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Discov. 1(3), 241\u2013258 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Moens, S., Goethals, B.: Randomly sampling maximal itemsets. In: Proceedings of ACM SIGKDD Workshop on Interactive Data Exploration and Analytics (IDEA 2013), pp. 79\u201386, Chicago, Illinois, USA (2013)","DOI":"10.1145\/2501511.2501523"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.dam.2014.01.012","volume":"170","author":"K Murakami","year":"2014","unstructured":"Murakami, K., Uno, T.: Efficient algorithms for dualizing large-scale hypergraphs. Discrete Appl. Math. 170, 83\u201394 (2014)","journal-title":"Discrete Appl. Math."},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24(1), 25\u201346. Elsevier (1999)","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Ramamohanarao, K., Bailey, J., Fan, H.: Efficient mining of contrast patterns and their applications to classification. In: Proceedings of the 3rd International Conference on Intelligent Sensing and Information Processing (ICISIP 2005), pp. 39\u201347, Bangalore, India, December 2005","DOI":"10.1109\/ICISIP.2005.1619410"},{"key":"2_CR35","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-05183-8_1","volume-title":"Advances in Intelligent Information Systems","author":"F Rioult","year":"2010","unstructured":"Rioult, F., Zanuttini, B., Cr\u00e9milleux, B.: Nonredundant generalized rules and their impact in classification. In: Ras, Z.W., Tsay, L.-S. (eds.) Advances in Intelligent Information Systems. SCI, vol. 265, pp. 3\u201325. Springer, Heidelberg (2010)"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Ruchkys, D.P., Song, S.W.: A parallel approximation hitting set algorithm for gene expression analysis. In: Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2002), pp. 75\u201381, Washington, DC, USA, October 2002","DOI":"10.1109\/CAHPC.2002.1180762"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-39644-4_22","volume-title":"Discovery Science","author":"K Satoh","year":"2003","unstructured":"Satoh, K., Uno, T.: Enumerating maximal frequent sets using irredundant dualization. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 256\u2013268. Springer, Heidelberg (2003)"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0888-613X(00)00051-7","volume":"25","author":"S Vinterbo","year":"2000","unstructured":"Vinterbo, S., \u00d8hrn, A.: Minimal approximate hitting sets and rule templates. Approx. Reason. 25, 123\u2013143 (2000)","journal-title":"Approx. Reason."},{"issue":"1","key":"2_CR39","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. Discov. 23(1), 169\u2013214 (2011)","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceedings of International Conference on Knowledge Discovery in Databases (KDD 2004), pp. 344\u2013353, Seattle, WA, USA (2004)","DOI":"10.1145\/1014052.1014091"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Zhu, F., Yan, X., Han, J., Yu, P.S., Cheng, H.: Mining colossal frequent patterns by core pattern fusion. In: Proceedings of the 23rd International Conference on Data Engineering (ICDE 2007), pp. 706\u2013715, Istanbul, Turkey, April 2007","DOI":"10.1109\/ICDE.2007.367916"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49784-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:00:29Z","timestamp":1748811629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49784-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662497838","9783662497845"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49784-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}