monks-problems-2 (Q6033093)

**Author**: Sebastian Thrun (Carnegie Mellon University) \N**Source**: [UCI](https://archive.ics.uci.edu/ml/datasets/MONK's+Problems) - October 1992 \N**Please cite**: [UCI](https://archive.ics.uci.edu/ml/citation_policy.html) \N\N**The Monk's Problems: Problem 2** \NOnce upon a time, in July 1991, the monks of Corsendonk Priory were faced with a school held in their priory, namely the 2nd European Summer School on Machine Learning. After listening more than one week to a wide variety of learning algorithms, they felt rather confused: Which algorithm would be optimal? And which one to avoid? As a consequence of this dilemma, they created a simple task on which all learning algorithms ought to be compared: the three MONK's problems.\N\NThe target concept associated with the 2nd Monk's problem is the binary outcome of the logical formula: \NMONK-2: EXACTLY TWO of {a1 = 1, a2 = 1, a3 = 1, a4 = 1, a5 = 1, a6 = 1}\N\NIn this dataset, the original train and test sets were merged to allow other sampling procedures. However, the original train-test splits can be found as one of the OpenML tasks. \N\N### Attribute information: \N* attr1: 1, 2, 3 \N* attr2: 1, 2, 3 \N* attr3: 1, 2 \N* attr4: 1, 2, 3 \N* attr5: 1, 2, 3, 4 \N* attr6: 1, 2 \N\N### Relevant papers \NThe MONK's Problems - A Performance Comparison of Different Learning Algorithms, by S.B. Thrun, J. Bala, E. Bloedorn, I. Bratko, B. Cestnik, J. Cheng, K. De Jong, S. Dzeroski, S.E. Fahlman, D. Fisher, R. Hamann, K. Kaufman, S. Keller, I. Kononenko, J. Kreuziger, R.S. Michalski, T. Mitchell, P. Pachowicz, Y. Reich H. Vafaie, W. Van de Welde, W. Wenzel, J. Wnek, and J. Zhang. Technical Report CS-CMU-91-197, Carnegie Mellon University, Dec. 1991.