{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:40:10Z","timestamp":1746348010590,"version":"3.40.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319101590"},{"type":"electronic","value":"9783319101606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10160-6_32","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T03:14:54Z","timestamp":1408504494000},"page":"357-368","source":"Crossref","is-referenced-by-count":5,"title":["Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals"],"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","reference":[{"key":"32_CR1","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 Mining and Knowledge Discovery\u00a015, 55\u201386 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"32_CR2","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 Mining and Knowledge Discovery\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"De Marchi, F., Petit, J.: Zigzag: a New Algorithm for Mining Large Inclusion Dependencies in Database. In: ICDM 2003, pp. 27\u201334 (November 2003)","DOI":"10.1109\/ICDM.2003.1250899"},{"key":"32_CR4","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol.\u00a045. North Holland Mathematical Library (1989)"},{"key":"32_CR5","unstructured":"Abreu, R., van Gemund, A.: A Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis. In: SARA 2009 (July 2009)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Ruchkys, D.P., Song, S.W.: A Parallel Approximation Hitting Set Algorithm for Gene Expression Analysis. In: SBAC-PAD 2002, pp. 75\u201381 (2002)","DOI":"10.1109\/CAHPC.2002.1180762"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Moens, S., Goethals, B.: Randomly Sampling Maximal Itemsets. In: IDEA 2013, Chicago, Illinois, USA, pp. 79\u201386 (2013)","DOI":"10.1145\/2501511.2501523"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: Mining Itemsets that Compress. Data Mining and Knowledge Discovery 23(1) (2011)","DOI":"10.1007\/s10618-010-0202-x"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Afrati, F., Gionis, A., Mannila, H.: Approximating a Collection of Frequent Sets. In: KDD 2004, pp. 12\u201319 (August 2004)","DOI":"10.1145\/1014052.1014057"},{"key":"32_CR10","unstructured":"Hagen, M.: Algorithmic and Computational Complexity Issues of MONET. PhD thesis, Friedrich-Schiller-Universitat Jena (November 2008)"},{"key":"32_CR11","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. Approximate Reasoning\u00a025, 123\u2013143 (2000)","journal-title":"Approximate Reasoning"},{"key":"32_CR12","series-title":"SCI","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.\u00a0265, pp. 3\u201325. Springer, Heidelberg (2010)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets. In: ICDM 2001, pp. 163\u2013170 (November 2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"32_CR14","series-title":"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.\u00a02843, pp. 256\u2013268. Springer, Heidelberg (2003)"},{"issue":"2","key":"32_CR15","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. Knowledge and Information Systems\u00a08(2), 178\u2013202 (2005)","journal-title":"Knowledge and Information Systems"}],"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-319-10160-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:27:21Z","timestamp":1746347241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10160-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319101590","9783319101606"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10160-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}