{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T01:00:38Z","timestamp":1768784438765,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T00:00:00Z","timestamp":1472169600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10601-016-9252-z","type":"journal-article","created":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T01:31:03Z","timestamp":1472175063000},"page":"265-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Prefix-projection global constraint and top-k approach for sequential pattern mining"],"prefix":"10.1007","volume":"22","author":[{"given":"Amina","family":"Kemmar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4736-2976","authenticated-orcid":false,"given":"Yahia","family":"Lebbah","sequence":"additional","affiliation":[]},{"given":"Samir","family":"Loudni","sequence":"additional","affiliation":[]},{"given":"Patrice","family":"Boizumault","sequence":"additional","affiliation":[]},{"given":"Thierry","family":"Charnois","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,26]]},"reference":[{"key":"9252_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. In Yu, P.S., & Chen, A.L.P. (Eds.) Proceedings of the Eleventh International Conference on Data Engineering, March 6-10, 1995, Taipei, Taiwan. pp. 3\u201314. IEEE Computer Society. doi: 10.1109\/ICDE.1995.380415 .","DOI":"10.1109\/ICDE.1995.380415"},{"key":"9252_CR2","doi-asserted-by":"publisher","unstructured":"Ayres, J., Flannick, J., Gehrke, J., & Yiu, T. (2002). Sequential pattern mining using a bitmap representation. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-26, 2002, Edmonton, Alberta, Canada. pp. 429\u2013435. ACM. doi: 10.1145\/775047.775109 .","DOI":"10.1145\/775047.775109"},{"key":"9252_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e9chet, N., Cellier, P., Charnois, T., & Cr\u00e9milleux, B. (2012). Sequential pattern mining to discover relations between genes and rare diseases. In CBMS.","DOI":"10.1109\/CBMS.2012.6266367"},{"issue":"12","key":"9252_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling, 20(12), 97\u2013123.","journal-title":"Journal of Mathematical and Computer Modelling"},{"issue":"9","key":"9252_CR5","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1109\/TKDE.2004.44","volume":"16","author":"Y Cheung","year":"2004","unstructured":"Cheung, Y., & Fu, A. W. (2004). Mining frequent itemsets without support threshold: With and without item constraints. IEEE Transactions on Knowledge and Data Engineering, 16(9), 1052\u2013 1069.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9252_CR6","doi-asserted-by":"publisher","unstructured":"Coquery, E., Jabbour, S., Sa\u00efs, L., & Salhi, Y. (2012). A sat-based approach for discovering frequent, closed and maximal patterns in a sequence. In Raedt, L.D., Bessi\u00e8re, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., & Lucas, P.J.F. (Eds.) ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31, 2012. Frontiers in Artificial Intelligence and Applications, vol. 242, pp. 258\u2013263. IOS Press. doi: 10.3233\/978-1-61499-098-7-258 .","DOI":"10.3233\/978-1-61499-098-7-258"},{"key":"9252_CR7","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Wu, C., & Tseng, V. (2014). SPMF: A java Open-Source pattern mining library. J. of Machine Learning Resea., 15, 3389\u20133393.","journal-title":"J. of Machine Learning Resea."},{"key":"9252_CR8","doi-asserted-by":"publisher","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Mwamikazi, E., & Thomas, R. (2013). TKS: efficient mining of top-k sequential patterns. In Motoda, H., Wu, Z., Cao, L., Za\u00efane, O.R., Yao, M., & Wang, W. (Eds.) Advanced Data Mining and Applications, 9th International Conference, ADMA 2013, Hangzhou, China, December 14-16, 2013, Proceedings, Part I. Lecture Notes in Computer Science, vol. 8346, pp. 109\u2013120. Springer. doi: 10.1007\/978-3-642-53914-5_10 .","DOI":"10.1007\/978-3-642-53914-5_10"},{"issue":"3","key":"9252_CR9","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TKDE.2002.1000341","volume":"14","author":"MN Garofalakis","year":"2002","unstructured":"Garofalakis, M. N., Rastogi, R., & Shim, K. (2002). Mining sequential patterns with regular expression constraints. IEEE Trans. Knowl. Data Eng., 14(3), 530\u2013552. doi: 10.1109\/TKDE.2002.1000341 .","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12-13","key":"9252_CR10","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., & Raedt, L. D. (2011). Itemset mining: A constraint programming perspective. Artif. Intell., 175(12-13), 1951\u20131983. doi: 10.1016\/j.artint.2011.05.002 .","journal-title":"Artif. Intell."},{"key":"9252_CR11","unstructured":"Han, J., Wang, J., Lu, Y., & Tzvetkov, P. (2002). Mining top-k frequent closed patterns without minimum support. In Proceedings of the 2002 IEEE international conference on data mining (ICDM 2002), 9-12 december 2002, maebashi city, Japan (pp. 211\u2013218)."},{"key":"9252_CR12","doi-asserted-by":"publisher","unstructured":"Kemmar, A., Loudni, S., Lebbah, Y., Boizumault, P., & Charnois, T. (2015). PREFIX-PROJECTION global constraint for sequential pattern mining. In Pesant, G. (Ed.) Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings. Lecture Notes in Computer Science, vol. 9255, pp. 226\u2013243. Springer. doi: 10.1007\/978-3-319-23219-5_17 .","DOI":"10.1007\/978-3-319-23219-5_17"},{"key":"9252_CR13","doi-asserted-by":"crossref","unstructured":"Kemmar, A., Loudni, S., Lebbah, Y., Boizumault, P., & Charnois, T. (2016). A global constraint for mining sequential patterns with GAP constraint. In Integration of AI and OR techniques in constraint programming - 13th international conference, CPAIOR 2016, banff, AB, Canada, May 29 - June 1, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9676, pP. 198\u2013215. Springer.","DOI":"10.1007\/978-3-319-33954-2_15"},{"key":"9252_CR14","doi-asserted-by":"publisher","unstructured":"Kemmar, A., Ugarte, W., Loudni, S., Charnois, T., Lebbah, Y., Boizumault, P., & Cr\u00e9milleux, B. (2014). Mining relevant sequence patterns with cp-based framework. In 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014. pp. 552\u2013559. IEEE Computer Society. doi: 10.1109\/ICTAI.2014.89 .","DOI":"10.1109\/ICTAI.2014.89"},{"issue":"1","key":"9252_CR15","first-page":"2:1","volume":"6","author":"C Li","year":"2012","unstructured":"Li, C., Yang, Q., Wang, J., & Li, M. (2012). Efficient mining of gap-constrained subsequences and its various applications. ACM Trans. Knowl. Discov. Data, 6(1), 2:1\u20132:39.","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"9252_CR16","unstructured":"M\u00e9tivier, J.P., Loudni, S., & Charnois, T. (2013). A constraint programming approach for mining sequential patterns in a sequence database. In ECML\/PKDD Workshop on languages for data mining and machine learning."},{"key":"9252_CR17","doi-asserted-by":"publisher","unstructured":"N\u00e9grevergne, B., Dries, A., Guns, T., & Nijssen, S. (2013). Dominance programming for itemset mining. In Xiong, H., Karypis, G., Thuraisingham, B. M., Cook, D. J., & Wu, X. (Eds.) 2013 IEEE 13th International Conference on Data Mining, Dallas, TX, USA, December 7-10, 2013. pp. 557\u2013566. IEEE Computer Society. doi: 10.1109\/ICDM.2013.92 .","DOI":"10.1109\/ICDM.2013.92"},{"key":"9252_CR18","doi-asserted-by":"publisher","unstructured":"N\u00e9grevergne, B., & Guns, T. (2015). Constraint-based seque nce mining using constraint programming. In Michel, L. (Ed.) Integration of AI and OR Techniques in Constraint Programming - 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings. Lecture Notes in Computer Science, vol. 9075, pp. 288\u2013305. Springer. doi: 10.1007\/978-3-319-18008-3_{2}0 .","DOI":"10.1007\/978-3-319-18008-3_20"},{"key":"9252_CR19","first-page":"377","volume":"10","author":"PK Novak","year":"2009","unstructured":"Novak, P. K., Lavrac, N., & Webb, G. I. (2009). Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining. Journal of Machine Learning Research, 10, 377\u2013403.","journal-title":"Journal of Machine Learning Research"},{"key":"9252_CR20","doi-asserted-by":"publisher","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M. (2001). Prefixspan: Mining sequential patterns by prefix-projected growth. In Georgakopoulos, D., & Buchmann, A. (Eds.) Proceedings of the 17th International Conference on Data Engineering, April 2-6, 2001, Heidelberg, Germany. pp. 215\u2013224. IEEE Computer Society. doi: 10.1109\/ICDE.2001.914830 .","DOI":"10.1109\/ICDE.2001.914830"},{"key":"9252_CR21","doi-asserted-by":"publisher","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., & Zhu, H. (2000). Mining access patterns efficiently from web logs. In Terano, T., Liu, H., & Chen, A. L. P. (Eds.) Knowledge Discovery and Data Mining, Current Issues and New Applications, 4th Pacific-Asia Conference, PADKK 2000, Kyoto, Japan, April 18-20, 2000, Proceedings. Lecture Notes in Computer Science, vol. 1805, pP. 396\u2013407. Springer. doi: 10.1007\/3-540-45571-X_47 .","DOI":"10.1007\/3-540-45571-X_47"},{"key":"9252_CR22","doi-asserted-by":"publisher","unstructured":"Pei, J., Han, J., & Wang, W. (2002). Mining sequential patterns with constraints in large databases. In Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, November 4-9, 2002. pp. 18\u201325. ACM. doi: 10.1145\/584792.584799 .","DOI":"10.1145\/584792.584799"},{"key":"9252_CR23","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Wallace, M. (Ed.) CP\u201904. LNCS, vol. 2239, pp. 482\u2013495. Springer.","DOI":"10.1007\/978-3-540-30201-8_36"},{"issue":"1","key":"9252_CR24","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s10489-013-0506-9","volume":"41","author":"G Pyun","year":"2014","unstructured":"Pyun, G., & Yun, U. (2014). Mining top-k frequent patterns with combination reducing techniques. Applied Intelligence, 41(1), 76\u201398.","journal-title":"Applied Intelligence"},{"key":"9252_CR25","doi-asserted-by":"publisher","unstructured":"Raedt, L. D., & Zimmermann, A. (2007). Constraint-based pattern set mining. In Proceedings of the Seventh SIAM International Conference on Data Mining, April 26-28, 2007, Minneapolis, Minnesota, USA. pp. 237\u2013248. SIAM. doi: 10.1137\/1.9781611972771.22 .","DOI":"10.1137\/1.9781611972771.22"},{"key":"9252_CR26","doi-asserted-by":"publisher","unstructured":"Rojas, W. U., Boizumault, P., Loudni, S., Cr\u00e9milleux, B., & Lepailleur, A. (2014). Mining (soft-) skypatterns using dynamic CSP. In Simonis, H. (Ed.) Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8451, pp. 71\u201387. Springer. doi: 10.1007\/978-3-319-07046-9_6 .","DOI":"10.1007\/978-3-319-07046-9_6"},{"key":"9252_CR27","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (Eds.) (2006). Handbook of Constraint Programming. New York: Elsevier Science Inc."},{"key":"9252_CR28","doi-asserted-by":"publisher","unstructured":"Soulet, A., Ra\u00efssi, C., Plantevit, M., & Cr\u00e9milleux, B. (2011). Mining dominant patterns in the sky. In Cook, D. J., Pei, J., Wang, W., Za\u00efane, O. R., & Wu, X. (Eds.) 11th IEEE International Conference on Data Mining, ICDM 2011, Vancouver, BC, Canada, December 11-14, 2011. pp. 655\u2013664. IEEE Computer Society. doi: 10.1109\/ICDM.2011.100 .","DOI":"10.1109\/ICDM.2011.100"},{"key":"9252_CR29","doi-asserted-by":"publisher","unstructured":"Srikant, R., & Agrawal, R. (1996). Mining sequential patterns: Generalizations and performance improvements. In Apers, P. M. G., Bouzeghoub, M., & Gardarin, G. (Eds.) Advances in Database Technology - EDBT\u201996, 5th International Conference on Extending Database Technology, Avignon, France, March 25-29, 1996, Proceedings. Lecture Notes in Computer Science. doi: 10.1007\/BFb0014140 , (Vol. 1057 pp. 3\u201317): Springer.","DOI":"10.1007\/BFb0014140"},{"key":"9252_CR30","doi-asserted-by":"publisher","unstructured":"Trasarti, R., Bonchi, F., & Goethals, B. (2008). Sequence mining automata: A new technique for mining frequent sequences under regular expressions. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy. pp. 1061\u20131066. IEEE Computer Society. doi: 10.1109\/ICDM.2008.111 .","DOI":"10.1109\/ICDM.2008.111"},{"key":"9252_CR31","doi-asserted-by":"publisher","unstructured":"Tzvetkov, P., Yan, X., & Han, J. (2003). In TSP: mining top-k closed sequential patterns. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 19-22 December 2003, Melbourne, Florida, USA. pp. 347\u2013354. IEEE Computer Society. doi: 10.1109\/ICDM.2003.1250939 .","DOI":"10.1109\/ICDM.2003.1250939"},{"key":"9252_CR32","doi-asserted-by":"publisher","unstructured":"Wang, J., & Han, J. (2004). BIDE: efficient mining of frequent closed sequences. In \u00d6zsoyoglu, Z. M., & Zdonik, S. B. (Eds.) Proceedings of the 20th International Conference on Data Engineering, ICDE 2004, 30 March - 2 April 2004, Boston, MA, USA. pp. 79\u201390. IEEE Computer Society. doi: 10.1109\/ICDE.2004.1319986 .","DOI":"10.1109\/ICDE.2004.1319986"},{"issue":"5","key":"9252_CR33","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., & Tzvetkov, P. (2005). TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans. Knowl. Data Eng., 17(5), 652\u2013664. doi: 10.1109\/TKDE.2005.81 .","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9252_CR34","doi-asserted-by":"publisher","unstructured":"Yan, X., Han, J., & Afshar, R. (2003). Clospan: Mining closed sequential patterns in large databases. In Barbar\u00e1, D., & Kamath, C. (Eds.) Proceedings of the Third SIAM International Conference on Data Mining, San Francisco, CA, USA, May 1-3, 2003. pp. 166\u2013177. SIAM. doi: 10.1137\/1.9781611972733.15 .","DOI":"10.1137\/1.9781611972733.15"},{"key":"9252_CR35","doi-asserted-by":"publisher","unstructured":"Zaki, M. J. (2000). Sequence mining in categorical domains: Incorporating constraints. In Proceedings of the 2000 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, November 6-11, 2000. pp. 422\u2013429. ACM. doi: 10.1145\/354756.354849 .","DOI":"10.1145\/354756.354849"},{"key":"9252_CR36","doi-asserted-by":"publisher","unstructured":"Zaki, M. J. (2000). Sequence mining in categorical domains: Incorporating constraints. In Proceedings of the 2000 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, November 6-11, 2000. pp. 422\u2013429. ACM. doi: 10.1145\/354756.354849 .","DOI":"10.1145\/354756.354849"},{"issue":"1\/2","key":"9252_CR37","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:100765250231","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki, M. J. (2001). SPADE: an efficient algorithm for mining frequent sequences. Machine Learning, 42(1\/2), 31\u201360. doi: 10.1023\/A:100765250231 .","journal-title":"Machine Learning"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9252-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9252-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9252-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9252-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T17:10:52Z","timestamp":1497373852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9252-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,26]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9252"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9252-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,26]]}}}