{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:09:45Z","timestamp":1774620585168,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T00:00:00Z","timestamp":1496793600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003134","name":"Fonds pour la Formation \u00e0 la Recherche dans l\u2019Industrie et dans l\u2019Agriculture","doi-asserted-by":"publisher","award":["FC 21467"],"award-info":[{"award-number":["FC 21467"]}],"id":[{"id":"10.13039\/501100003134","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10601-017-9272-3","type":"journal-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T00:56:05Z","timestamp":1496796965000},"page":"548-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Mining Time-constrained Sequential Patterns with Constraint Programming"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7213-146X","authenticated-orcid":false,"given":"John O. R.","family":"Aoga","sequence":"first","affiliation":[]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,7]]},"reference":[{"key":"9272_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., & Han, J. (2014). Frequent pattern mining. Springer.","DOI":"10.1007\/978-3-319-07821-2"},{"key":"9272_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., & Srikant, R. (1995). Mining sequential patterns, Proceedings of the eleventh international conference on data engineering, 1995. (pp. 3\u201314).","DOI":"10.1109\/ICDE.1995.380415"},{"key":"9272_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-45065-3_21","volume-title":"Machine learning and data mining in pattern recognition: 3rd international conference, MLDM 2003 leipzig, Germany, July 5\u20137, 2003 Proceedings","author":"C Antunes","year":"2003","unstructured":"Antunes, C., & Oliveira, A.L. (2003). Generalization of pattern-growth methods for sequential pattern mining with gap constraints. In Perner, P., & Rosenfeld, A. (Eds.), Machine learning and data mining in pattern recognition: 3rd international conference, MLDM 2003 leipzig, Germany, July 5\u20137, 2003 Proceedings (pp. 239\u2013251). Berlin: Springer."},{"key":"9272_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-319-46227-1_20","volume-title":"Machine learning and knowledge discovery in databases: European conference, ECML PKDD 2016, riva del garda, Italy, September 19-23, 2016, Proceedings, Part II","author":"JOR Aoga","year":"2016","unstructured":"Aoga, J.O.R., Guns, T., & Schaus, P. (2016). An efficient algorithm for mining frequent sequence with constraint programming. In Frasconi, P., Landwehr, N., Manco, G., & Vreeken, J. (Eds.), Machine learning and knowledge discovery in databases: European conference, ECML PKDD 2016, riva del garda, Italy, September 19-23, 2016, Proceedings, Part II (pp. 315\u2013330). Cham: Springer International Publishing."},{"key":"9272_CR5","doi-asserted-by":"crossref","unstructured":"Aoga, J.O.R., Guns, T., & Schaus, P. (2017). Mining time-constrained sequential patterns with constraint programming. In Salvagnin, D., & Lombardi, M. (Eds.), Integration of AI and OR techniques in constraint programming - 13th international conference, CPAIOR 2017, padova, Italy, June 5 - 8, 2017, Proceedings, Lecture Notes in Computer Science. Springer.","DOI":"10.1007\/s10601-017-9272-3"},{"key":"9272_CR6","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., & Yiu, T. (2002). Sequential pattern mining using a bitmap representation, Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, July 23-26, 2002, edmonton, alberta, Canada (pp. 429\u2013435).","DOI":"10.1145\/775047.775109"},{"key":"9272_CR7","doi-asserted-by":"crossref","unstructured":"Batal, I., Fradkin, D., Harrison, J., Moerchen, F., & Hauskrecht, M. (2012). Mining recent temporal patterns for event detection in multivariate time series data. In Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 280\u2013288).","DOI":"10.1145\/2339530.2339578"},{"issue":"12","key":"9272_CR8","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. Mathematical and computer Modelling, 20(12), 97\u2013123.","journal-title":"Mathematical and computer Modelling"},{"key":"9272_CR9","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\u0117re, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., & Lucas, P.J.F. (Eds.), ECAI 2012 - 20th European Conference on Artificial Intelligence. Montpellier, France, August 27-31, 2012, Frontiers in Artificial Intelligence and Applications, vol. 242, pp. 258\u2013263. IOS Press."},{"issue":"1","key":"9272_CR10","first-page":"1072,292","volume":"2","author":"NAK Desai","year":"2015","unstructured":"Desai, N.A.K., & Ganatra, A. (2015). Efficient constraint-based sequential pattern mining (spm) algorithm to understand customers buying behaviour from time stamp-based sequence dataset. Cogent Engineering, 2(1), 1072,292.","journal-title":"Cogent Engineering"},{"key":"9272_CR11","unstructured":"Fournier-Viger, P., Wu, C.W., & Tseng, V.S. (2013). Mining maximal sequential patterns without candidate maintenance, Advanced data mining and applications (pp. 169\u2013180): Springer."},{"issue":"2","key":"9272_CR12","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TKDE.2011.204","volume":"25","author":"T Guns","year":"2013","unstructured":"Guns, T., Nijssen, S., & De Raedt, L. (2013). k-pattern set mining under constraints. IEEE Transactions on Knowledge and Data Engineering, 25(2), 402\u2013418.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"9272_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., & Mao, R. (2004). Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data mining and knowledge discovery, 8(1), 53\u201387.","journal-title":"Data mining and knowledge discovery"},{"key":"9272_CR14","unstructured":"He, J., Flener, P., Pearson, J., & Zhang, W.M. (2013). Solving string constraints: The case for constraint programming, International conference on principles and practice of constraint programming (pp. 381\u2013397): Springer."},{"key":"9272_CR15","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-319-08407-7_7","volume-title":"New frontiers in mining complex patterns: Second international workshop, NFMCP 2013, held in conjunction with ECML-PKDD 2013, prague, Czech Republic, September 27, 2013, Revised Selected Papers","author":"R Henriques","year":"2014","unstructured":"Henriques, R., Antunes, C., & Madeira, S.C. (2014). Methods for the efficient discovery of large item-indexable sequential patterns. In Appice, A., Ceci, M., Loglisci, C., Manco, G., Masciari, E., & Ras, Z.W. (Eds.), New frontiers in mining complex patterns: Second international workshop, NFMCP 2013, held in conjunction with ECML-PKDD 2013, prague, Czech Republic, September 27, 2013, Revised Selected Papers (pp. 100\u2013116). Cham: Springer International Publishing."},{"issue":"1","key":"9272_CR16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1186\/1471-2105-15-130","volume":"15","author":"R Henriques","year":"2014","unstructured":"Henriques, R., & Madeira, S.C. (2014). Bicspam: flexible biclustering using sequential patterns. BMC Bioinformatics, 15(1), 130.","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"9272_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10601-009-9073-4","volume":"15","author":"S Kadioglu","year":"2010","unstructured":"Kadioglu, S., & Sellmann, M. (2010). Grammar constraints. Constraints, 15(1), 117\u2013144.","journal-title":"Constraints"},{"issue":"2","key":"9272_CR18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10601-016-9252-z","volume":"22","author":"A Kemmar","year":"2017","unstructured":"Kemmar, A., Lebbah, Y., Loudni, S., Boizumault, P., & Charnois, T. (2017). Prefix-projection global constraint and top-k approach for sequential pattern mining. Constraints, 22(2), 265\u2013306.","journal-title":"Constraints"},{"key":"9272_CR19","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-319-23219-5_17","volume-title":"Principles and practice of constraint programming: 21st international conference, CP 2015, cork, Ireland, August 31 \u2013 September 4, 2015, Proceedings","author":"A Kemmar","year":"2015","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 \u2013 September 4, 2015, Proceedings (pp. 226\u2013243). Cham: Springer International Publishing."},{"key":"9272_CR20","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 Quimper, C. (Ed.), 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":"9272_CR21","doi-asserted-by":"crossref","unstructured":"Li, C., & Wang, J. (2008). Efficiently mining closed subsequences with gap constraints. In Proceedings of the SIAM international conference on data mining, SDM 2008, April 24-26, 2008, atlanta, Georgia, USA (pp. 313\u2013322).","DOI":"10.1137\/1.9781611972788.28"},{"key":"9272_CR22","unstructured":"Lu, S., & Li, C. (2004). Aprioriadjust: an efficient algorithm for discovering the maximum sequential patterns. In Proc. Intern. Workshop knowl. Grid and grid intell."},{"issue":"3","key":"9272_CR23","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., & Verkamo, A.I. (1997). Discovery of frequent episodes in event sequences. Data mining and knowledge discovery, 1(3), 259\u2013289.","journal-title":"Data mining and knowledge discovery"},{"key":"9272_CR24","doi-asserted-by":"crossref","unstructured":"Metivier, J., Boizumault, P., Cr\u00e9milleux, B., Khiari, M., & Loudni, S. (2011). A constraint-based language for declarative pattern discovery. In Data mining workshops (ICDMW), 2011 IEEE 11th international conference on (pp. 1112\u20131119).","DOI":"10.1109\/ICDMW.2011.11"},{"key":"9272_CR25","doi-asserted-by":"crossref","unstructured":"N\u0117grevergne, B., & Guns, T. (2015). Constraint-based sequence 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_20"},{"key":"9272_CR26","unstructured":"OscaR Team (2012). OscaR: Scala in OR. Available from https:\/\/bitbucket.org\/oscarlib\/oscar ."},{"key":"9272_CR27","doi-asserted-by":"crossref","unstructured":"Parthasarathy, S., Zaki, M.J., Ogihara, M., & Dwarkadas, S. (1999). Incremental and interactive sequence mining. In Proceedings of the 8th international conference on information and knowledge management (pp. 251\u2013258).","DOI":"10.1145\/319950.320010"},{"key":"9272_CR28","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.C. (2001). Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of the 17th international conference on data engineering (pp. 215\u2013224)."},{"issue":"2","key":"9272_CR29","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10844-006-0006-z","volume":"28","author":"J Pei","year":"2007","unstructured":"Pei, J., Han, J., & Wang, W. (2007). Constraint-based sequential pattern mining: the pattern-growth methods. Journal of Intelligent Information Systems, 28 (2), 133\u2013160.","journal-title":"Journal of Intelligent Information Systems"},{"key":"9272_CR30","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 (pp. 482\u2013495): Springer.","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9272_CR31","doi-asserted-by":"crossref","unstructured":"Pinto, H., Han, J., Pei, J., Wang, K., Chen, Q., & Dayal, U. (2001). Multi-dimensional sequential pattern mining. In Proceedings of the tenth international conference on information and knowledge management (pp. 81\u201388).","DOI":"10.1145\/502585.502600"},{"key":"9272_CR32","doi-asserted-by":"crossref","unstructured":"Quimper, C.G., & Walsh, T. (2006). Global grammar constraints. In International conference on principles and practice of constraint programming (pp. 751\u2013755): Springer.","DOI":"10.1007\/11889205_64"},{"key":"9272_CR33","unstructured":"R\u00e9gin, J. C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings of the thirteenth national conference on artificial intelligence-volume 1 (pp. 209\u2013215): AAAI press."},{"key":"9272_CR34","unstructured":"Rossi, F., Van Beek, P., & Walsh, T. (2006). Handbook of CP. elsevier."},{"key":"9272_CR35","doi-asserted-by":"crossref","unstructured":"Srikant, R., & Agrawal, R. (1996). Mining sequential patterns: Generalizations and performance improvements. Springer.","DOI":"10.1007\/BFb0014140"},{"key":"9272_CR36","unstructured":"Tatti, N., & Cule, B. (2011). Mining closed episodes with simultaneous events. In Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201911 (pp. 1172\u20131180). New York: ACM."},{"issue":"8","key":"9272_CR37","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/TKDE.2007.1043","volume":"19","author":"J Wang","year":"2007","unstructured":"Wang, J., Han, J., & Li, C. (2007). Frequent closed sequence mining without candidate maintenance. IEEE Transactions on Knowledge and Data Engineering, 19(8), 1042\u20131056.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9272_CR38","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., & Afshar, R. (2003). Clospan: Mining: Closed sequential patterns in large datasets. In Proceedings of the 2003 SIAM international conference on data mining (pp. 166\u2013177): SIAM.","DOI":"10.1137\/1.9781611972733.15"},{"key":"9272_CR39","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. (1998). Efficient enumeration of frequent sequences. In Proceedings of the seventh international conference on information and knowledge management (pp. 68\u201375): ACM.","DOI":"10.1145\/288627.288643"},{"key":"9272_CR40","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. (2000). Sequence mining in categorical domains: incorporating constraints. In Proceedings of the ninth international conference on information and knowledge management (pp. 422\u2013429): ACM.","DOI":"10.1145\/354756.354849"},{"key":"9272_CR41","unstructured":"Zhao, Q., & Bhowmick, S.S. (2003). Sequential pattern mining: a survey. ITechnical Report CAIS Nayang Technological University Singapore pp. 1\u201326."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-017-9272-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9272-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9272-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T13:52:48Z","timestamp":1569419568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-017-9272-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,7]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9272"],"URL":"https:\/\/doi.org\/10.1007\/s10601-017-9272-3","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,7]]}}}