{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:59Z","timestamp":1740123599971,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T00:00:00Z","timestamp":1657756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T00:00:00Z","timestamp":1657756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s11227-022-04667-1","type":"journal-article","created":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T17:03:13Z","timestamp":1657818193000},"page":"650-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2361-7866","authenticated-orcid":false,"given":"Soufia","family":"Bennai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamal","family":"Amroun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Loudni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelkader","family":"Ouali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,14]]},"reference":[{"key":"4667_CR1","doi-asserted-by":"crossref","unstructured":"Pesant G (2004) A regular language membership constraint for finite sequences of variables. In: International Conference on Principles and Practice of Constraint Programming. Springer, Berlin, pp 482\u2013495","DOI":"10.1007\/978-3-540-30201-8_36"},{"issue":"2","key":"4667_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10601-009-9087-y","volume":"15","author":"KCK Cheng","year":"2010","unstructured":"Cheng KCK, Yap RHC (2010) An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15(2):265\u2013304","journal-title":"Constraints"},{"key":"4667_CR3","unstructured":"Mohr R, Masini G (1988) Good old discrete relaxation. In: 8th European Conference on Artificial Intelligence (ECAI \u201988), Munich, pp 651\u2013656"},{"key":"4667_CR4","first-page":"398","volume-title":"IJCAI-97","author":"C Bessiere","year":"1997","unstructured":"Bessiere C, R\u00e9gin J-C (1997) Arc consistency for general constraint networks: preliminary results. In: IJCAI-97. Nagoya, Japan, pp 398\u2013404"},{"key":"4667_CR5","doi-asserted-by":"crossref","unstructured":"Yap RHC, Xia W, Wang R (2020) Generalized arc consistency algorithms for table constraints: a summary of algorithmic ideas. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 13590\u201313597","DOI":"10.1609\/aaai.v34i09.7086"},{"issue":"2","key":"4667_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","volume":"165","author":"C Bessiere","year":"2005","unstructured":"Bessiere C, R\u00e9gin J-C, Yap RHC et al (2005) An optimal coarse-grained arc consistency algorithm. Artif Intell 165(2):165\u2013185","journal-title":"Artif Intell"},{"key":"4667_CR7","unstructured":"Wang R, Xia W, Yap RHC et al (2016) Optimizing simple tabular reduction with a bitwise representation. In: IJCAI, pp 787.v\u2013795.v"},{"key":"4667_CR8","doi-asserted-by":"crossref","unstructured":"Verhaeghe H, Lecoutre C, Schaus P (2017) Extending compact-table to negative and short tables. In: Thirty-First AAAI Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v31i1.11127"},{"issue":"18","key":"4667_CR9","doi-asserted-by":"publisher","first-page":"3639","DOI":"10.1016\/j.ins.2007.03.030","volume":"177","author":"JR Ullmann","year":"2007","unstructured":"Ullmann JR (2007) Partition search for non-binary constraint satisfaction. Inf Sci 177(18):3639\u20133678","journal-title":"Inf Sci"},{"issue":"4","key":"4667_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10601-011-9107-6","volume":"16","author":"C Lecoutre","year":"2011","unstructured":"Lecoutre C (2011) STR2: optimized simple tabular reduction for table constraints. Constraints 16(4):341\u2013371","journal-title":"Constraints"},{"key":"4667_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.12.002","volume":"220","author":"C Lecoutre","year":"2015","unstructured":"Lecoutre C, Likitvivatanavong C, Yap RHC (2015) STR3: a path-optimal filtering algorithm for table constraints. Artif Intell 220:1\u201327","journal-title":"Artif Intell"},{"key":"4667_CR12","doi-asserted-by":"crossref","unstructured":"Mairy J-B, Deville Y, Lecoutre C (2015) The smart table constraint. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer, Cham, pp 271\u2013287","DOI":"10.1007\/978-3-319-18008-3_19"},{"key":"4667_CR13","unstructured":"Audemard G, Lecoutre C, Maamar M (2020) Segmented tables: an efficient modeling tool for constraint reasoning. In: ECAI 2020. IOS Press, pp 315\u2013322"},{"key":"4667_CR14","doi-asserted-by":"crossref","unstructured":"Katsirelos G, Walsh T (2007) A compression algorithm for large arity extensional constraints. In: International Conference on Principles and Practice of Constraint Programming. Springer, Berlin, pp 379\u2013393","DOI":"10.1007\/978-3-540-74970-7_28"},{"key":"4667_CR15","doi-asserted-by":"crossref","unstructured":"Xia W, Yap RHC (2013) Optimizing STR algorithms with tuple compression. In: International Conference on Principles and Practice of Constraint Programming. Springer, Berlin, pp 724\u2013732","DOI":"10.1007\/978-3-642-40627-0_53"},{"key":"4667_CR16","unstructured":"Jefferson C, Nightingale P (2013) Extending simple tabular reduction with short supports. In: Twenty-Third International Joint Conference on Artificial Intelligence"},{"key":"4667_CR17","doi-asserted-by":"crossref","unstructured":"Gharbi N, Hemery F, Lecoutre C et al (2014) Sliced table constraints: combining compression and tabular reduction. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer, Cham, pp 120\u2013135","DOI":"10.1007\/978-3-319-07046-9_9"},{"key":"4667_CR18","doi-asserted-by":"crossref","unstructured":"Mairy J-B, Deville Y, Lecoutre C (2015) The smart table constraint. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer, Cham, pp 271\u2013287","DOI":"10.1007\/978-3-319-18008-3_19"},{"key":"4667_CR19","doi-asserted-by":"crossref","unstructured":"Verhaeghe H, Lecoutre C, Deville Y et al (2017) Extending compact-table to basic smart tables. In: International Conference on Principles and Practice of Constraint Programming. Springer, Cham, pp 297\u2013307","DOI":"10.1007\/978-3-319-66158-2_19"},{"key":"4667_CR20","doi-asserted-by":"crossref","unstructured":"Jabbour S, Roussel S, Sais L et al (2015) Mining to compress table constraints. In: 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, pp 405\u2013412","DOI":"10.1109\/ICTAI.2015.68"},{"key":"4667_CR21","doi-asserted-by":"crossref","unstructured":"Bennai S, Amroun K, Loudni S (2019) Exploiting data mining techniques for compressing table constraints. In: 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, pp 42\u201349","DOI":"10.1109\/ICTAI.2019.00015"},{"key":"4667_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U Montanari","year":"1974","unstructured":"Montanari U (1974) Networks of constraints: fundamental properties and applications to picture processing. Inf Sci 7:95\u2013132","journal-title":"Inf Sci"},{"issue":"12\u201313","key":"4667_CR23","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T Guns","year":"2011","unstructured":"Guns T, Nijssen S, De Raedt L (2011) Itemset mining: a constraint programming perspective. Artif Intell 175(12\u201313):1951\u20131983","journal-title":"Artif Intell"},{"issue":"2","key":"4667_CR24","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 (2000) Mining frequent patterns without candidate generation. ACM Sigmod Rec 29(2):1\u201312","journal-title":"ACM Sigmod Rec"},{"issue":"2","key":"4667_CR25","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10515-015-0189-z","volume":"24","author":"M Maamar","year":"2017","unstructured":"Maamar M, Lazaar N, Loudni S et al (2017) Fault localization using itemset mining under constraints. Autom Softw Eng 24(2):341\u2013368","journal-title":"Autom Softw Eng"},{"key":"4667_CR26","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R et al (1999) Discovering frequent closed itemsets for association rules. In: International Conference on Database Theory. Springer, Berlin, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"4667_CR27","doi-asserted-by":"crossref","unstructured":"Boulicaut J-F, Artur B,Christophe R (2000) Approximation of frequency queries by means of free-sets. In: European Conference on Principles of Data Mining and Knowledge Discovery. Springer, Berlin","DOI":"10.1007\/3-540-45372-5_8"},{"key":"4667_CR28","doi-asserted-by":"crossref","unstructured":"Bayardo Jr. RJ (1998) Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data","DOI":"10.1145\/276304.276313"},{"issue":"3","key":"4667_CR29","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Min Knowl Discov 1(3):241\u2013258","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"4667_CR30","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier N, Bastide Y, Taouil R et al (1999) Efficient mining of association rules using closed itemset lattices. Inf Syst 24(1):25\u201346","journal-title":"Inf Syst"},{"key":"4667_CR31","doi-asserted-by":"crossref","unstructured":"Ke Y, Cheng J, Yu JX (2009) Top-k correlative graph mining. In: Proceedings of the 2009 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, pp 1038\u20131049","DOI":"10.1137\/1.9781611972795.89"},{"issue":"5","key":"4667_CR32","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J Wang","year":"2005","unstructured":"Wang J, Han J, Lu Y et al (2005) TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans Knowl Data Eng 17(5):652\u2013663","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4667_CR33","doi-asserted-by":"crossref","unstructured":"Uno T, Kiyomi M, Arimura H et al (2004) LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: FIMI","DOI":"10.1145\/1133905.1133916"},{"key":"4667_CR34","doi-asserted-by":"crossref","unstructured":"Perez G, R\u00e9gin J-C (2014) Improving GAC-4 for table and MDD constraints. In: International Conference on Principles and Practice of Constraint Programming. Springer, Cham, pp 606\u2013621","DOI":"10.1007\/978-3-319-10428-7_44"},{"key":"4667_CR35","doi-asserted-by":"crossref","unstructured":"Verhaeghe H, Lecoutre C, Schaus P (2018) Compact-MDD: efficiently filtering (s)MDD constraints with reversible sparse bitsets. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence","DOI":"10.24963\/ijcai.2018\/192"},{"key":"4667_CR36","doi-asserted-by":"crossref","unstructured":"Verhaeghe H, Lecoutre C, Deville Y, Schaus P (2017) Extending compact-table to basic smart tables. In: Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming","DOI":"10.1007\/978-3-319-66158-2_19"},{"key":"4667_CR37","doi-asserted-by":"crossref","unstructured":"Verhaeghe H, Lecoutre C, Schaus P (2017) Extending compact-table to negative and short table. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence, pp 3951\u20133957","DOI":"10.1609\/aaai.v31i1.11127"},{"key":"4667_CR38","doi-asserted-by":"crossref","unstructured":"Wang R, Yap RH (2019) Arc consistency revisited. In: Proceedings of the 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer, pp 599\u2013615","DOI":"10.1007\/978-3-030-19212-9_40"},{"key":"4667_CR39","doi-asserted-by":"publisher","unstructured":"Geerts F, Goethals B, Mielik\u00e4inen T (2004) Tiling databases. In: Suzuki E, Arikawa S (eds) Discovery Science. DS 2004. Lecture Notes in Computer Science, vol 3245. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-30214-8_22","DOI":"10.1007\/978-3-540-30214-8_22"},{"issue":"2","key":"4667_CR40","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/BF01182770","volume":"11","author":"R Fleischer","year":"1994","unstructured":"Fleischer R (1994) A tight lower bound for the worst case of bottom\u2013up-heapsort. Algorithmica 11(2):104\u2013115","journal-title":"Algorithmica"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04667-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04667-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04667-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T14:37:51Z","timestamp":1672843071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04667-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,14]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["4667"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04667-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,7,14]]},"assertion":[{"value":"18 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}