How To Draw Rook Knight Vs Rook

Data Set up Characteristics:	Multivariate, Data-Generator	Number of Instances:	N/A	Expanse:	Game
Attribute Characteristics:	Categorical, Integer	Number of Attributes:	22	Appointment Donated	1988-10-03
Associated Tasks:	Classification	Missing Values?	No	Number of Spider web Hits:	84950

Source:

Database originally described by Ross Quinlan.

Donor/Coder:

Jeff Schlimmer (

Jeff.Schlimmer '@' cs.cmu.edu

)

Data Set Information:

The companion file is a Common Lisp demonstration file that generates knight-pin Chess stop-game samples. Start up Lisp and load the file. It generates 100 cease-games and writes them to a dissever file. Look at the end of the file to run across how to change it and so that information technology will produce more end-games, or use the file for output that y'all wish.

The lawmaking is released for experimental, confidential utilize only. Encounter the end of the file for load-fourth dimension commands that generate a file of examples in Quinlan'southward format.

Annotation: this program generates duplicates. In one run, there were most 370 duplicates in the starting time 1000 instances (i.e., 630 distinct examples).

Aspect Information:

Aspect Summaries:
Class: knight's side is lost in n-ply (due north=2, 3, etc)
1. distance from black male monarch to knight: 1, ii, >two
two. altitude from black male monarch to rook: ane, 2, >ii
3. distance from black king to white king: 1, 2, >2
iv. altitude from white king to knight: 1, 2, >2
5. distance from white king to rook: 1, 2, >ii
6. distance from rook to knight (ADDED): 1, 2, >2
7. board relationship of black king and knight (ADDED): diag, rect, other
8. board relationship of blackness king and rook (ADDED): diag, rect, other
9. board relationship of black king and white male monarch (ADDED): diag,rect,other
10. board relationship of white king and knight (ADDED): diag, rect, other
xi. board relationship of white king and rook (ADDED): diag, rect, other
12. board relationship of white rook and knight (ADDED): diag, rect, other
13. blazon of black king's initial square: corner, border, open
fourteen. type of black knight'due south initial square (ADDED): corner, border, open
15. type of white king'due south initial square (ADDED): corner, edge, open
16. blazon of white rook's initial square (ADDED): corner, edge, open
17. rook checks blackness king (OMITTED, always f): t, f
18. rook threatens knight (OMITTED, always t): t, f
19. knight threatens rook (OMITTED, always f): t, f
20. black male monarch, knight, rook in line (OMITTED, e'er t) t, f
21. black male monarch tin can move next to knight (OMITTED) t, f
22. knight tin interpose adjacent to king (OMITTED) t, f

Relevant Papers:

Quinlan, J.R. (1983). Learning Efficient Classification Procedures and Their Awarding to Chess Finish Games. In R.S. Michalski, J.Chiliad. Carbonell, & T.1000. Mitchell (Eds.), Machine Learning -- An Artificial Intelligence Approach, 463-482, Palo Alto: Tioga.
[Spider web Link]

Papers That Cite This Data Ready¹:

Manuel Oliveira. Library Release Form Name of Author: Stanley Robson de Medeiros Oliveira Title of Thesis: Data Transformation For Privacy-Preserving Data Mining Degree: Doctor of Philosophy Year this Degree Granted. University of Alberta Library. 2005. [View Context].

Marcus Hutter and Marco Zaffalon. Distribution of Common Information from Complete and Incomplete Data. CoRR, csLG/0403025. 2004. [View Context].

Ira Cohen and Fabio Gagliardi Cozman and Nicu Sebe and Marcelo Cesar Cirelo and Thomas Southward. Huang. Semisupervised Learning of Classifiers: Theory, Algorithms, and Their Awarding to Human-Computer Interaction. IEEE Trans. Pattern Anal. Mach. Intell, 26. 2004. [View Context].

Douglas Burdick and Manuel Calimlim and Jason Flannick and Johannes Gehrke and Tomi Yiu. MAFIA: A Performance Study of Mining Maximal Frequent Itemsets. FIMI. 2003. [View Context].

Russell Greiner and Wei Zhou. Structural Extension to Logistic Regression: Discriminative Parameter Learning of Belief Net Classifiers. AAAI/IAAI. 2002. [View Context].

Tanzeem Choudhury and James One thousand. Rehg and Vladimir Pavlovic and Alex Pentland. Boosting and Structure Learning in Dynamic Bayesian Networks for Audio-visual Speaker Detection. ICPR (3). 2002. [View Context].

Marco Zaffalon and Marcus Hutter. Robust Feature Choice past Common Data Distributions. CoRR, csAI/0206006. 2002. [View Context].

Michael G. Madden. Evaluation of the Functioning of the Markov Blanket Bayesian Classifier Algorithm. CoRR, csLG/0211003. 2002. [View Context].

James Bailey and Thomas Manoukian and Kotagiri Ramamohanarao. Fast Algorithms for Mining Emerging Patterns. PKDD. 2002. [View Context].

Jie Cheng and Russell Greiner. Learning Bayesian Belief Network Classifiers: Algorithms and Organisation. Canadian Conference on AI. 2001. [View Context].

Boonserm Kijsirikul and Sukree Sinthupinyo and Kongsak Chongkasemwongse. Approximate Match of Rules Using Backpropagation Neural Networks. Machine Learning, 44. 2001. [View Context].

Jinyan Li and Guozhu Dong and Kotagiri Ramamohanarao and Limsoon Wong. DeEPs: A New Case-based Discovery and Classification System. Proceedings of the Fourth European Conference on Principles and Exercise of Knowledge Discovery in Databases. 2001. [View Context].

Jinyan Li and Guozhu Dong and Kotagiri Ramamohanarao. Example-Based Classification past Emerging Patterns. PKDD. 2000. [View Context].

Marking A. Hall. Department of Estimator Science Hamilton, NewZealand Correlation-based Feature Selection for Automobile Learning. Doctor of Philosophy at The Academy of Waikato. 1999. [View Context].

Yk Huhtala and Juha Kärkkäinen and Pasi Porkka and Hannu Toivonen. Efficient Discovery of Functional and Gauge Dependencies Using Partitions. ICDE. 1998. [View Context].

Adam J. Grove and Dale Schuurmans. Boosting in the Limit: Maximizing the Margin of Learned Ensembles. AAAI/IAAI. 1998. [View Context].

Ron Kohavi. Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid. KDD. 1996. [View Context].

Brian R. Gaines. Structured and Unstructured Induction with EDAGs. KDD. 1995. [View Context].

Ron Kohavi and Dan Sommerfield. Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology. KDD. 1995. [View Context].

Grigorios Tsoumakas and Ioannis P. Vlahavas. Fuzzy Meta-Learning: Preliminary Results. Greek Secretariat for Research and Technology. [View Context].

Nikunj C. Oza and Stuart J. Russell. Online Bagging and Boosting. Computer science Division University of California. [View Context].

Hankil Yoon and Khaled A. Alsabti and Sanjay Ranka. Tree-based Incremental Nomenclature for Large Datasets. CISE Section, University of Florida. [View Context].

Omid Madani and David M. Pennock and Gary William Flake. Co-Validation: Using Model Disagreement to Validate Classification Algorithms. Yahoo! Research Labs. [View Context].

One thousand. A. Galway and Michael G. Madden. DEPARTMENT OF INFORMATION TECHNOLOGY technical study NUIG-Information technology-011002 Evaluation of the Operation of the Markov Coating Bayesian Classifier Algorithm. Department of Information Technology National University of Republic of ireland, Galway. [View Context].

BayesianClassifi552 Pat Langley and Wayne Iba. In Proceedings of the Tenth National ConferenceonArtifi256 Intelligence( 42840. Lambda Kevin Thompson. [View Context].

Jerome H. Friedman and Ron Kohavi and Youngkeol Yun. To announced in AAAI-96 Lazy Decision Trees. Statistics Department and Stanford Linear Accelerator Center Stanford University. [View Context].

Citation Request:

Please refer to the Machine Learning Repository'south commendation policy

[1] Papers were automatically harvested and associated with this data gear up, in collaboration with Rexa.info