{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:18:51Z","timestamp":1740374331523,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":163,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144660"},{"type":"electronic","value":"9783642144677"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14467-7_13","type":"book-chapter","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T06:53:52Z","timestamp":1280213632000},"page":"236-338","source":"Crossref","is-referenced-by-count":5,"title":["On the Relation between Jumping Emerging Patterns and Rough Set Theory with Application to Data Classification"],"prefix":"10.1007","author":[{"given":"Pawe\u0131","family":"Terlecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Data mining: Concepts and Techniques","author":"J. Han","year":"2006","unstructured":"Han, J., Kamber, M.: Data mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2006)","edition":"2"},{"key":"13_CR2","first-page":"487","volume-title":"VLDB","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"13_CR3","first-page":"259","volume-title":"KDD","author":"E. Suzuki","year":"1997","unstructured":"Suzuki, E.: Autonomous discovery of reliable exception rules. In: KDD, Newport Beach, CA, USA, pp. 259\u2013262. ACM, New York (1997)"},{"key":"13_CR4","first-page":"80","volume-title":"KDD","author":"B. Liu","year":"1998","unstructured":"Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: KDD, pp. 80\u201386. AAAI Press, New York (1998)"},{"key":"13_CR5","first-page":"369","volume-title":"ICDM","author":"W. Li","year":"2001","unstructured":"Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient classification based on multiple class-association rules. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) ICDM, pp. 369\u2013376. IEEE Computer Society, Los Alamitos (2001)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/1042046.1042048","volume":"29","author":"E. Baralis","year":"2004","unstructured":"Baralis, E., Chiusano, S.: Essential classification rule sets. ACM Trans. Database Syst.\u00a029, 635\u2013674 (2004)","journal-title":"ACM Trans. Database Syst."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/312129.312191","volume-title":"KDD","author":"G. Dong","year":"1999","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: KDD, San Diego, CA, United States, pp. 43\u201352. ACM Press, New York (1999)"},{"key":"13_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-46846-3_4","volume-title":"Discovery Science","author":"G. Dong","year":"1999","unstructured":"Dong, G., Zhang, X., Wong, L., Li, J.: CAEP: Classification by aggregating emerging patterns. In: Arikawa, S., Furukawa, K. (eds.) DS 1999. LNCS (LNAI), vol.\u00a01721, pp. 30\u201342. Springer, Heidelberg (1999)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Bailey, J., Manoukian, T., Ramamohanarao, K.: Classification using constrained emerging patterns. In: [153], pp. 226\u2013237","DOI":"10.1007\/978-3-540-45160-0_22"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Fan, H., Ramamohanarao, K.: Efficiently mining interesting emerging patterns. In: [153], pp. 189\u2013201","DOI":"10.1007\/978-3-540-45160-0_19"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/PL00011662","volume":"3","author":"J. Li","year":"2001","unstructured":"Li, J., Dong, G., Ramamohanarao, K.: Making use of the most expressive jumping emerging patterns for classification. Knowl. Inf. Syst.\u00a03, 131\u2013145 (2001)","journal-title":"Knowl. Inf. Syst."},{"key":"13_CR12","first-page":"3","volume-title":"Genome Informatics Workshop","author":"J. Li","year":"2001","unstructured":"Li, J., Wong, L.: Emerging patterns and gene expression data. In: Genome Informatics Workshop, Tokyo, Japan, vol.\u00a012, pp. 3\u201313. Imperial College Press, London (2001)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1093\/bioinformatics\/18.5.725","volume":"18","author":"J. Li","year":"2002","unstructured":"Li, J., Wong, L.: Identifying good diagnostic gene groups from gene expression profiles using the concept of emerging patterns. Bioinformatics\u00a018, 725\u2013734 (2002)","journal-title":"Bioinformatics"},{"key":"13_CR14","unstructured":"Yu, L.T.H., lai Chung, F., Chan, S.C.F., Yuen, S.M.C.: Using emerging pattern based projected clustering and gene expression data for cancer detection. In: Conference on Asia-Pacific bioinformatics, Dunedin, New Zealand, pp. 75\u201384. Australian Computer Society, Inc. (2004)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/11539087_128","volume-title":"Advances in Natural Computation","author":"H.S. Yoon","year":"2005","unstructured":"Yoon, H.S., Lee, S.H., Kim, J.H.: Application of emerging patterns for multi-source bio-data classification and analysis. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol.\u00a03610, pp. 965\u2013974. Springer, Heidelberg (2005)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences\u00a011, 341\u2013356 (1982)","journal-title":"International Journal of Computer and Information Sciences"},{"key":"13_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04997-6","volume-title":"Incomplete Information: Structure, Inference, Complexity","author":"S.P. Demri","year":"2002","unstructured":"Demri, S.P., Orlowska, E.S.: Incomplete Information: Structure, Inference, Complexity. Springer, New York (2002)"},{"key":"13_CR18","first-page":"417","volume":"64","author":"A. Skowron","year":"2004","unstructured":"Skowron, A.: Rough sets and vague concepts. Fundam. Inf.\u00a064, 417\u2013431 (2004)","journal-title":"Fundam. Inf."},{"key":"13_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-1776-8","volume-title":"Rough Sets: Mathematical Foundations","author":"L. Polkowski","year":"2002","unstructured":"Polkowski, L.: Rough Sets: Mathematical Foundations. Physica-Verlag, Heidelberg (2002)"},{"key":"13_CR20","unstructured":"Skowron, A., Suraj, Z.: Discovery of concurrent data models from experimental tables: A rough set approach. In: KDD, pp. 288\u2013293 (1995)"},{"key":"13_CR21","volume-title":"Rough Sets: Theoretical Aspects of Reasoning about Data","author":"Z. Pawlak","year":"1992","unstructured":"Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1111\/j.1467-8640.1995.tb00029.x","volume":"11","author":"Z. Pawlak","year":"1995","unstructured":"Pawlak, Z.: Vagueness and uncertainty: A rough set perspective. Computational Intelligence\u00a011, 232\u2013277 (1995)","journal-title":"Computational Intelligence"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","volume":"177","author":"Z. Pawlak","year":"2007","unstructured":"Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences\u00a0177, 3\u201327 (2007)","journal-title":"Information Sciences"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ins.2006.06.006","volume":"177","author":"Z. Pawlak","year":"2007","unstructured":"Pawlak, Z., Skowron, A.: Rough sets: Some extensions. Information Sciences\u00a0177, 28\u201340 (2007)","journal-title":"Information Sciences"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Ziarko, W.: Probabilistic rough sets. In: [154], pp. 283\u2013293","DOI":"10.1007\/11548669_30"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ijar.2007.05.019","volume":"49","author":"Y. Yao","year":"2008","unstructured":"Yao, Y.: Probabilistic rough set approximations. Int. J. Approx. Reasoning\u00a049, 255\u2013271 (2008)","journal-title":"Int. J. Approx. Reasoning"},{"key":"13_CR27","unstructured":"Skowron, A., Grzymala-Busse, J.: From rough set theory to evidence theory, pp. 193\u2013236 (1994)"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0020-0255(97)10045-7","volume":"110","author":"P. Lingras","year":"1998","unstructured":"Lingras, P.: Comparison of neofuzzy and rough neural networks. Information Sciences\u00a0110, 207\u2013215 (1998)","journal-title":"Information Sciences"},{"volume-title":"Data mining, rough sets and granular computing","year":"2002","key":"13_CR29","unstructured":"Lin, T.Y., Yao, Y.Y., Zadeh, L.A. (eds.): Data mining, rough sets and granular computing. Physica-Verlag, Heidelberg (2002)"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-27778-1_15","volume-title":"Transactions on Rough Sets II","author":"Y. Yao","year":"2004","unstructured":"Yao, Y.: Semantics of fuzzy sets in rough set theory. In: Peters, J.F., Skowron, A., Dubois, D., Grzyma\u0142a-Busse, J.W., Inuiguchi, M., Polkowski, L. (eds.) Transactions on Rough Sets II. LNCS, vol.\u00a03135, pp. 297\u2013318. Springer, Heidelberg (2004)"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1006\/ijhc.1983.0315","volume":"51","author":"Z. Pawlak","year":"1999","unstructured":"Pawlak, Z.: Rough classification. Int. J. Hum.-Comput. Stud.\u00a051, 369\u2013383 (1999)","journal-title":"Int. J. Hum.-Comput. Stud."},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Bazan, J.G., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough set algorithms in classification problem, pp. 49\u201388 (2000)","DOI":"10.1007\/978-3-7908-1840-6_3"},{"key":"13_CR33","first-page":"329","volume":"6","author":"J. Stefanowski","year":"2007","unstructured":"Stefanowski, J.: On combined classifiers, rule induction and rough sets. T. Rough Sets\u00a06, 329\u2013350 (2007)","journal-title":"T. Rough Sets"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Wojna, A.: Analogy-based reasoning in classifier construction. PhD thesis, University of Warsaw, Institute of Mathematics, Computer Science and Mechanics (2004)","DOI":"10.1007\/11574798_11"},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/S0167-8655(02)00196-4","volume":"24","author":"R.W. Swiniarski","year":"2003","unstructured":"Swiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recogn. Lett.\u00a024, 833\u2013849 (2003)","journal-title":"Pattern Recogn. Lett."},{"key":"13_CR36","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1016\/j.patrec.2004.09.044","volume":"26","author":"R.B. Bhatt","year":"2005","unstructured":"Bhatt, R.B., Gopal, M.: On fuzzy-rough sets approach to feature selection. Pattern Recogn. Lett.\u00a026, 965\u2013975 (2005)","journal-title":"Pattern Recogn. Lett."},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-58495-1_35","volume-title":"Methodologies for Intelligent Systems","author":"J.G. Bazan","year":"1994","unstructured":"Bazan, J.G., Skowron, A., Synak, P.: Dynamic reducts as a tool for extracting laws from decisions tables. In: Ra\u015b, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol.\u00a0869, pp. 346\u2013355. Springer, Heidelberg (1994)"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Hirano, S., Tsumoto, S.: Hierarchical clustering of non-euclidean relational data using indiscernibility-level. In: [155], pp. 332\u2013339","DOI":"10.1007\/978-3-540-79721-0_47"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Lingras, P., Chen, M., Miao, D.: Precision of rough set clustering. In: [156], pp. 369\u2013378","DOI":"10.1007\/978-3-540-88425-5_38"},{"key":"13_CR40","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0888-613X(96)00074-6","volume":"15","author":"M.R. Chmielewski","year":"1996","unstructured":"Chmielewski, M.R., Grzymala-Busse, J.W.: Global discretization of continuous attributes as preprocessing for machine learning. Int. J. Approx. Reasoning\u00a015, 319\u2013331 (1996)","journal-title":"Int. J. Approx. Reasoning"},{"key":"13_CR41","doi-asserted-by":"crossref","unstructured":"Nguyen, H.S.: Discretization problem for rough sets methods. In: [157], pp. 545\u2013552","DOI":"10.1007\/3-540-69115-4_75"},{"key":"13_CR42","first-page":"241","volume":"59","author":"A. Skowron","year":"2004","unstructured":"Skowron, A., Synak, P.: Reasoning in information maps. Fundamenta Informaticae\u00a059, 241\u2013259 (2004)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR43","doi-asserted-by":"crossref","unstructured":"Skowron, A., Synak, P.: Hierarchical information maps. In: [154], pp. 622\u2013631","DOI":"10.1007\/11548669_64"},{"key":"13_CR44","unstructured":"Slezak, D.: Approximate reducts in decision tables. In: International Conference, Information Processing and Management of Uncertainty in Knowledge-Based Systems, Granada, Spain, vol.\u00a03, pp. 1159\u20131164 (1996)"},{"key":"13_CR45","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-48061-7_18","volume-title":"New Directions in Rough Sets, Data Mining, and Granular-Soft Computing","author":"H.S. Nguyen","year":"1999","unstructured":"Nguyen, H.S., Slezak, D.: Approximate reducts and association rules - correspondence and complexity results. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol.\u00a01711, pp. 137\u2013145. Springer, Heidelberg (1999)"},{"key":"13_CR46","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11425274_37","volume-title":"Foundations of Intelligent Systems","author":"D. Slezak","year":"2005","unstructured":"Slezak, D.: Association reducts: A framework for mining multi-attribute dependencies. In: Hacid, M.-S., Murray, N.V., Ra\u015b, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol.\u00a03488, pp. 354\u2013363. Springer, Heidelberg (2005)"},{"key":"13_CR47","doi-asserted-by":"crossref","unstructured":"Slezak, D.: Association reducts: Complexity and heuristics. In: [158], pp. 157\u2013164","DOI":"10.1007\/11908029_18"},{"key":"13_CR48","first-page":"365","volume":"53","author":"D. Slezak","year":"2002","unstructured":"Slezak, D.: Approximate entropy reducts. Fundam. Inf.\u00a053, 365\u2013390 (2002)","journal-title":"Fundam. Inf."},{"key":"13_CR49","doi-asserted-by":"crossref","unstructured":"Grzymala-Busse, J.W., Ziarko, W.: Data mining based on rough sets, pp. 142\u2013173 (2003)","DOI":"10.4018\/978-1-59140-051-6.ch006"},{"key":"13_CR50","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10115-004-0178-1","volume":"8","author":"G. Dong","year":"2005","unstructured":"Dong, G., Li, J.: Mining border descriptions of emerging patterns from dataset pairs. Knowledge Information Systems\u00a08, 178\u2013202 (2005)","journal-title":"Knowledge Information Systems"},{"key":"13_CR51","first-page":"485","volume-title":"ICDM","author":"J. Bailey","year":"2003","unstructured":"Bailey, J., Manoukian, T., Ramamohanarao, K.: A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In: ICDM, pp. 485\u2013488. IEEE Computer Society, Los Alamitos (2003)"},{"key":"13_CR52","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1145\/1281192.1281240","volume-title":"KDD","author":"J. Li","year":"2007","unstructured":"Li, J., Liu, G., Wong, L.: Mining statistically important equivalence classes and delta-discriminative emerging patterns. In: Berkhin, P., Caruana, R., Wu, X. (eds.) KDD, pp. 430\u2013439. ACM, New York (2007)"},{"key":"13_CR53","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/1150402.1150438","volume-title":"KDD","author":"E. Loekito","year":"2006","unstructured":"Loekito, E., Bailey, J.: Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams. In: Eliassi-Rad, T., Ungar, L.H., Craven, M., Gunopulos, D. (eds.) KDD, pp. 307\u2013316. ACM, New York (2006)"},{"key":"13_CR54","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TKDE.2006.95","volume":"18","author":"H. Fan","year":"2006","unstructured":"Fan, H., Ramamohanarao, K.: Fast discovery and the generalization of strong jumping emerging patterns for building compact and accurate classifiers. IEEE Trans. on Knowl. and Data Eng.\u00a018, 721\u2013737 (2006)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"13_CR55","doi-asserted-by":"crossref","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Intelligent Decision Support. Handbook of Applications and Advances of of the Rough Sets Theory, pp. 331\u2013362 (1992)","DOI":"10.1007\/978-94-015-7975-9_21"},{"key":"13_CR56","unstructured":"Kryszkiewicz, M.: Algorithms for knowledge reduction in information systems. PhD thesis, Warsaw University of Technology, Institute of Computer Science (1994) (in Polish)"},{"key":"13_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-27794-1_5","volume-title":"Transactions on Rough Sets I","author":"M. Kryszkiewicz","year":"2004","unstructured":"Kryszkiewicz, M., Cichon, K.: Towards scalable algorithms for discovering rough set reducts. In: Peters, J.F., Skowron, A., Grzyma\u0142a-Busse, J.W., Kostek, B.z., \u015awiniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol.\u00a03100, pp. 120\u2013143. Springer, Heidelberg (2004)"},{"key":"13_CR58","first-page":"211","volume-title":"ICDM","author":"J. Han","year":"2002","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: ICDM, pp. 211\u2013218. IEEE Computer Society, Los Alamitos (2002)"},{"key":"13_CR59","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J. Wang","year":"2005","unstructured":"Wang, J., Lu, Y., Tzvetkov, P.: Tfp: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans. on Knowl. and Data Eng.\u00a017, 652\u2013664 (2005)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"13_CR60","first-page":"39","volume-title":"ICISIP","author":"K. Ramamohanarao","year":"2005","unstructured":"Ramamohanarao, K., Bailey, J., Fan, H.: Efficient mining of contrast patterns and their applications to classification. In: ICISIP, pp. 39\u201347. IEEE Computer Society, Washington (2005)"},{"key":"13_CR61","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"22","author":"X. Wu","year":"2004","unstructured":"Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Trans. Inf. Syst.\u00a022, 381\u2013405 (2004)","journal-title":"ACM Trans. Inf. Syst."},{"key":"13_CR62","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-30116-5_6","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"M.L. Antonie","year":"2004","unstructured":"Antonie, M.L., Za\u00efane, O.R.: Mining positive and negative association rules: An approach for confined rules. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 27\u201338. Springer, Heidelberg (2004)"},{"key":"13_CR63","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/347090.347103","volume-title":"KDD","author":"B. Padmanabhan","year":"2000","unstructured":"Padmanabhan, B., Tuzhilin, A.: Small is beautiful: discovering the minimal set of unexpected patterns. In: KDD, Boston, Massachusetts, United States, pp. 54\u201363. ACM, New York (2000)"},{"key":"13_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-45571-X_11","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"F. Hussain","year":"2000","unstructured":"Hussain, F., Liu, H., Suzuki, E., Lu, H.: Exception rule mining with a relative interestingness measure. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 86\u201397. Springer, Heidelberg (2000)"},{"key":"13_CR65","doi-asserted-by":"publisher","first-page":"2730","DOI":"10.1162\/neco.2006.18.11.2730","volume":"18","author":"Y. Li","year":"2006","unstructured":"Li, Y., Guan, C.: An extended EM algorithm for joint feature extraction and classification in brain-computer interfaces. Neural Comput.\u00a018, 2730\u20132761 (2006)","journal-title":"Neural Comput."},{"key":"13_CR66","doi-asserted-by":"publisher","first-page":"2664","DOI":"10.1109\/36.975001","volume":"39","author":"Q. Jackson","year":"2001","unstructured":"Jackson, Q., Landgrebe, D.: An adaptive classifier design for high-dimensional data analysis with a limited training data set. IEEE Transactions on Geoscience and Remote Sensing\u00a039, 2664\u20132679 (2001)","journal-title":"IEEE Transactions on Geoscience and Remote Sensing"},{"key":"13_CR67","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11941439_33","volume-title":"AI 2006: Advances in Artificial Intelligence","author":"X. Qian","year":"2006","unstructured":"Qian, X., Bailey, J., Leckie, C.: Mining generalised emerging patterns. In: Sattar, A., Kang, B.-H. (eds.) AI 2006. LNCS (LNAI), vol.\u00a04304, pp. 295\u2013304. Springer, Heidelberg (2006)"},{"key":"13_CR68","volume-title":"SDM","author":"R.M.H. Ting","year":"2006","unstructured":"Ting, R.M.H., Bailey, J.: Mining minimal contrast subgraph patterns. In: Ghosh, J., Lambert, D., Skillicorn, D.B., Srivastava, J. (eds.) SDM. SIAM, Philadelphia (2006)"},{"key":"13_CR69","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74976-9_10","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"A. Dominik","year":"2007","unstructured":"Dominik, A., Walczak, Z., Wojciechowski, J.: Classification of web documents using a graph-based model and structural patterns. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol.\u00a04702, pp. 67\u201378. Springer, Heidelberg (2007)"},{"key":"13_CR70","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: [159], pp. 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"13_CR71","unstructured":"Wroblewski, J.: Adaptive methods of object classification. PhD thesis, University of Warsaw, Institute of Mathematics, Computer Science and Mechanics (2001)"},{"key":"13_CR72","unstructured":"Wroblewski, J.: Finding minimal reducts using genetic algorithm. In: Joint Conference on Information Sciences, Wrightsville Beach, NC, pp. 186\u2013189 (1995)"},{"key":"13_CR73","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-45554-X_12","volume-title":"Rough Sets and Current Trends in Computing","author":"J.G. Bazan","year":"2001","unstructured":"Bazan, J.G., Szczuka, M.S.: Rses and rseslib - a collection of tools for rough set computations. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol.\u00a02005, pp. 106\u2013113. Springer, Heidelberg (2001)"},{"key":"13_CR74","unstructured":"Bazan, J.G.: Approximation inferencing methods for synthesis of decision algorithms. PhD thesis, University of Warsaw, Institute of Mathematics, Computer Science and Mechanics (1998) (in Polish)"},{"key":"13_CR75","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/3-540-47887-6_45","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Fan","year":"2002","unstructured":"Fan, H., Ramamohanarao, K.: An efficient single-scan algorithm for mining essential jumping emerging patterns for classification. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 456\u2013462. Springer, Heidelberg (2002)"},{"key":"13_CR76","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-72530-5_43","volume-title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","author":"P. Terlecki","year":"2007","unstructured":"Terlecki, P., Walczak, K.: Jumping emerging pattern induction by means of graph coloring and local reducts in transaction databases. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds.) RSFDGrC 2007. LNCS (LNAI), vol.\u00a04482, pp. 363\u2013370. Springer, Heidelberg (2007)"},{"key":"13_CR77","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/978-3-540-68125-0_69","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P. Terlecki","year":"2008","unstructured":"Terlecki, P., Walczak, K.: Local projection in jumping emerging patterns discovery in transaction databases. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 723\u2013730. Springer, Heidelberg (2008)"},{"key":"13_CR78","doi-asserted-by":"publisher","first-page":"5675","DOI":"10.1016\/j.ins.2007.07.018","volume":"177","author":"P. Terlecki","year":"2007","unstructured":"Terlecki, P., Walczak, K.: Jumping emerging patterns with negation in transaction databases - classification and discovery. Information Sciences\u00a0177, 5675\u20135690 (2007)","journal-title":"Information Sciences"},{"key":"13_CR79","first-page":"551","volume-title":"ICML","author":"J. Li","year":"2000","unstructured":"Li, J., Ramamohanarao, K., Dong, G.: The space of jumping emerging patterns and its incremental maintenance algorithms. In: Langley, P. (ed.) ICML, pp. 551\u2013558. Morgan Kaufmann, San Francisco (2000)"},{"key":"13_CR80","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2004.12.014","volume":"335","author":"L. Wang","year":"2005","unstructured":"Wang, L., Zhao, H., Dong, G., Li, J.: On the complexity of finding emerging patterns. Theor. Comput. Sci.\u00a0335, 15\u201327 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR81","first-page":"1","volume-title":"SIGMOD, Dallas, Texas, United States","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD, Dallas, Texas, United States, pp. 1\u201312. ACM, New York (2000)"},{"key":"13_CR82","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society, USA (1967)","edition":"3"},{"key":"13_CR83","doi-asserted-by":"crossref","unstructured":"Romanski, S.: Operations on families of sets for exhaustive search, given a monotonic function. In: JCDKB, Jerusalem, Israel, pp. 310\u2013322 (1988)","DOI":"10.1016\/B978-1-4832-1313-2.50030-5"},{"key":"13_CR84","unstructured":"Romanski, S.: An Algorithm Searching for the Minima of Monotonic Boolean Function and its Applications. PhD thesis, Warsaw University of Technology (1989)"},{"key":"13_CR85","doi-asserted-by":"crossref","unstructured":"Liu, B., Ma, Y., Wong, C.K.: Improving an association rule based classifier. In: [159], pp. 504\u2013509","DOI":"10.1007\/3-540-45372-5_58"},{"key":"13_CR86","unstructured":"Li, W.: Classification based on multiple association rules (2001)"},{"key":"13_CR87","first-page":"559","volume":"9","author":"G.C. Garriga","year":"2008","unstructured":"Garriga, G.C., Kralj, P., Lavra\u010d, N.: Closed sets for labeled data. J. Mach. Learn. Res.\u00a09, 559\u2013580 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"13_CR88","first-page":"85","volume-title":"SIGMOD, Seattle, Washington, United States","author":"R.J. Bayardo Jr.","year":"1998","unstructured":"Bayardo Jr., R.J.: Efficiently mining long patterns from databases. In: SIGMOD, Seattle, Washington, United States, pp. 85\u201393. ACM, New York (1998)"},{"key":"13_CR89","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/312129.312222","volume-title":"KDD","author":"D. Meretakis","year":"1999","unstructured":"Meretakis, D., W\u00fcthrich, B.: Extending na\u00efve bayes classifiers using long itemsets. In: KDD, San Diego, California, United States, pp. 165\u2013174. ACM, New York (1999)"},{"key":"13_CR90","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1007\/978-3-540-30549-1_102","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"Z. Wang","year":"2004","unstructured":"Wang, Z., Fan, H., Ramamohanarao, K.: Exploiting maximal emerging patterns for classification. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol.\u00a03339, pp. 1062\u20131068. Springer, Heidelberg (2004)"},{"key":"13_CR91","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-31841-5_10","volume-title":"Knowledge Discovery in Inductive Databases","author":"A. Soulet","year":"2005","unstructured":"Soulet, A., Cr\u00e9milleux, B., Rioult, F.: Condensed representation of eps and patterns quantified by frequency-based measures. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol.\u00a03377, pp. 173\u2013189. Springer, Heidelberg (2005)"},{"key":"13_CR92","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-75549-4_14","volume-title":"Knowledge Discovery in Inductive Databases","author":"A. Soulet","year":"2007","unstructured":"Soulet, A., Kl\u00e9ma, J., Cr\u00e9milleux, B.: Efficient mining under rich constraints derived from various datasets. In: D\u017eeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, vol.\u00a04747, pp. 223\u2013239. Springer, Heidelberg (2007)"},{"key":"13_CR93","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-45681-3_4","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J. Bailey","year":"2002","unstructured":"Bailey, J., Manoukian, T., Ramamohanarao, K.: Fast algorithms for mining emerging patterns. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 39\u201350. Springer, Heidelberg (2002)"},{"key":"13_CR94","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explorations Newsletter\u00a02, 66\u201375 (2000)","journal-title":"SIGKDD Explorations Newsletter"},{"key":"13_CR95","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"13_CR96","unstructured":"Li, J.: Mining Emerging Patterns to Contruct Accurate and Efficient Classifiers. PhD thesis, University of Melbourne (2001)"},{"key":"13_CR97","unstructured":"Li, J., Dong, G., Ramamohanarao, K.: Instance-based classification by emerging patterns. In: [159], pp. 191\u2013200"},{"key":"13_CR98","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/B:MACH.0000011804.08528.7d","volume":"54","author":"J. Li","year":"2004","unstructured":"Li, J., Dong, G., Ramamohanarao, K., Wong, L.: DeEPs: A new instance-based lazy discovery and classification system. Mach. Learn.\u00a054, 99\u2013124 (2004)","journal-title":"Mach. Learn."},{"key":"13_CR99","unstructured":"Fan, H.: Efficient Mining of Interesting Emerging Patterns and Their Effective Use in Classification. PhD thesis, University of Melbourne (2004)"},{"key":"13_CR100","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033043","volume-title":"Graph Theory","author":"R. Merris","year":"2000","unstructured":"Merris, R.: Graph Theory. Wiley Interscience, New York (2000)"},{"key":"13_CR101","volume-title":"Hypergraphs","author":"C. Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs, vol.\u00a045. Elsevier, Amsterdam (1989)"},{"key":"13_CR102","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-48318-7_8","volume-title":"Algorithm Engineering","author":"D.J. Kavvadias","year":"1999","unstructured":"Kavvadias, D.J., Stavropoulos, E.C.: Evaluation of an algorithm for the transversal hypergraph problem. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol.\u00a01668, pp. 72\u201384. Springer, Heidelberg (1999)"},{"key":"13_CR103","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/j.dam.2007.05.030","volume":"156","author":"K.M. Elbassioni","year":"2008","unstructured":"Elbassioni, K.M.: On the complexity of monotone dualization and generating minimal hypergraph transversals. Discrete Appl. Math.\u00a0156, 2109\u20132123 (2008)","journal-title":"Discrete Appl. Math."},{"key":"13_CR104","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"13_CR105","unstructured":"Aloul, F.A., Mneimneh, M.N., Sakallah, K.A.: Zbdd-based backtrack search sat solver. In: IWLS, pp. 131\u2013136 (2002)"},{"key":"13_CR106","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1303-8","volume-title":"Binary decision diagrams and applications for VLSI CAD","author":"S. ichi Minato","year":"1996","unstructured":"ichi Minato, S.: Binary decision diagrams and applications for VLSI CAD. Kluwer Academic Publishers, Norwell (1996)"},{"key":"13_CR107","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1109\/TC.1977.1674912","volume":"26","author":"E. Cerny","year":"1977","unstructured":"Cerny, E., Marin, M.A.: An approach to unified methodology of combinational switching circuits. IEEE Transactions on Computers\u00a026, 745\u2013756 (1977)","journal-title":"IEEE Transactions on Computers"},{"key":"13_CR108","first-page":"272","volume-title":"DAC","author":"S. ichi Minato","year":"1993","unstructured":"ichi Minato, S.: Zero-suppressed bdds for set manipulation in combinatorial problems. In: DAC, pp. 272\u2013277. ACM, New York (1993)"},{"key":"13_CR109","unstructured":"Mishchenko, A.: An introduction to zero-suppressed binary decision diagrams, Tutorial (2001)"},{"key":"13_CR110","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Transactions on Information Theory\u00a013, 21\u201327 (1967)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR111","volume-title":"The complexity of Boolean functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The complexity of Boolean functions. John Wiley & Sons, Inc., New York (1987)"},{"key":"13_CR112","unstructured":"Cykier, A.: Prime implicants of boolean functions, methods for finding and application (1997) (in polish)"},{"key":"13_CR113","unstructured":"Kryszkiewicz, M.: Fast algorithm finding reducts of monotonic boolean functions. ICS Research Report 42\/93 (1993)"},{"key":"13_CR114","unstructured":"Anderson, M.: Synthesis of Information Systems. Warsaw University of Technology (1994) (in Polish)"},{"key":"13_CR115","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2078-5","volume-title":"Boolean Reasoning","author":"F.M. Brown","year":"1990","unstructured":"Brown, F.M.: Boolean Reasoning. Kluwer Academic Publishers, Dordrecht (1990)"},{"key":"13_CR116","volume-title":"Integer programming","author":"R. Garfinkel","year":"1978","unstructured":"Garfinkel, R., Nemhauser, G.L.: Integer programming. John Wiley & Sons, New York (1978)"},{"key":"13_CR117","doi-asserted-by":"crossref","unstructured":"Susmaga, R.: Parallel computation of reducts. In: [157], pp. 450\u2013457","DOI":"10.1007\/3-540-69115-4_62"},{"key":"13_CR118","unstructured":"Zhou, P.L., Mohammed, S.: A reduct solving parallel algorithm based on relational extension matrix. In: Arabnia, H.R. (ed.) PDPTA, pp. 924\u2013931. CSREA Press (2007)"},{"key":"13_CR119","unstructured":"Bjorvand, A.T., Komorowski, J.: Practical applications of genetic algorithms for efficient reduct computation. In: IMACS"},{"key":"13_CR120","unstructured":"Walczak, Z., Dominik, A., Terlecki, P.: Space decomposition in the minimal reduct problem. In: National Conference on Evolutionary Computation and Global Optimization, Kazimierz Dolny, Poland. Warsaw University of Technology (2004)"},{"key":"13_CR121","unstructured":"Sapiecha, P.: An approximation algorithm for a certain class of np-hard problems. In: ICS Research Report 21\/92 (1992)"},{"key":"13_CR122","doi-asserted-by":"crossref","unstructured":"Wang, X., Yang, J., Peng, N., Teng, X.: Finding minimal rough set reducts with particle swarm optimization. In: [154], pp. 451\u2013460","DOI":"10.1007\/11548669_47"},{"key":"13_CR123","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1016\/j.patrec.2008.02.006","volume":"29","author":"L. Ke","year":"2008","unstructured":"Ke, L., Feng, Z., Ren, Z.: An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recogn. Lett.\u00a029, 1351\u20131357 (2008)","journal-title":"Pattern Recogn. Lett."},{"key":"13_CR124","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/11795131_39","volume-title":"Rough Sets and Knowledge Technology","author":"P. Terlecki","year":"2006","unstructured":"Terlecki, P., Walczak, K.: Attribute set dependence in apriori-like reduct computation. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol.\u00a04062, pp. 268\u2013276. Springer, Heidelberg (2006)"},{"key":"13_CR125","first-page":"118","volume":"2","author":"P. Terlecki","year":"2008","unstructured":"Terlecki, P., Walczak, K.: Attribute set dependence in reduct computation. Transactions on Computational Science\u00a02, 118\u2013132 (2008)","journal-title":"Transactions on Computational Science"},{"key":"13_CR126","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-73451-2_34","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"M. Kryszkiewicz","year":"2007","unstructured":"Kryszkiewicz, M., Lasek, P.: Fast discovery of minimal sets of attributes functionally determining a decision attribute. In: Kryszkiewicz, M., Peters, J.F., Rybi\u0144ski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol.\u00a04585, pp. 320\u2013331. Springer, Heidelberg (2007)"},{"key":"13_CR127","first-page":"76","volume":"9","author":"M. Kryszkiewicz","year":"2008","unstructured":"Kryszkiewicz, M., Lasek, P.: Fun: Fast discovery of minimal sets of attributes functionally determining a decision attribute. T. Rough Sets\u00a09, 76\u201395 (2008)","journal-title":"T. Rough Sets"},{"key":"13_CR128","unstructured":"Bodon, F.: A fast apriori implementation. In: Goethals, B., Zaki, M.J. (eds.) FIMI. CEUR Workshop Proceedings, vol.\u00a090 (2003), CEUR-WS.org"},{"key":"13_CR129","unstructured":"Komorowski, J., Ohrn, A., Skowron, A.: Case studies: Public domain, multiple mining tasks systems: Rosetta rough sets, pp. 554\u2013559 (2002)"},{"key":"13_CR130","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ins.2006.04.002","volume":"177","author":"P. Terlecki","year":"2007","unstructured":"Terlecki, P., Walczak, K.: On the relation between rough set reducts and jumping emerging patterns. Information Sciences\u00a0177, 74\u201383 (2007)","journal-title":"Information Sciences"},{"key":"13_CR131","doi-asserted-by":"crossref","unstructured":"Terlecki, P., Walczak, K.: Local reducts and jumping emerging patterns in relational databases. In: [158], pp. 358\u2013367","DOI":"10.1007\/11908029_38"},{"key":"13_CR132","first-page":"326","volume-title":"International Workshop on Rough Sets and Knowledge Discovery, Banff, Canada","author":"N. Shan","year":"1994","unstructured":"Shan, N., Ziarko, W.: An incremental learning algorithm for constructing decision rules. In: International Workshop on Rough Sets and Knowledge Discovery, Banff, Canada, pp. 326\u2013334. Springer, Heidelberg (1994)"},{"key":"13_CR133","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/253260.253327","volume-title":"SIGMOD","author":"S. Brin","year":"1997","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlations. In: Peckham, J. (ed.) SIGMOD, pp. 265\u2013276. ACM Press, New York (1997)"},{"key":"13_CR134","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-45650-3_8","volume-title":"Discovery Science","author":"I.F. Ruiz","year":"2001","unstructured":"Ruiz, I.F., Balc\u00e1zar, J.L., Bueno, R.M.: Bounding negative information in frequent sets algorithms. In: Jantke, K.P., Shinohara, A. (eds.) DS 2001. LNCS (LNAI), vol.\u00a02226, pp. 50\u201358. Springer, Heidelberg (2001)"},{"key":"13_CR135","first-page":"494","volume-title":"ICDE","author":"A. Savasere","year":"1998","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: Mining for strong negative associations in a large database of customer transactions. In: ICDE, pp. 494\u2013502. IEEE Computer Society, Los Alamitos (1998)"},{"key":"13_CR136","first-page":"623","volume-title":"ISCC","author":"X. Yuan","year":"2002","unstructured":"Yuan, X., Buckles, B.P., Yuan, Z., Zhang, J.: Mining negative association rules. In: ISCC, pp. 623\u2013628. IEEE Computer Society, Los Alamitos (2002)"},{"key":"13_CR137","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.F., Bykowski, A., Jeudy, B.: Towards the tractable discovery of association rules with negations. In: FQAS, Warsaw, Poland, pp. 425\u2013434 (2000)","DOI":"10.1007\/978-3-7908-1834-5_39"},{"key":"13_CR138","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/11430919_77","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2005","unstructured":"Kryszkiewicz, M., Cichon, K.: Support oriented discovery of generalized disjunction-free representation of frequent patterns with negation. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 672\u2013682. Springer, Heidelberg (2005)"},{"key":"13_CR139","volume-title":"Learning systems","author":"P. Cichosz","year":"2000","unstructured":"Cichosz, P.: Learning systems. WNT, Warsaw (2000) (in Polish)"},{"key":"13_CR140","volume-title":"ICCS Workshop","author":"P. Terlecki","year":"2007","unstructured":"Terlecki, P., Walczak, K.: Local table condensation in rough set approach for jumping emerging pattern induction. In: ICCS Workshop. Springer, Sheffield (2007)"},{"key":"13_CR141","doi-asserted-by":"crossref","unstructured":"Terlecki, P., Walczak, K.: Efficient discovery of top-k minimal jumping emerging patterns. In: [156], pp. 438\u2013447","DOI":"10.1007\/978-3-540-88425-5_45"},{"key":"13_CR142","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B\u00a039, 1\u201338 (1977)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"13_CR143","doi-asserted-by":"crossref","unstructured":"Blum, A., Mitchell, T.M.: Combining labeled and unlabeled sata with co-training. In: COLT, pp. 92\u2013100 (1998)","DOI":"10.1145\/279943.279962"},{"key":"13_CR144","doi-asserted-by":"crossref","unstructured":"Terlecki, P., Walczak, K.: Adaptive classification with jumping emerging patterns. In: [155], pp. 39\u201346.","DOI":"10.1007\/978-3-540-79721-0_11"},{"key":"13_CR145","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/11536406_16","volume-title":"Case-Based Reasoning Research and Development","author":"S.J. Delany","year":"2005","unstructured":"Delany, S.J., Cunningham, P., Doyle, D., Zamolotskikh, A.: Generating estimates of classification confidence for a case-based spam filter. In: Mu\u00f1oz-\u00c1vila, H., Ricci, F. (eds.) ICCBR 2005. LNCS (LNAI), vol.\u00a03620, pp. 177\u2013190. Springer, Heidelberg (2005)"},{"key":"13_CR146","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci.\u00a055, 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR147","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.asoc.2007.02.009","volume":"8","author":"S. Dehuri","year":"2008","unstructured":"Dehuri, S., Patnaik, S., Ghosh, A., Mall, R.: Application of elitist multi-objective genetic algorithm for classification rule generation. Appl. Soft Comput.\u00a08, 477\u2013487 (2008)","journal-title":"Appl. Soft Comput."},{"key":"13_CR148","unstructured":"Vailaya, A., Jain, A.K.: Reject option for vq-based bayesian classification, pp. 2048\u20132051 (2000)"},{"key":"13_CR149","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s100440200021","volume":"5","author":"L. Mascarilla","year":"2002","unstructured":"Mascarilla, L., Fr\u00e9licot, C.: Reject strategies driven combination of pattern classifiers. Pattern Anal. Appl.\u00a05, 234\u2013243 (2002)","journal-title":"Pattern Anal. Appl."},{"key":"13_CR150","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:DAMI.0000026901.85057.58","volume":"9","author":"J. Li","year":"2004","unstructured":"Li, J., Manoukian, T., Dong, G., Ramamohanarao, K.: Incremental maintenance on the border of the space of emerging patterns. Data Min. Knowl. Discov.\u00a09, 89\u2013116 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"13_CR151","first-page":"582","volume-title":"ICIAP","author":"G. Fumera","year":"2003","unstructured":"Fumera, G., Pillai, I., Roli, F.: Classification with reject option in text categorisation systems. In: ICIAP, pp. 582\u2013587. IEEE Computer Society, Los Alamitos (2003)"},{"key":"13_CR152","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TIT.1970.1054406","volume":"16","author":"C.K. Chow","year":"1970","unstructured":"Chow, C.K.: On optimum recognition error and reject tradeoff. IEEE Transactions on Information Theory\u00a016, 41\u201346 (1970)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR153","unstructured":"Asuncion, A., Newman, D.: UCI machine learning repository (2007)"},{"key":"13_CR154","unstructured":"Fayyad, U.M., Irani, K.B.: Multi-interval discretization of continuous-valued attributes for classification learning. In: IJCAI, pp. 1022\u20131029 (1993)"},{"key":"13_CR155","doi-asserted-by":"crossref","unstructured":"Kohavi, R., John, G.H., Long, R., Manley, D., Pfleger, K.: Mlc++: A machine learning library in c++. In: ICTAI, New Orleans, Louisiana, USA, pp. 740\u2013743 (1994)","DOI":"10.1109\/TAI.1994.346412"},{"key":"13_CR156","doi-asserted-by":"crossref","unstructured":"Karypsis, G.: Cluto. a clustering toolkit. release 2.0 (2002)","DOI":"10.21236\/ADA439508"},{"key":"13_CR157","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of Advances in Web-Age Information Management, 4th International Conference, WAIM 2003, Chengdu, China","author":"G. Dong","year":"2003","unstructured":"Dong, G., Tang, C., Wang, W.: WAIM 2003. LNCS, vol.\u00a02762. Springer, Heidelberg (2003)"},{"key":"13_CR158","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of Principles of Data Mining and Knowledge Discovery, 4th European Conference, PKDD 2000, Lyon, France","year":"2000","unstructured":"Zighed, D.A., Komorowski, H.J., Zytkow, J.M. (eds.): PKDD 2000. LNCS, vol.\u00a01910. Springer, Heidelberg (2000)"},{"key":"13_CR159","series-title":"Lecture Notes in Computer Science","volume-title":"Rough Sets and Current Trends in Computing, First International Conference, RSCTC\u201998, Warsaw, Poland","year":"1998","unstructured":"Polkowski, L., Skowron, A. (eds.): RSCTC 1998. LNCS, vol.\u00a01424. Springer, Heidelberg (1998)"},{"key":"13_CR160","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","year":"2005","unstructured":"\u015al\u0119zak, D., Wang, G., Szczuka, M.S., D\u00fcntsch, I., Yao, Y. (eds.): RSFDGrC 2005. LNCS (LNAI), vol.\u00a03641. Springer, Heidelberg (2005)"},{"key":"13_CR161","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Rough Sets and Current Trends in Computing","year":"2008","unstructured":"Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.): RSCTC 2008. LNCS (LNAI), vol.\u00a05306. Springer, Heidelberg (2008)"},{"key":"13_CR162","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-79721-0","volume-title":"Rough Sets and Knowledge Technology","author":"G. Wang","year":"2008","unstructured":"Wang, G., Rui Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y.: RSKT 2008. LNCS (LNAI), vol.\u00a05009. Springer, Heidelberg (2008)"},{"key":"13_CR163","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Rough Sets and Current Trends in Computing","year":"2006","unstructured":"Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., S\u0142owi\u0144ski, R. (eds.): RSCTC 2006. LNCS (LNAI), vol.\u00a04259. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14467-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T11:44:23Z","timestamp":1740311063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14467-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144660","9783642144677"],"references-count":163,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14467-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}