{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T14:10:04Z","timestamp":1749651004443,"version":"3.41.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T00:00:00Z","timestamp":1476489600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007586","name":"Aix-Marseille Universit\u00e9 (FR)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10472-016-9528-4","type":"journal-article","created":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T06:15:46Z","timestamp":1476512146000},"page":"91-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local and global symmetry breaking in itemset mining"],"prefix":"10.1007","volume":"80","author":[{"given":"Bela\u00efd","family":"Benhamou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,15]]},"reference":[{"key":"9528_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 n Management of Data, SIGMOD \u201993, pp. 207\u2013216. ACM, New York (1993)","DOI":"10.1145\/170035.170072"},{"key":"9528_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB \u201994, pp. 487\u2013499. Morgan Kaufmann Publishers Inc., San Francisco (1994)"},{"key":"9528_CR3","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult SAT instances in the presence of symmetry. In: Proceedings of the 39th Design Automation Conference (DAC 2002), pp. 731\u2013736. ACM Press (2002)","DOI":"10.1145\/514100.514102"},{"key":"9528_CR4","doi-asserted-by":"publisher","unstructured":"Aloul, F.A., Markov, I.L., Sakallah, K.A.: Shatter: efficient symmetry-breaking for boolean satisfiability. In: DAC, pp. 836\u2013839. ACM (2003)","DOI":"10.1145\/775832.776042"},{"key":"9528_CR5","doi-asserted-by":"publisher","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallak, K.A.: Solving difficult sat instances in the presence of symmetry. In: IEEE Transaction on CAD, vol. 22(9), pp. 1117\u20131137 (2003)","DOI":"10.1109\/TCAD.2003.816218"},{"issue":"9","key":"9528_CR6","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1109\/TCAD.2003.816218","volume":"22","author":"FA Aloul","year":"2003","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult instances of boolean satisfiability in the presence of symmetry. IEEE Trans. CAD Integr. Circ. Syst. 22(9), 1117\u20131137 (2003)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"9528_CR7","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallak, K.A.: Symmetry breaking for pseudo-boolean satisfiabilty. In: ASPDAC\u201904, pp. 884\u2013887 (2004)","DOI":"10.1109\/ASPDAC.2004.1337720"},{"key":"9528_CR8","doi-asserted-by":"publisher","unstructured":"Audemard, G., Benhamou, B., Siegel, P.: Aval: an enumerative method for sat. In: Proceedings of the International Conference on Compitational Logic, CL\u20192000, pp. 373\u2013383. Springer, London (2000)","DOI":"10.1007\/3-540-44957-4_25"},{"key":"9528_CR9","unstructured":"Benhamou, B.: Study of symmetry in constraint satisfaction problems. In: PPCP\u201994, pp. 246\u2013254 (1994)"},{"key":"9528_CR10","doi-asserted-by":"publisher","unstructured":"Benhamou, B., Sa\u00efdi, M.R.: Local symmetry breaking during search in csps. In: Springer (ed.) The 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), LNCS, vol. 4741, pp. 195\u2013209. Providence (2007)","DOI":"10.1007\/978-3-540-74970-7_16"},{"key":"9528_CR11","doi-asserted-by":"publisher","unstructured":"Benhamou, B., Sais, L.: Theoretical study of symmetries in propositional calculus and application. In: CADE\u201911, pp. 281\u2013294 (1992)","DOI":"10.1007\/3-540-55602-8_172"},{"issue":"1","key":"9528_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00881844","volume":"12","author":"B Benhamou","year":"1994","unstructured":"Benhamou, B., Sais, L.: Tractability through symmetries in propositional calculus. J. Autom. Reasoning 12(1), 89\u2013102 (1994)","journal-title":"J. Autom. Reasoning"},{"key":"9528_CR13","doi-asserted-by":"publisher","unstructured":"Benhamou, B., Jabbour, S., Sais, L., Salhi, Y.: Symmetry breaking in itemset mining. In: Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, pp. 86\u201396 (2014), doi: 10.5220\/0005078200860096","DOI":"10.5220\/0005078200860096"},{"key":"9528_CR14","unstructured":"Benhamou, B., Nabhani, T., Ostrowski, R., Sa\u00efdi, M.R.: Dynamic symmetry breaking in the satisfiability problem. In: Proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-16. Dakar (2010)"},{"key":"9528_CR15","doi-asserted-by":"publisher","unstructured":"Besson, J., Boulicaut, J.F., Guns, T., Nijssen, S.: Generalizing itemset mining in a constraint programming setting. In: Inductive Databases and Constraint-Based Data Mining, pp. 107\u2013126. Springer (2010)","DOI":"10.1007\/978-1-4419-7738-0_5"},{"issue":"2","key":"9528_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.datak.2006.02.006","volume":"60","author":"F Bonchi","year":"2007","unstructured":"Bonchi, F., Lucchese, C.: Extending the state-of-the-art of constraint-based pattern discovery. Data Knowl. Eng. 60(2), 377\u2013399 (2007)","journal-title":"Data Knowl. Eng."},{"issue":"3","key":"9528_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C Bucila","year":"2003","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.: Dualminer: a dual-pruning algorithm for itemsets with constraints. Data Min. Knowl. Disc. 7(3), 241\u2013272 (2003)","journal-title":"Data Min. Knowl. Disc."},{"key":"9528_CR18","doi-asserted-by":"publisher","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: Mafia: a maximal frequent itemset algorithm for transactional databases. In: ICDE, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"9528_CR19","unstructured":"Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-breaking predicates for search problems. In: Knowledge Representation (KR), pp. 148\u2013159. Morgan Kaufmann (1996)"},{"key":"9528_CR20","unstructured":"Desrosiers, C., Galinier, P., Hansen, P., Hertz, A.: Improving frequent subgraph mining in the presence of symmetry. In: MLG (2007)"},{"key":"9528_CR21","unstructured":"Freuder, E.: Eliminating interchangeable values in constraints satisfaction problems. In: AAAI-91, pp. 227\u2013233 (1991)"},{"key":"9528_CR22","doi-asserted-by":"publisher","unstructured":"G\u00e9ly, A., Medina, R., Nourine, L., Renaud, Y.: Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases. In: Ganter, B., Godin, R. (eds.) ICFCA, Lecture Notes in Computer Science, pp. 235\u2013248. Springer (2005)","DOI":"10.1007\/978-3-540-32262-7_16"},{"issue":"10","key":"9528_CR23","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using fp-trees. IEEE Trans. Knowl. Data Eng. 17(10), 1347\u20131362 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12\u201313","key":"9528_CR24","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.: Itemset mining: a constraint programming perspective. Artif. Intell. 175(12\u201313), 1951\u20131983 (2011)","journal-title":"Artif. Intell."},{"key":"9528_CR25","unstructured":"Guns, T., Dries, A., Tack, G., Nijssen, S., Raedt, L.D.: Miningzinc: a modeling language for constraint-based mining. In: International Joint Conference on Artificial Intelligence, pp. 1365-1372, Beijing (2013)"},{"key":"9528_CR26","doi-asserted-by":"publisher","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201900, pp. 1\u201312. ACM, New York (2000)","DOI":"10.1145\/342009.335372"},{"key":"9528_CR27","unstructured":"Henriques, R., Lynce, I., Manquinho, V.M.: On when and how to use sat to mine frequent itemsets. CoRR arXiv: 1207.6253 (2012)"},{"key":"9528_CR28","doi-asserted-by":"crossref","unstructured":"Jabbour, S., Sais, L., Salhi, Y., Tabia, K.: Symmetries in itemset mining. In: 20th European Conference on Artificial Intelligence (ECAI \u201912), pp. 432\u2013437. IOS Press (2012)","DOI":"10.3233\/978-1-61499-098-7-432"},{"key":"9528_CR29","doi-asserted-by":"publisher","unstructured":"Jabbour, S., Khiari, M., Sais, L., Salhi, Y., Tabia, K.: Symmetry-based pruning in itemset mining. In: 25th International Conference on Tools with Artificial Intelligence (ICTAI\u201913). IEEE Computer Society, Washington DC (2013)","DOI":"10.1109\/ICTAI.2013.78"},{"key":"9528_CR30","doi-asserted-by":"publisher","unstructured":"Jabbour, S., Sais, L., Salhi, Y.: Boolean satisfiability for sequence mining. In: CIKM, pp. 649\u2013658 (2013)","DOI":"10.1145\/2505515.2505577"},{"key":"9528_CR31","doi-asserted-by":"publisher","unstructured":"Jabbour, S., Sais, L., Salhi, Y.: Top-k frequent closed itemset mining using top-k sat problem. In: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML\/PKDD\u201913), vol. 146, pp. 131\u2013140. Springer (2013)","DOI":"10.1007\/978-3-642-40994-3_26"},{"key":"9528_CR32","doi-asserted-by":"publisher","unstructured":"Khiari, M., Boizumault, P., Cr\u00e9milleux, B.: Constraint programming for mining n-ary patterns. In: Cohen, D. (ed.) CP, Lecture Notes in Computer Science, vol. 6308, pp. 552\u2013567. Springer (2010)","DOI":"10.1007\/978-3-642-15396-9_44"},{"issue":"3","key":"9528_CR33","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF00265682","volume":"22","author":"B Krishnamurthy","year":"1985","unstructured":"Krishnamurthy, B.: Short proofs for tricky formulas. Acta Inf. 22(3), 253\u2013275 (1985)","journal-title":"Acta Inf."},{"key":"9528_CR34","doi-asserted-by":"publisher","unstructured":"M\u00e9tivier, J. P., Boizumault, P., Cr\u00e9milleux, B., Khiari, M., Loudni, S.: A constraint language for declarative pattern discovery. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC \u201912, pp. 119\u2013125. ACM, New York (2012)","DOI":"10.1145\/2245276.2245302"},{"key":"9528_CR35","doi-asserted-by":"publisher","unstructured":"Minato, S.I.: Symmetric item set mining based on zero-suppressed Bdds. In: Todorovski, L., Lavrac, N., Jantke, K.P. (eds.) Discovery Science, Lecture Notes in Computer Science, vol. 4265, pp. 321\u2013326. Springer (2006)","DOI":"10.1007\/11893318_35"},{"key":"9528_CR36","unstructured":"Minato, S.I., Uno, T., Arimura, H.: Fast generation of very large-scale frequent itemsets using a compact graph-based representation (2007)"},{"key":"9528_CR37","unstructured":"Murtagh, F., Contreras, P.: Hierarchical clustering for finding symmetries and other patterns in massive, high dimensional datasets (2010). CoRR arXiv: 1005.2638"},{"issue":"3","key":"9528_CR38","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:DAMI.0000023674.74932.4c","volume":"8","author":"J Pei","year":"2004","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Pushing convertible constraints in frequent itemset mining. Data Min. Knowl. Disc. 8(3), 227\u2013252 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"9528_CR39","doi-asserted-by":"publisher","unstructured":"Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Kamorowski, J., Ras, Z.W. (eds.) Proceedings of ISMIS\u201993, LNAI 689, pp. 350\u2013361 (1993)","DOI":"10.1007\/3-540-56804-2_33"},{"key":"9528_CR40","doi-asserted-by":"crossref","unstructured":"Raedt, L.D., Guns, T., Nijssen, S.: Constraintprogrammingfor itemsetmining. In: KDD, pp. 204\u2013212 (2008)","DOI":"10.1145\/1401890.1401919"},{"key":"9528_CR41","unstructured":"Raedt, L.D., Guns, T., Nijssen, S.: Constraint programming for data mining and machine learning. In: AAAI (2010)"},{"key":"9528_CR42","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.3923\/itj.2010.1278.1293","volume":"9","author":"A Tiwari","year":"2010","unstructured":"Tiwari, A., Gupta, R., Agrawal, D.: A survey on frequent pattern mining: current status and challenging issues. Inform. Technol. J. 9, 1278\u20131293 (2010)","journal-title":"Inform. Technol. J."},{"key":"9528_CR43","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Structures in the Constructive Mathematics and Mathematical Logic, pp. 115\u2013125. H.A.O Shsenko (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"9528_CR44","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: Lcm: an efficient algorithm for enumerating frequent closed item sets. In: Proceedings of Workshop on Frequent Itemset Mining Implementations (FIMI 03) (2003)"},{"key":"9528_CR45","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: Lcm Ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: FIMI (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"9528_CR46","doi-asserted-by":"publisher","unstructured":"Vanetik, N.: Mining graphs with constraints on symmetry and diameter. In: Shen, H.T., Pei, J., Zsu, M.T., Zou, L., Lu, J., Ling, T.W., Yu, G., Zhuang, Y., Shao, J. (eds.) WAIM Workshops, Lecture Notes in Computer Science, vol. 6185, pp. 1\u201312. Springer (2010)","DOI":"10.1007\/978-3-642-16720-1_1"},{"issue":"4","key":"9528_CR47","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. 17(4), 462\u2013478 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9528-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-016-9528-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9528-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T13:31:09Z","timestamp":1749648669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-016-9528-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,15]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9528"],"URL":"https:\/\/doi.org\/10.1007\/s10472-016-9528-4","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2016,10,15]]}}}