{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:40Z","timestamp":1763468260618},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,7,23]],"date-time":"2015-07-23T00:00:00Z","timestamp":1437609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10115-015-0860-5","type":"journal-article","created":{"date-parts":[[2015,7,22]],"date-time":"2015-07-22T05:21:23Z","timestamp":1437542483000},"page":"489-516","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Constrained pattern mining in the new era"],"prefix":"10.1007","volume":"47","author":[{"given":"Andreia","family":"Silva","sequence":"first","affiliation":[]},{"given":"Cl\u00e1udia","family":"Antunes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,23]]},"reference":[{"key":"860_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases (VLDB 94). Morgan Kaufmann, San Francisco, pp 487\u2013499"},{"issue":"12","key":"860_CR2","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"C Ahmed","year":"2009","unstructured":"Ahmed C, Tanbeer S, Jeong BS, Lee YK (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"860_CR3","doi-asserted-by":"crossref","unstructured":"Albert-Lorincz H, Boulicaut JF (2003) Mining frequent sequential patterns under regular expressions: a highly adaptive strategy for pushing constraints. In: Proceedings of the 3rd SIAM international conference on data mining (SDM 03). Springer, San Francisco, pp 316\u2013320","DOI":"10.1137\/1.9781611972733.37"},{"key":"860_CR4","unstructured":"Antunes C (2007) Onto4ar: a framework for mining association rules. In: Workshop on constraint-based mining and learning in the international conference on principles and practice of knowledge discovery in databases (PKDDW-CMILE 07). Springer, Warsaw, p 37"},{"key":"860_CR5","unstructured":"Antunes C (2008) An ontology-based framework for mining patterns in the presence of background knowledge. In: Proceedings of international conference on advanced intelligence (ICAI 08). Post and Telecom Press, Beijing, pp 163\u2013168"},{"key":"860_CR6","doi-asserted-by":"crossref","unstructured":"Antunes C (2009) Mining patterns in the presence of domain knowledge. In: Proceedings of the 11th international conference on enterprise information systems (ICEIS 09). Springer, Milan, pp 188\u2013193","DOI":"10.5220\/0001995001880193"},{"key":"860_CR7","doi-asserted-by":"crossref","unstructured":"Antunes C (2009) Pattern mining over star schemas in the onto4ar framework. In: Proceedings of the 2009 international workshop on semantic aspects in data mining (SADM 09). IEEE Computer Society, Washington, pp 453\u2013458","DOI":"10.1109\/ICDMW.2009.68"},{"key":"860_CR8","doi-asserted-by":"crossref","unstructured":"Antunes C, Oliveira A (2002) Inference of sequential association rules guided by context-free grammars. In: Proceedings of 6th international conference on grammatical inference (ICGI 2002). Springer, Amsterdam, pp 289\u2013293","DOI":"10.1007\/3-540-45790-9_1"},{"key":"860_CR9","doi-asserted-by":"crossref","unstructured":"Antunes C, Oliveira A (2003) Generalization of pattern-growth methods for sequential pattern mining with gap constraints. In: Proceedings of the 3rd international conference on machine learning and data mining in pattern recognition (MLDM 03). Springer, Leipzig, pp 239\u2013251","DOI":"10.1007\/3-540-45065-3_21"},{"key":"860_CR10","doi-asserted-by":"crossref","unstructured":"Antunes C, Oliveira A (2005) Constraint relaxations for discovering unknown sequential patterns. In: Knowledge discovery in inductive databases: 3rd international workshop, KDID 2004 (Revised Selected and Invited Papers), pp 11\u201332","DOI":"10.1007\/978-3-540-31841-5_2"},{"key":"860_CR11","unstructured":"Antunes C, Oliveira AL (2004) Sequential pattern mining with approximated constraints. In: Proceedings of IADIS international applied computing conference (AC 04). IADIS Press, Lisbon, pp 131\u2013138"},{"key":"860_CR12","unstructured":"Bayardo RJ (2005) The hows, whys, and whens of constraints in itemset and rule discovery. In: Proceedings of the 2004 European conference on constraint-based mining and inductive databases. Springer, Hinterzarten, pp 1\u201313"},{"key":"860_CR13","doi-asserted-by":"crossref","unstructured":"Bayardo RJ, Agrawal R (1999) Mining the most interesting rules. In: Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 99). ACM, San Diego, pp 145\u2013154","DOI":"10.1145\/312129.312219"},{"key":"860_CR14","doi-asserted-by":"crossref","unstructured":"Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2003) Adaptive constraint pushing in frequent pattern mining. In: Proceedings of the 7th conference on principles and practice of knowledge discovery in databases (PKDD 03). Springer, Berlin, pp 47\u201358","DOI":"10.1007\/978-3-540-39804-2_7"},{"issue":"3","key":"860_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/MIS.2005.45","volume":"20","author":"F Bonchi","year":"2005","unstructured":"Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2005) Exante: a preprocessing method for frequent-pattern mining. IEEE Intell Syst 20(3):25\u201331","journal-title":"IEEE Intell Syst"},{"key":"860_CR16","doi-asserted-by":"crossref","unstructured":"Boulicaut JF (2004) Inductive databases and multiple uses of frequent itemsets: the cinq approach. In: Database support for data mining applications. Springer, Berlin, pp 1\u201323","DOI":"10.1007\/978-3-540-44497-8_1"},{"key":"860_CR17","unstructured":"Boulicaut JF, Jeudy B (2000) Using constraints for itemset mining: Should we prune or not? In: Actes des 16\u00e8mes Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es (BDA 00). Blois, France"},{"key":"860_CR18","doi-asserted-by":"crossref","unstructured":"Boulicaut JF, Jeudy B (2005) Constraint-based data mining. In: Maimon O, Rokach L (eds) The data mining and knowledge discovery handbook. Springer, Berlin, pp 399\u2013416","DOI":"10.1007\/0-387-25465-X_18"},{"issue":"2","key":"860_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/253262.253327","volume":"26","author":"S Brin","year":"1997","unstructured":"Brin S, Motwani R, Silverstein C (1997) Beyond market baskets: generalizing association rules to correlations. SIGMOD Rec 26(2):265\u2013276","journal-title":"SIGMOD Rec"},{"issue":"3","key":"860_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C Bucila","year":"2003","unstructured":"Bucila C, Gehrke J, Kifer D, White WM (2003) Dualminer: a dual-pruning algorithm for itemsets with constraints. Data Min Knowl Discov 7(3):241\u2013272","journal-title":"Data Min Knowl Discov"},{"issue":"4","key":"860_CR21","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1504\/IJBIDM.2007.016385","volume":"2","author":"L Cao","year":"2007","unstructured":"Cao L, Luo D, Zhang C (2007) Knowledge actionability: satisfying technical and business interestingness. Int J Bus Intell Data Min 2(4):496\u2013514","journal-title":"Int J Bus Intell Data Min"},{"key":"860_CR22","doi-asserted-by":"crossref","unstructured":"Capelle M, Masson C, Boulicaut JF (2002) Mining frequent sequential patterns under a similarity constraint. In: Proceedings of the third international conference on intelligent data engineering and automated learning (IDEAL 02). Springer, London, pp 1\u20136","DOI":"10.1007\/3-540-45675-9_1"},{"key":"860_CR23","doi-asserted-by":"crossref","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Third IEEE international conference on data mining (ICDM 03). IEEE, pp 19\u201326","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"860_CR24","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt L, Guns T, Nijssen S (2008) Constraint programming for itemset mining. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 08). ACM, New York, pp 204\u2013212","DOI":"10.1145\/1401890.1401919"},{"key":"860_CR25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-1-4419-7738-0_4","volume-title":"Inductive databases and constraint-based data mining","author":"L Raedt De","year":"2010","unstructured":"De Raedt L, Jaeger M, Lee S, Mannila H (2010) A theory of inductive query answering. In: D\u017eeroski S, Goethals B, Panov P (eds) Inductive databases and constraint-based data mining. Springer, New York, pp 79\u2013103"},{"key":"860_CR26","unstructured":"De\u00a0Raedt L, Kramer S (2001) The levelwise version space algorithm and its application to molecular fragment finding. In: Proceedings of the 17th international joint conference on artificial intelligence\u2014Volume 2 (IJCAI 01). Morgan Kaufmann Publishers Inc., Seattle, pp 853\u2013859"},{"key":"860_CR27","doi-asserted-by":"crossref","unstructured":"Dong G, Li, J (1999) Efficient mining of emerging patterns: discovering trends and differences. In: Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 99). ACM, San Diego, pp 43\u201352","DOI":"10.1145\/312129.312191"},{"issue":"1","key":"860_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/959242.959245","volume":"5","author":"S D\u017eeroski","year":"2003","unstructured":"D\u017eeroski S (2003) Multi-relational data mining: an introduction. SIGKDD Explor Newsl 5(1):1\u201316","journal-title":"SIGKDD Explor Newsl"},{"issue":"3","key":"860_CR29","first-page":"57","volume":"13","author":"WJ Frawley","year":"1992","unstructured":"Frawley WJ, Piatetsky-Shapiro G, Matheus CJ (1992) Knowledge discovery in databases: an overview. AI Mag 13(3):57\u201370","journal-title":"AI Mag"},{"key":"860_CR30","unstructured":"Garofalakis MN, Rastogi R, Shim K (1999) Spirit: sequential pattern mining with regular expression constraints. In: Proceedings of the 25th international conference on very large data bases (VLDB 99). Morgan Kaufmann Publishers Inc., San Francisco, pp 223\u2013234"},{"key":"860_CR31","unstructured":"Giannella C, Han J, Pei J, Yan X, Yu PS (2003) Mining frequent patterns in data streams at multiple time granularities. In: Kargupta H, Joshi A, Sivakumar K, Yesha Y (eds) Data mining: next generation challenges and future directions. AAAI\/MIT Press"},{"key":"860_CR32","doi-asserted-by":"crossref","unstructured":"Grahne G, Lakshmanan LVS, Wang X (2000) Efficient mining of constrained correlated sets. In: Proceedings of 16th international conference on data engineering, pp 512\u2013521","DOI":"10.1109\/ICDE.2000.839450"},{"issue":"1","key":"860_CR33","doi-asserted-by":"crossref","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 (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"key":"860_CR34","volume-title":"Data mining: concepts and techniques. The Morgan Kaufmann Series in Data Management Systems","author":"J Han","year":"2011","unstructured":"Han J, Kamber M, Pei J (2011) Data mining: concepts and techniques. The Morgan Kaufmann Series in Data Management Systems. Elsevier, Amsterdam"},{"key":"860_CR35","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD. ACM, New York, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"860_CR36","doi-asserted-by":"crossref","unstructured":"Jaroszewicz S, Scheffer T (2005) Fast discovery of unexpected patterns in data, relative to a bayesian network. In: Proceedings of the 11th ACM SIGKDD international conference on knowledge discovery in data mining (KDD 05). ACM, Chicago, pp 118\u2013127","DOI":"10.1145\/1081870.1081887"},{"key":"860_CR37","doi-asserted-by":"crossref","unstructured":"Jaroszewicz S, Simovici DA (2004) Interestingness of frequent itemsets using bayesian networks as background knowledge. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 04). ACM, Seattle, pp 178\u2013186","DOI":"10.1145\/1014052.1014074"},{"key":"860_CR38","doi-asserted-by":"crossref","unstructured":"Lent B, Swami A, Widom J (1997) Clustering association rules. In: Proceedings of the 13th international conference on data engineering (ICDE 97). IEEE Computer Society, Birmingham, pp 220\u2013231","DOI":"10.1109\/ICDE.1997.581756"},{"key":"860_CR39","doi-asserted-by":"crossref","unstructured":"Leung CKS, Brajczuk DA (2009) Efficient algorithms for mining constrained frequent patterns from uncertain data. In: Proceedings of the 1st ACM SIGKDD workshop on knowledge discovery from uncertain data (U 09). ACM, Paris, pp 9\u201318","DOI":"10.1145\/1610555.1610557"},{"key":"860_CR40","doi-asserted-by":"crossref","unstructured":"Leung CKS, Hao B, Brajczuk D (2010) Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In: Proceedings of the 2010 ACM symposium on applied computing (SAC 10). ACM, Sierre, pp 1034\u20131038","DOI":"10.1145\/1774088.1774305"},{"key":"860_CR41","doi-asserted-by":"crossref","unstructured":"Leung CKS, Khan Q (2006) Efficient mining of constrained frequent patterns from streams. In: Proceedings of the 10th international database engineering and applications symposium (IDEAS 06), vol\u00a00. IEEE Computer Society, Delhi, pp 61\u201368","DOI":"10.1109\/IDEAS.2006.20"},{"issue":"1","key":"860_CR42","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/568574.568581","volume":"4","author":"CKS Leung","year":"2002","unstructured":"Leung CKS, Lakshmanan L, Ng R (2002) Exploiting succinct constraints using fp-trees. SIGKDD Explor Newsl 4(1):40\u201349","journal-title":"SIGKDD Explor Newsl"},{"key":"860_CR43","doi-asserted-by":"crossref","unstructured":"Leung CKS, Sun L (2012) A new class of constraints for constrained frequent pattern mining. In: Proceedings of the 27th annual ACM symposium on applied computing (SAC 12). ACM, Trento, pp 199\u2013204","DOI":"10.1145\/2245276.2245314"},{"issue":"1","key":"860_CR44","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"YC Li","year":"2008","unstructured":"Li YC, Yeh JS, Chang CC (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64(1):198\u2013217","journal-title":"Data Knowl Eng"},{"key":"860_CR45","unstructured":"Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. In: Proceedings of the 1998 international conference on knowledge discovery and data mining (KDD 98). AAAI Press, New York, pp 80\u201386"},{"issue":"1","key":"860_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-009-0267-2","volume":"26","author":"H Liu","year":"2011","unstructured":"Liu H, Lin Y, Han J (2011) Methods for mining frequent items in data streams: an overview. Knowl Inf Syst 26(1):1\u201330","journal-title":"Knowl Inf Syst"},{"key":"860_CR47","doi-asserted-by":"crossref","unstructured":"Liu Y, Keng Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Proceedings of the Pacific-Asia conference on knowledge discovery and data mining (PAKDD 05). Springer, Berlin, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"860_CR48","doi-asserted-by":"crossref","unstructured":"Mabroukeh N, Ezeife C (2009) Semantic-rich markov models for web prefetching. In: Proceedings of the IEEE international conference on data mining workshops (ICDMW 09). Miami, pp 465\u2013470","DOI":"10.1109\/ICDMW.2009.18"},{"key":"860_CR49","doi-asserted-by":"crossref","unstructured":"Mabroukeh N, Ezeife C (2009) Using domain ontology for semantic web usage mining and next page prediction. In: Proceedings of the 18th ACM conference on information and knowledge management (CIKM 09). ACM, Hong Kong, pp 1677\u20131680","DOI":"10.1145\/1645953.1646202"},{"key":"860_CR50","doi-asserted-by":"crossref","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of the 28th international conference on very large data bases (VLDB 02). Morgan Kaufman, Hong Kong, pp 346\u2013357","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"3","key":"860_CR51","doi-asserted-by":"crossref","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":"3","key":"860_CR52","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H, Inkeri Verkamo A (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Discov 1(3):259\u2013289","journal-title":"Data Min Knowl Discov"},{"key":"860_CR53","doi-asserted-by":"crossref","unstructured":"Ng R, Lakshmanan L, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data. ACM, Seattle, pp 13\u201324","DOI":"10.1145\/276304.276307"},{"key":"860_CR54","doi-asserted-by":"crossref","unstructured":"Nijssen S, Jim\u00e9nez A, Guns T (2011) Constraint-based pattern mining in multi-relational databases. In: ICDM workshops. IEEE Computer Society, Vancouver, pp 1120\u20131127","DOI":"10.1109\/ICDMW.2011.54"},{"key":"860_CR55","doi-asserted-by":"crossref","unstructured":"\u00d6zden B, Ramaswamy S, Silberschatz A (1998) Cyclic association rules. In: Proceedings of the 14th international conference on data engineering (ICDE 98). IEEE Computer Society, Washington, pp 412\u2013421","DOI":"10.1109\/ICDE.1998.655804"},{"key":"860_CR56","unstructured":"Padmanabhan B, Tuzhilin A (1998) A belief-driven method for discovering unexpected patterns. In: Proceedings of the 4th international conference on knowledge discovery in data mining (KDD 98). AAAI Press, pp 94\u2013100"},{"key":"860_CR57","doi-asserted-by":"crossref","unstructured":"Pei J, Han J (2000) Can we push more constraints into frequent pattern mining? In: Proceedings of the sixth ACM SIGKDD international conference on knowledge discovery and data mining (KDD 00). ACM, Boston, pp 350\u2013354","DOI":"10.1145\/347090.347166"},{"issue":"1","key":"860_CR58","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/568574.568580","volume":"4","author":"J Pei","year":"2002","unstructured":"Pei J, Han J (2002) Constrained frequent pattern mining: a pattern-growth view. SIGKDD Explor Newsl 4(1):31\u201339","journal-title":"SIGKDD Explor Newsl"},{"key":"860_CR59","unstructured":"Pei J, Han J, Lakshmanan LVS (2001) Mining frequent itemsets with convertible constraints. In: Proceedings of the 17th international conference on data engineering (ICDE 01). IEEE Computer Society, Washington, pp 433\u2013442"},{"key":"860_CR60","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: Proceedings of the 17th international conference on data engineering (ICDE 01). IEEE Computer Society, Washington, pp 215\u2013224"},{"key":"860_CR61","doi-asserted-by":"crossref","unstructured":"Pei J, Han J, Wang W (2002) Mining sequential patterns with constraints in large databases. In: Proceedings of the 2002 ACM international conference on information and knowledge management (CIKM 02). McLean, pp 18\u201325","DOI":"10.1145\/584792.584799"},{"issue":"2","key":"860_CR62","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. J Intell Inf Syst 28(2):133\u2013160","journal-title":"J Intell Inf Syst"},{"key":"860_CR63","doi-asserted-by":"crossref","unstructured":"Silva A, Antunes C (2010) Pattern mining on stars with fp-growth. In: Proceedings of the 7th international conference on modeling decisions for artificial intelligence (MDAI 10). Springer, Perpignan, pp 175\u2013186","DOI":"10.1007\/978-3-642-16292-3_18"},{"key":"860_CR64","doi-asserted-by":"crossref","unstructured":"Silva A, Antunes C (2013) Pushing constraints into a pattern tree. In: Proceedings of the 10th international conference on modeling decisions for artificial intelligence (MDAI 13). Springer, Barcelona","DOI":"10.1007\/978-3-642-41550-0_13"},{"key":"860_CR65","doi-asserted-by":"crossref","unstructured":"Silva A, Antunes C (2013) Pushing constraints into data streams. In: 2nd international workshop on big data, streams and heterogeneous source mining (BigMine 13). ACM, London, pp 79\u201386","DOI":"10.1145\/2501221.2501232"},{"key":"860_CR66","doi-asserted-by":"crossref","unstructured":"Silva A, Antunes C (2013) Towards the integration of constrained mining with star schemas. In: 13th IEEE international conference on data mining workshops\u2014domain driven data mining (DDDM 13). IEEE Computer Society, pp 413\u2013420","DOI":"10.1109\/ICDMW.2013.102"},{"key":"860_CR67","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/11430919_76","volume-title":"Advances in knowledge discovery and data mining, Lecture Notes in Computer Science","author":"A Soulet","year":"2005","unstructured":"Soulet A, Crmilleux B (2005) An efficient framework for mining flexible constraints. In: Ho T, Cheung D, Liu H (eds) Advances in knowledge discovery and data mining, Lecture Notes in Computer Science, vol 3518. Springer, Berlin, pp 661\u2013671"},{"key":"860_CR68","unstructured":"Srikant R, Agrawal R (1995) Mining generalized association rules. In: Proceedings of the 21th international conference on very large data bases (VLDB 95). Morgan Kaufmann Publishers Inc., San Francisco, pp 407\u2013419"},{"key":"860_CR69","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: Proceedings of the 5th international conference on extending database technology: advances in database technology (EDBT 96). Springer, London, pp 3\u201317","DOI":"10.1007\/BFb0014140"},{"key":"860_CR70","unstructured":"Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints. In: Proceedings of the 3rd ACM SIGKDD international conference on knowledge discovery and data mining (KDD 97). AAAI Press, California, pp 67\u201373"},{"key":"860_CR71","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (2010) Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of 16th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 10). ACM, London, pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"860_CR72","doi-asserted-by":"crossref","unstructured":"Wang K, Jiang Y, Lakshmanan LVS (2003) Mining unexpected rules by pushing user dynamics. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 03). ACM, Washington, pp 246\u2013255","DOI":"10.1145\/956750.956780"},{"issue":"3","key":"860_CR73","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TKDE.2005.45","volume":"17","author":"K Wang","year":"2005","unstructured":"Wang K, Jiang Y, Yu JX, Dong G, Han J (2005) Divide-and-approximate: a novel constraint push strategy for iceberg cube mining. IEEE Trans Knowl Data Eng 17(3):354\u2013368","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"860_CR74","doi-asserted-by":"crossref","unstructured":"Wu CW, Lin YF, Yu PS, Tseng VS (2013) Mining high utility episodes in complex event sequences. In: Proceedings of 19th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 13). ACM, London, pp 536\u2013544","DOI":"10.1145\/2487575.2487654"},{"issue":"4","key":"860_CR75","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1142\/S0219622006002258","volume":"5","author":"Q Yang","year":"2006","unstructured":"Yang Q, Wu X (2006) 10 challenging problems in data mining research. Int J Inf Technol Decis Mak 5(4):597\u2013604","journal-title":"Int J Inf Technol Decis Mak"},{"key":"860_CR76","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the fourth SIAM international conference on data mining (ICDM 04), pp 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"860_CR77","doi-asserted-by":"crossref","unstructured":"Yin J, Zheng Z, Cao L (2012) Uspan: An efficient algorithm for mining high utility sequential patterns. In: Proceedings of 18th ACM SIGKDD international conference on knowledge discovery and data mining (KDD 12). ACM, London, pp 660\u2013668","DOI":"10.1145\/2339530.2339636"},{"key":"860_CR78","doi-asserted-by":"crossref","unstructured":"Yun U, Leggett JJ (2005) Wfim: Weighted frequent itemset mining with a weight range and a minimum weight. In: SDM","DOI":"10.1137\/1.9781611972757.76"},{"key":"860_CR79","doi-asserted-by":"crossref","unstructured":"Zaki M (2000) Sequence mining in categorical domains: Incorporating constraints. In: Proceedings of the 9th international conference on information and knowledge management (CIKM 00). ACM, McLean, pp 422\u2013429","DOI":"10.1145\/354756.354849"},{"issue":"7","key":"860_CR80","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/TKDE.2007.1053","volume":"19","author":"X Zhang","year":"2007","unstructured":"Zhang X, Chou PL, Dong G (2007) Efficient computation of iceberg cubes by bounding aggregate functions. IEEE Trans Knowl Data Eng 19(7):903\u2013918","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"860_CR81","doi-asserted-by":"crossref","unstructured":"Zhu F, Yan X, Han J, Yu PS (2007) gprune: a constraint pushing framework for graph pattern mining. In: Proceedings of the 11th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD 07). Springer, Nanjing, pp 388\u2013400","DOI":"10.1007\/978-3-540-71701-0_38"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0860-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0860-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0860-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T11:42:33Z","timestamp":1566992553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0860-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,23]]},"references-count":81,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["860"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0860-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,23]]}}}