{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T01:40:07Z","timestamp":1749778807720,"version":"3.41.0"},"publisher-location":"Cham","reference-count":106,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501369"},{"type":"electronic","value":"9783319501376"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50137-6_2","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T10:41:48Z","timestamp":1480675308000},"page":"25-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Data Mining and Constraints: An Overview"],"prefix":"10.1007","author":[{"given":"Valerio","family":"Grossi","sequence":"first","affiliation":[]},{"given":"Dino","family":"Pedreschi","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Turini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.-P., Sander, J.: Optics: ordering points to identify the clustering structure. In: Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, SIGMOD 1999, pp. 49\u201360. ACM, New York, NY, USA (1999)","DOI":"10.1145\/304182.304187"},{"key":"2_CR2","first-page":"821","volume":"25","author":"MA Aizerman","year":"1964","unstructured":"Aizerman, M.A., Braverman, E.A., Rozonoer, L.: Theoretical foundations of the potential function method in pattern recognition learning. Autom. Remote Control 25, 821\u2013837 (1964)","journal-title":"Autom. Remote Control"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 429\u2013435 (2002)","DOI":"10.1145\/775047.775109"},{"key":"2_CR4","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases (VLDB 1994), Santiago de Chile, Chile, 12\u201315 September, pp. 487\u2013499 (1994)"},{"issue":"9","key":"2_CR5","doi-asserted-by":"publisher","first-page":"7976","DOI":"10.1016\/j.eswa.2012.01.117","volume":"39","author":"CF Ahmed","year":"2012","unstructured":"Ahmed, C.F., Tanbeer, S.K., Jeong, B.-S., Lee, Y.-K., Choi, H.-J.: Single-pass incremental and interactive mining for weighted frequent patterns. Expert Syst. Appl. 39(9), 7976\u20137994 (2012)","journal-title":"Expert Syst. Appl."},{"key":"2_CR6","unstructured":"Bradley, P.S., Bennett, K.P., Demiriz, A.: Constrained k-means clustering. Technical report, MSR-TR-2000-65, Microsoft Research (2000)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Basu, S., Bilenko, M., Mooney, R.J.: A probabilistic framework for semi-supervised clustering. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 59\u201368 (2004)","DOI":"10.1145\/1014052.1014062"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Bilenko, M., Basu, S., Mooney, R.J.: Integrating constraints and metric learning in semi-supervised clustering. In: Proceedings of the Twenty-First International Conference on Machine Learning, ICML 2004, p. 11. ACM, New York (2004)","DOI":"10.1145\/1015330.1015360"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ins.2011.05.016","volume":"194","author":"E Baralis","year":"2012","unstructured":"Baralis, E., Cagliero, L., Cerquitelli, T., Garza, P.: Generalized association rule mining with constraints. Inf. Sci. 194, 68\u201384 (2012)","journal-title":"Inf. Sci."},{"key":"2_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9781584889977","volume-title":"Constrained Clustering: Advances in Algorithms, Theory, and Applications","author":"S Basu","year":"2008","unstructured":"Basu, S., Davidson, I., Wagstaff, K.L.: Constrained Clustering: Advances in Algorithms, Theory, and Applications. Chapman and Hall\/CRC, Boca Raton (2008)"},{"key":"2_CR11","volume-title":"Linear Network Optimization - Algorithms and Codes","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas, D.P.: Linear Network Optimization - Algorithms and Codes. MIT Press, Cambridge (1991)"},{"key":"2_CR12","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Olshen, R., Stone, C.: Classification and Regression Trees. Wadsworth International Group, Belmont (1984)"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10618-006-0040-z","volume":"13","author":"A Banerjee","year":"2006","unstructured":"Banerjee, A., Ghosh, J.: Scalable clustering algorithms with balancing constraints. Data Min. Knowl. Discov. 13(3), 365\u2013395 (2006)","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR14","first-page":"171","volume-title":"Constrained Clustering: Advances in Algorithms. Theory, and Applications","author":"A Banerjee","year":"2008","unstructured":"Banerjee, A., Ghosh, J.: Clustering with balancing constraints. Constrained Clustering: Advances in Algorithms. Theory, and Applications, pp. 171\u2013200. Chapman and Hall\/CRC, Boca Raton (2008)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I.M., Vapnik, V.N.: A training algorithm for optimal margin classifiers. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, COLT 1992, pp. 144\u2013152. ACM, New York (1992)","DOI":"10.1145\/130385.130401"},{"key":"2_CR16","unstructured":"Barbar\u00e1, D., Kamath, C. (eds.): Proceedings of the Third SIAM International Conference on Data Mining, 1\u20133 May 2003. SIAM, San Francisco (2003)"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/256303.256306","volume":"44","author":"S Bistarelli","year":"1997","unstructured":"Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint solving and optimization. J. ACM 44(2), 201\u2013236 (1997)","journal-title":"J. ACM"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1009715923555","volume":"2","author":"CJC Burges","year":"1998","unstructured":"Burges, C.J.C.: A tutorial on support vector machines for pattern recognition. Data Min. Knowl. Discov. 2(2), 121\u2013167 (1998)","journal-title":"Data Min. Knowl. Discov."},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/mksc.14.4.378","volume":"14","author":"JR Bult","year":"1995","unstructured":"Bult, J.R., Wansbeek, T.J.: Optimal selection for direct mail. Mark. Sci. 14(4), 378\u2013394 (1995)","journal-title":"Mark. Sci."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Capelle, M., Masson, C., Boulicaut, J.F.: Mining frequent sequential patterns under regular expressions: a highly adaptive strategy for pushing constraints. In: Proceedings of the Third SIAM International Conference on Data Mining, pp. 316\u2013320 (2003)","DOI":"10.1137\/1.9781611972733.37"},{"issue":"1","key":"2_CR21","first-page":"2231","volume":"2","author":"C Chand","year":"2012","unstructured":"Chand, C., Thakkar, A., Ganatra, A.: Sequential pattern mining: survey and current research challenges. Int. J. Soft Comput. Eng. (IJSCE) 2(1), 2231\u20132307 (2012)","journal-title":"Int. J. Soft Comput. Eng. (IJSCE)"},{"issue":"3","key":"2_CR22","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Davidson, I.: Two approaches to understanding when constraints help clustering. In: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 1312\u20131320 (2012)","DOI":"10.1145\/2339530.2339734"},{"key":"2_CR24","first-page":"201","volume-title":"Constrained Clustering: Advances in Algorithms. Theory, and Applications","author":"A Demiriz","year":"2008","unstructured":"Demiriz, A., Bennett, K.P., Bradley, P.S.: Using assignment constraints to avoid empty clusters in k-means clustering. Constrained Clustering: Advances in Algorithms. Theory, and Applications, pp. 201\u2013220. Chapman and Hall\/CRC, Boca Raton (2008)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-40994-3_27","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T-B-H Dao","year":"2013","unstructured":"Dao, T.-B.-H., Duong, K.-C., Vrain, C.: A declarative framework for constrained clustering. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8190, pp. 419\u2013434. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40994-3_27"},{"key":"2_CR26","volume-title":"Pattern Classification and Scene Analysis","author":"RO Duda","year":"1973","unstructured":"Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, New York (1973)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Druck, G., Mann, G.S., McCallum, A.: Learning from labeled features using generalized expectation criteria. In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pp. 595\u2013602 (2008)","DOI":"10.1145\/1390334.1390436"},{"key":"2_CR28","unstructured":"Domingos, P., Pazzani, M.J.: Beyond independence: conditions for the optimality of the simple Bayesian classifier. In: Proceedings of the 13th International Conference on Machine Learning (ICML 1996), Bari, Italy, pp. 148\u2013156 (1996)"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S.S.: Clustering with constraints: feasibility issues and the k-means algorithm. In: Proceedings of the SIAM International Conference on Data Mining (SDM) (2005)","DOI":"10.1137\/1.9781611972757.13"},{"key":"2_CR30","unstructured":"Davidson, I., Ravi, S.S.: Identifying and generating easy sets of constraints for clustering. In: Proceedings of the Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference (AAAI), pp. 336\u2013341 (2006)"},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10618-006-0053-7","volume":"14","author":"I Davidson","year":"2007","unstructured":"Davidson, I., Ravi, S.S.: The complexity of non-hierarchical clustering with instance and cluster level constraints. Data Min. Knowl. Discov. 14(1), 25\u201361 (2007)","journal-title":"Data Min. Knowl. Discov."},{"issue":"2","key":"2_CR32","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10618-008-0103-4","volume":"18","author":"I Davidson","year":"2009","unstructured":"Davidson, I., Ravi, S.S.: Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results. Data Min. Knowl. Discov. 18(2), 257\u2013282 (2009)","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11871637_15","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"I Davidson","year":"2006","unstructured":"Davidson, I., Wagstaff, K.L., Basu, S.: Measuring constraint-set utility for partitional clustering algorithms. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 115\u2013126. Springer, Heidelberg (2006). doi:10.1007\/11871637_15"},{"key":"2_CR34","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xiaowei, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD), pp. 226\u2013231 (1996)"},{"key":"2_CR35","doi-asserted-by":"publisher","DOI":"10.1002\/9781118617151","volume-title":"Biological Knowledge Discovery Handbook: Preprocessing, Mining and Postprocessing of Biological Data","author":"M Elloumi","year":"2013","unstructured":"Elloumi, M., Zomaya, A.Y.: Biological Knowledge Discovery Handbook: Preprocessing, Mining and Postprocessing of Biological Data, 1st edn. Wiley, New York (2013)","edition":"1"},{"key":"2_CR36","unstructured":"Yongjian, F., Han, J.: Meta-rule-guided mining of association rules in relational databases. In: Proceedings of the Post-Conference Workshops on Integration of Knowledge Discovery in Databases with Deductive and Object-Oriented Databases (KDOOD\/TDOOD), pp. 39\u201346 (1995)"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-662-49224-6_9","volume-title":"Software Engineering and Formal Methods","author":"V Grossi","year":"2015","unstructured":"Grossi, V., Monreale, A., Nanni, M., Pedreschi, D., Turini, F.: Clustering formulation using constraint optimization. In: Bianculli, D., Calinescu, R., Rumpe, B. (eds.) SEFM 2015. LNCS, vol. 9509, pp. 93\u2013107. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-49224-6_9"},{"key":"2_CR38","unstructured":"Garofalakis, M.N., Rastogi, R., Shim, K.: SPIRIT: Sequential pattern mining with regular expression constraints. In: Proceedings of 25th International Conference on Very Large Data Bases (VLDB), pp. 223\u2013234 (1999)"},{"key":"2_CR39","unstructured":"Grossi, V., Sperduti, A.: Kernel-based selective ensemble learning for streams of trees. In: Walsh, T. (ed.) IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, 16\u201322 July 2011, pp. 1281\u20131287. IJCAI\/AAAI (2011)"},{"issue":"2","key":"2_CR40","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10115-011-0378-4","volume":"30","author":"V Grossi","year":"2012","unstructured":"Grossi, V., Turini, F.: Stream mining: a novel architecture for ensemble-based classification. Knowl. Inf. Syst. 30(2), 247\u2013281 (2012)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"2_CR41","doi-asserted-by":"publisher","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.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15(1), 55\u201386 (2007)","journal-title":"Data Min. Knowl. Discov."},{"issue":"5","key":"2_CR42","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1109\/69.806937","volume":"11","author":"J Han","year":"1999","unstructured":"Han, J., Fu, Y.: Mining multiple-level association rules in large databases. IEEE Trans. Knowl. Data Eng. 11(5), 798\u2013805 (1999)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR43","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2012","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2012)","edition":"2"},{"issue":"8","key":"2_CR44","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/2.781634","volume":"32","author":"J Han","year":"1999","unstructured":"Han, J., Lakshmanan, L.V.S., Ng, R.T.: Constraint-based multidimensional data mining. IEEE Comput. 32(8), 46\u201350 (1999)","journal-title":"IEEE Comput."},{"key":"2_CR45","first-page":"365","volume-title":"Lecture Notes in Computer Science","author":"Sariel Har-Peled","year":"2002","unstructured":"Har-Peled, S., Roth, D., Zimak, D.: Constraint classification: a new approach to multiclass classification. In: Proceedings of the 13th International Conference Algorithmic Learning Theory (ALT), pp. 365\u2013379 (2002)"},{"key":"2_CR46","doi-asserted-by":"crossref","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, Dallas, Texas, USA, 16\u201318 May, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"2_CR47","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 13\u201323. Springer, Heidelberg (2000). doi:10.1007\/3-540-45372-5_2"},{"key":"2_CR48","volume-title":"An introduction to Bayesian networks","author":"FV Jensen","year":"1996","unstructured":"Jensen, F.V.: An introduction to Bayesian networks. Springer, New York (1996)"},{"issue":"4","key":"2_CR49","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TKDE.2007.190715","volume":"20","author":"N Kumar","year":"2008","unstructured":"Kumar, N., Kummamuru, K.: Semisupervised clustering with metric learning using relative comparisons. IEEE Trans. Knowl. Data Eng. 20(4), 496\u2013503 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR50","doi-asserted-by":"crossref","unstructured":"Kummamuru, K., Krishnapuram, R., Agrawal, R.: Learning spatially variant dissimilarity (SVaD) measures. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 611\u2013616 (2004)","DOI":"10.1145\/1014052.1014128"},{"issue":"3","key":"2_CR51","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1007608224229","volume":"40","author":"TS Lin","year":"2000","unstructured":"Lin, T.S., Loh, W.Y., Shib, Y.S.: A comparison of prediction accuracy, complexity, and training time of thirty-tree old and new classification algorithms. Mach. Learn. 40(3), 203\u2013228 (2000)","journal-title":"Mach. Learn."},{"issue":"1","key":"2_CR52","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"Y-C Li","year":"2008","unstructured":"Li, Y.-C., Yeh, J.-S., Chang, C.-C.: Isolated items discarding strategy for discovering high utility itemsets. Data Knowl. Eng. 64(1), 198\u2013217 (2008)","journal-title":"Data Knowl. Eng."},{"key":"2_CR53","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/BFb0014141","volume-title":"Advances in Database Technology \u2014 EDBT '96","author":"Manish Mehta","year":"1996","unstructured":"Mehta, M., Agrawal, R., Rissanen, J.: SLIQ: A fast scalable classifier for data mining. In: Proceedings of 5th International Conference on Extending Database Technology (EBDT 1996), Avignon, France, pp. 18\u201332 (1996)"},{"issue":"1","key":"2_CR54","doi-asserted-by":"publisher","first-page":"3: 1","DOI":"10.1145\/1824795.1824798","volume":"43","author":"NR Mabroukeh","year":"2010","unstructured":"Mabroukeh, N.R., Ezeife, C.I.: A taxonomy of sequential pattern mining algorithms. ACM Comput. Surv. 43(1), 3: 1\u20133: 41 (2010)","journal-title":"ACM Comput. Surv."},{"key":"2_CR55","volume-title":"Machine Learning","author":"T Michell","year":"1997","unstructured":"Michell, T.: Machine Learning. McGraw Hill, New York (1997)"},{"issue":"4","key":"2_CR56","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1145\/356893.356898","volume":"14","author":"BME Moret","year":"1982","unstructured":"Moret, B.M.E.: Decision trees and diagrams. Comput. Surv. 14(4), 593\u2013623 (1982)","journal-title":"Comput. Surv."},{"issue":"2","key":"2_CR57","doi-asserted-by":"publisher","first-page":"2677","DOI":"10.1016\/j.eswa.2008.01.021","volume":"36","author":"F Masseglia","year":"2009","unstructured":"Masseglia, F., Poncelet, P., Teisseire, M.: Efficient mining of sequential patterns with time constraints: reducing the combinations. Expert Syst. Appl. 36(2), 2677\u20132690 (2009)","journal-title":"Expert Syst. Appl."},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Fromont, \u00c9.: Mining optimal decision trees from itemset lattices. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 530\u2013539 (2007)","DOI":"10.1145\/1281192.1281250"},{"issue":"1","key":"2_CR59","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10618-010-0174-x","volume":"21","author":"S Nijssen","year":"2010","unstructured":"Nijssen, S., Fromont, E.: Optimal constraint-based decision tree induction from itemset lattices. Data Min. Knowl. Discov. Fromont. 21(1), 9\u201351 (2010)","journal-title":"Data Min. Knowl. Discov. Fromont."},{"key":"2_CR60","doi-asserted-by":"crossref","unstructured":"Niyogi, P., Pierrot, J.-B., Siohan, O.: Multiple classifiers by constrained minimization. In: Proceedings of the Acoustics, Speech, and Signal Processing of 2000 IEEE International Conference on ICASSP 2000, vol. 06, pp. 3462\u20133465. IEEE Computer Society, Washington, DC (2000)","DOI":"10.1109\/ICASSP.2000.860146"},{"key":"2_CR61","doi-asserted-by":"crossref","unstructured":"Okabe, M., Yamada, S.: Clustering by learning constraints priorities. In: Proceedings of the 12th International Conference on Data Mining (ICDM2012), pp. 1050\u20131055 (2012)","DOI":"10.1109\/ICDM.2012.150"},{"key":"2_CR62","unstructured":"Park, S.H., Furnkranz, J.: Multi-label classification with label constraints. Technical report, Knowledge Engineering Group, TU Darmstadt (2008)"},{"issue":"11","key":"2_CR63","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans. Knowl. Data Eng. 16(11), 1424\u20131440 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"2_CR64","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10844-006-0006-z","volume":"28","author":"J Pei","year":"2007","unstructured":"Pei, J., Han, J., Wang, W.: Constraint-based sequential pattern mining: the pattern growth methods. J. Intell. Inf. Syst. 28(2), 133\u2013160 (2007)","journal-title":"J. Intell. Inf. Syst."},{"key":"2_CR65","volume-title":"Data Preparation for Data Mining","author":"D Pyle","year":"1999","unstructured":"Pyle, D.: Data Preparation for Data Mining. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"2_CR66","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1, 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"2_CR67","volume-title":"C4.5 Programs for Machine Learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5 Programs for Machine Learning. Wadsworth International Group, Belmont (1993)"},{"key":"2_CR68","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1613\/jair.279","volume":"4","author":"JR Quinlan","year":"1996","unstructured":"Quinlan, J.R.: Improved use of continuous attributes in C4.5. J. Artif. Intell. Res. 4, 77\u201390 (1996)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"2_CR69","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/69.991727","volume":"14","author":"S Ruggieri","year":"2002","unstructured":"Ruggieri, S.: Efficient C4.5. IEEE Trans. Knowl. Data Eng. 14(2), 438\u2013444 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR70","unstructured":"Srikant, R., Agrawal, R.: Mining generalized association rules. In: Proceedings of the 21st Conference on Very Large Data Bases (VLDB), pp. 407\u2013419 (1995)"},{"key":"2_CR71","first-page":"1","volume-title":"Advances in Database Technology \u2014 EDBT '96","author":"Ramakrishnan Srikant","year":"1996","unstructured":"Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: Proceedings of the 5th International Conference on Extending Database Technology (EDBT), pp. 3\u201317 (1996)"},{"key":"2_CR72","unstructured":"Shafer, J., Agrawal, R., Mehta, M.: Sprint: a scalable parallel classifier for data mining. In: Proceedings of 1996 International Conference on Very Large Data Bases (VLDB 1996), Bombay, India, pp. 544\u2013555 (1996)"},{"key":"2_CR73","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77242-4","volume-title":"Support Vector Machines","author":"I Steinwart","year":"2008","unstructured":"Steinwart, I., Christmann, A.: Support Vector Machines, 1st edn. Springer Publishing Company, Incorporated, Heidelberg (2008)","edition":"1"},{"issue":"2","key":"2_CR74","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/ijoc.15.2.208.14448","volume":"15","author":"A Strehl","year":"2003","unstructured":"Strehl, A., Ghosh, J.: Relationship-based clustering and visualization for high-dimensional data mining. INFORMS J. Comput. 15(2), 208\u2013230 (2003)","journal-title":"INFORMS J. Comput."},{"key":"2_CR75","first-page":"81","volume":"4","author":"S Shankar","year":"2009","unstructured":"Shankar, S.: Utility sentient frequent itemset mining and association rule mining: a literature survey and comparative study. Int. J. Soft Comput. Appl. 4, 81\u201395 (2009)","journal-title":"Int. J. Soft Comput. Appl."},{"key":"2_CR76","unstructured":"Schultz, M., Joachims, T.: Learning a distance metric from relative comparisons. In: Proceedings of Conference Advances in Neural Information Processing Systems (NIPS) (2003)"},{"key":"2_CR77","unstructured":"Schultz, M., Joachims, T.: Learning a distance metric from relative comparisons. In: NIPS, MIT Press (2004)"},{"key":"2_CR78","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21st International Conference on Very Large Data Bases (VLDB), Zurich, Switzerland, 11\u201315 September 1995, pp. 432\u2013444 (1995)"},{"key":"2_CR79","doi-asserted-by":"crossref","unstructured":"Sriphaew, K., Theeramunkong, T.: A new method for finding generalized frequent itemsets in generalized association rule mining. In: Proceedings of the 7th IEEE Symposium on Computers and Communications (ISCC), pp. 1040\u20131045 (2002)","DOI":"10.1109\/ISCC.2002.1021800"},{"key":"2_CR80","unstructured":"Srikant, R., Quoc, V., Agrawal, R.: Mining association rules with item constraints. In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD), pp. 67\u201373 (1997)"},{"key":"2_CR81","first-page":"1453","volume":"6","author":"I Tsochantaridis","year":"2005","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y.: Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res. 6, 1453\u20131484 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR82","doi-asserted-by":"crossref","unstructured":"Tao, F., Murtagh, F.: Weighted association rule mining using weighted support and significance framework. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 661\u2013666 (2003)","DOI":"10.1145\/956750.956836"},{"key":"2_CR83","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB), Mumbai (Bombay), India, 3\u20136 September, pp. 134\u2013145 (1996)"},{"key":"2_CR84","volume-title":"Introduction to Data Mining","author":"PN Tan","year":"2006","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison Wesley, Boston (2006)"},{"key":"2_CR85","unstructured":"Tseng, V.S., Shie, B.-E., Wu, C.-W., Philip, S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, forthcoming"},{"issue":"1","key":"2_CR86","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2009-0354","volume":"13","author":"S Vanderlooy","year":"2009","unstructured":"Vanderlooy, S., Sprinkhuizen-Kuyper, I.G., Smirnov, E.N., Jaap van den Herik, H.: The ROC isometrics approach to construct reliable classifiers. Intell. Data Anal. 13(1), 3\u201337 (2009)","journal-title":"Intell. Data Anal."},{"key":"2_CR87","unstructured":"Wagstaff, K., Basu, S., Davidson, I.: When is constrained clustering beneficial, and why? In: Proceedings of The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference (AAAI) (2006)"},{"key":"2_CR88","unstructured":"Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence (AAAI\/IAAI), p. 1097 (2000)"},{"key":"2_CR89","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schr\u00f6dl, S.: Constrained k-means clustering with background knowledge. In: Proceedings of the Eighteenth International Conference on Machine Learning, ICML 2001, pp. 577\u2013584. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"key":"2_CR90","volume-title":"Data Mining, Pratical Machine Learning Tools and Techiniques","author":"IH Witten","year":"2011","unstructured":"Witten, I.H., Frank, E., Hall, M.: Data Mining, Pratical Machine Learning Tools and Techiniques, 3rd edn. Morgan Kaufmann, San Francisco (2011)","edition":"3"},{"issue":"6","key":"2_CR91","doi-asserted-by":"publisher","first-page":"7277","DOI":"10.1016\/j.eswa.2010.12.023","volume":"38","author":"C-M Wu","year":"2011","unstructured":"Wu, C.-M., Huang, Y.-F.: Generalized association rule mining using an efficient data structure. Expert Syst. Appl. 38(6), 7277\u20137290 (2011)","journal-title":"Expert Syst. Appl."},{"key":"2_CR92","series-title":"Machine Learning and Expert Systems","volume-title":"Computer Systems That Learn: Classification and Prediction Methods from Statistics, Neural Nets","author":"SM Weiss","year":"1991","unstructured":"Weiss, S.M., Kulikowski, C.A.: Computer Systems That Learn: Classification and Prediction Methods from Statistics, Neural Nets. Machine Learning and Expert Systems. Morgan Kaufmann, San Francisco (1991)"},{"issue":"19","key":"2_CR93","first-page":"4199","volume":"4","author":"J-T Wei","year":"2010","unstructured":"Wei, J.-T., Lin, S.-Y., Hsin-Hung, W.: A review of the application of RFM model. Afr. J. Bus. Manag. 4(19), 4199\u20134206 (2010)","journal-title":"Afr. J. Bus. Manag."},{"key":"2_CR94","doi-asserted-by":"crossref","unstructured":"Wang, W., Wang, C., Zhu, Y., Shi, B., Pei, J., Yan, X., Han, J.: Graphminer: a structural pattern-mining system for large disk-based graph databases and its applications. In: zcan, F. (ed.) SIGMOD Conference, pp. 879\u2013881. ACM (2005)","DOI":"10.1145\/1066157.1066273"},{"key":"2_CR95","doi-asserted-by":"crossref","unstructured":"Wang, W., Yang, J., Philip, S.: Efficient mining of weighted association rules (WAR). In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 270\u2013274 (2000)","DOI":"10.1145\/347090.347149"},{"key":"2_CR96","doi-asserted-by":"crossref","unstructured":"Yan, W., Goebel, K.F.: Designing classifier ensembles with constrained performance requirements. In: Proceedings of SPIE Defense and Security Symposium, Multisensor Multisource Information Fusion: Architectures, Algorithms, and Applications 2004, pp. 78\u201387 (2004)","DOI":"10.1117\/12.542616"},{"key":"2_CR97","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002, p. 721. IEEE Computer Society, Washington, DC, USA (2002)"},{"key":"2_CR98","doi-asserted-by":"crossref","unstructured":"Yun, U., Leggett, J.J.: WFIM: weighted frequent itemset mining with a weight range and a minimum weight. In: Proceeding of the 2005 SIAM International Data Mining Conference, Newport Beach, CA, pp. 636\u2013640 (2005)","DOI":"10.1137\/1.9781611972757.76"},{"issue":"1","key":"2_CR99","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.knosys.2010.07.007","volume":"24","author":"U Yun","year":"2011","unstructured":"Yun, U., HoRyu, K.: Approximate weighted frequent pattern mining with\/without noisy environments. Knowl.-Based Syst. 24(1), 73\u201382 (2011)","journal-title":"Knowl.-Based Syst."},{"key":"2_CR100","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.knosys.2012.02.002","volume":"33","author":"U Yun","year":"2012","unstructured":"Yun, U., Shin, H., Ho Ryu, K., Yoon, E.: An efficient mining algorithm for maximal weighted frequent patterns in transactional databases. Knowl.-Based Syst. 33, 53\u201364 (2012)","journal-title":"Knowl.-Based Syst."},{"issue":"1\/2","key":"2_CR101","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42(1\/2), 31\u201360 (2001)","journal-title":"Mach. Learn."},{"key":"2_CR102","doi-asserted-by":"crossref","unstructured":"Zhong, S., Ghosh, J.: Scalable, balanced model-based clustering. In: Proceedings of the Third SIAM International Conference on Data Mining, San Francisco (SDM) (2003)","DOI":"10.1137\/1.9781611972733.7"},{"key":"2_CR103","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD 1997), Newport Beach, California, USA, 14\u201317 August, pp. 283\u2013286 (1997)"},{"issue":"2","key":"2_CR104","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. SIGMOD Rec. 25(2), 103\u2013114 (1996)","journal-title":"SIGMOD Rec."},{"key":"2_CR105","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-46027-6","volume-title":"Association Rule Mining: Models and Algorithms","author":"C Zhang","year":"2002","unstructured":"Zhang, C., Zhang, S.: Association Rule Mining: Models and Algorithms. LNCS, vol. 2307. Springer, Heidelberg (2002)"},{"key":"2_CR106","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, L., Nie, G., Shi, Y.: A survey of interestingness measures for association rules. In: Proceedings of the Second International Conference on Business Intelligence and Financial Engineering (BIFE), pp. 460\u2013463 (2009)","DOI":"10.1109\/BIFE.2009.110"}],"container-title":["Lecture Notes in Computer Science","Data Mining and Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50137-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T01:09:01Z","timestamp":1749776941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50137-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501369","9783319501376"],"references-count":106,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50137-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"3 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}