25,161
edits
Changes
Created page with "'''Home * People * Tim Niblett''' FILE:tim-niblett.jpg|border|right|thumb|link=https://twitter.com/tim_niblett| Tim Niblett <ref>[https://twitter.com/tim..."
'''[[Main Page|Home]] * [[People]] * Tim Niblett'''
[[FILE:tim-niblett.jpg|border|right|thumb|link=https://twitter.com/tim_niblett| Tim Niblett <ref>[https://twitter.com/tim_niblett Tim Niblett (@tim_niblett) | Twitter]</ref> ]]
'''Timothy B. (Tim) Niblett''',<br/>
a British computer scientist, [[Artificial Intelligence|AI]] researcher and entrepreneur in the field of [https://en.wikipedia.org/wiki/Expert_system Expert systems]. Tim Niblett defended his Ph.D. with the thesis ''Validation of Machine-Oriented Strategies in Chess Endgames'' at [[University of Edinburgh]] in 1982 under [[Donald Michie]] <ref>[[Tim Niblett]] ('''1982'''). ''Validation of Machine-Oriented Strategies in Chess Endgames''. Ph.D. thesis, [[University of Edinburgh]]</ref>, and co-founded the [https://en.wikipedia.org/wiki/Turing_Institute Turing Institute] along with Michie et al..
=Decision Trees=
At the Department of Machine Intelligence at [[University of Edinburgh]], Tim Niblett researched on [https://en.wikipedia.org/wiki/Decision_tree decision tree] algorithms and [https://en.wikipedia.org/wiki/Decision_tree_learning decision tree learning] applied to chess.
Tim Niblett and [[Alen Shapiro]], another of Michie's students, adopted [[Ross Quinlan|Ross Quinlan's]] [https://en.wikipedia.org/wiki/ID3_algorithm Iterative Dichotomiser 3] (ID3) algorithm for processing complex data <ref>[[Ross Quinlan]] ('''1986'''). ''Induction of Decision Trees''. [https://en.wikipedia.org/wiki/Machine_Learning_(journal) Machine Learning], Vol. 1, No. 1</ref> for other employment at the chessboard, while they overcame <ref>[http://www.aiai.ed.ac.uk/%7Edm/dmcv.html D. Michie CV]</ref> its disadvantage that it yielded massively unwieldy and incomprehensible decision-rules with ''structured induction'', an interactive regime for generating machine-executable decision rules and configuring them into transparent concept-hierarchies. Niblett and Shapiro tested ID3 on the [[Endgame|endgame]] of [[KPK]], and found that decision trees generated by the algorithm 100% accurate.
=Chess Endgames=
Quote by [[Maarten van Emden]] in ''I remember Donald Michie'' <ref>[http://vanemden.wordpress.com/2009/06/12/i-remember-donald-michie-1923-2007/ I remember Donald Michie (1923 – 2007) « A Programmers Place] by [[Maarten van Emden]], June 12, 2009</ref>:
In 1980 I spent another summer in Edinburgh as a guest of Donald Michie. Since the low point of 1975, thanks to assiduous and inventive joint pursuit of funding possibilities by Donald and [[Jean Hayes Michie|Jean]], the Machine Intelligence Research Unit was alive with work focused on [[Endgame|chess endgames]]. There were students, including [[Tim Niblett]] and [[Alen Shapiro]]. [[Danny Kopec]] was there, perhaps formally as a student, but de facto as the resident chess consultant. [[Ivan Bratko]] visited frequently. Alen was the administrator of the dream computing environment of that time: a small [[PDP-11]] running [[Unix]].
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
* [[Ivan Bratko]], [[Tim Niblett]] ('''1979'''). ''Conjectures and Refutations in a Framework for Chess Endgames''. in [[Donald Michie]] (ed.) ('''1979'''). ''[https://www.semanticscholar.org/paper/Expert-systems-in-the-micro-electronic-age-Michie/cbb537091d70fb1f4daf73fbaaa0859ece3a7acf Expert Systems in the Micro-Electronic Age]''. [https://en.wikipedia.org/wiki/Edinburgh_University_Press Edinburgh University Press]
* [[Danny Kopec]], [[Tim Niblett]] ('''1980'''). ''How Hard is the Play of the King-Rook-King-Knight Ending?'' [[Advances in Computer Chess 2]]
* [[Alen Shapiro]], [[Tim Niblett]] ('''1982'''). ''Automatic Induction of Classification Rules for Chess End game.'' [[Advances in Computer Chess 3]]
* [[Tim Niblett]] ('''1982'''). ''[https://www.era.lib.ed.ac.uk/handle/1842/6635 Validation of Machine-Oriented Strategies in Chess Endgames]''. Ph.D. thesis, [[University of Edinburgh]]
* [[Tim Niblett]], [[Ivan Bratko]] ('''1987'''). ''[https://www.semanticscholar.org/paper/Learning-decision-rules-in-noisy-domains-Niblett-Bratko/1418eea19ccb9170e4af15d3c960b98e332e2607 Learning decision rules in noisy domains]''. in [[Max Bramer]] (ed.) ('''1987'''). ''[https://www.cambridge.org/core/journals/robotica/article/research-and-development-in-expert-systems-iii-edited-by-ma-bramer-british-computer-society-workghop-series-cambridge-university-press-1987-277pp-3950/CB198384688E3E89423F5D42CAED2A88# Research and Development in Expert Systems III]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
=External Links=
* [https://twitter.com/tim_niblett Tim Niblett (@tim_niblett) | Twitter]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Entrepreneur|Niblett]]
[[Category:Researcher|Niblett]]
[[FILE:tim-niblett.jpg|border|right|thumb|link=https://twitter.com/tim_niblett| Tim Niblett <ref>[https://twitter.com/tim_niblett Tim Niblett (@tim_niblett) | Twitter]</ref> ]]
'''Timothy B. (Tim) Niblett''',<br/>
a British computer scientist, [[Artificial Intelligence|AI]] researcher and entrepreneur in the field of [https://en.wikipedia.org/wiki/Expert_system Expert systems]. Tim Niblett defended his Ph.D. with the thesis ''Validation of Machine-Oriented Strategies in Chess Endgames'' at [[University of Edinburgh]] in 1982 under [[Donald Michie]] <ref>[[Tim Niblett]] ('''1982'''). ''Validation of Machine-Oriented Strategies in Chess Endgames''. Ph.D. thesis, [[University of Edinburgh]]</ref>, and co-founded the [https://en.wikipedia.org/wiki/Turing_Institute Turing Institute] along with Michie et al..
=Decision Trees=
At the Department of Machine Intelligence at [[University of Edinburgh]], Tim Niblett researched on [https://en.wikipedia.org/wiki/Decision_tree decision tree] algorithms and [https://en.wikipedia.org/wiki/Decision_tree_learning decision tree learning] applied to chess.
Tim Niblett and [[Alen Shapiro]], another of Michie's students, adopted [[Ross Quinlan|Ross Quinlan's]] [https://en.wikipedia.org/wiki/ID3_algorithm Iterative Dichotomiser 3] (ID3) algorithm for processing complex data <ref>[[Ross Quinlan]] ('''1986'''). ''Induction of Decision Trees''. [https://en.wikipedia.org/wiki/Machine_Learning_(journal) Machine Learning], Vol. 1, No. 1</ref> for other employment at the chessboard, while they overcame <ref>[http://www.aiai.ed.ac.uk/%7Edm/dmcv.html D. Michie CV]</ref> its disadvantage that it yielded massively unwieldy and incomprehensible decision-rules with ''structured induction'', an interactive regime for generating machine-executable decision rules and configuring them into transparent concept-hierarchies. Niblett and Shapiro tested ID3 on the [[Endgame|endgame]] of [[KPK]], and found that decision trees generated by the algorithm 100% accurate.
=Chess Endgames=
Quote by [[Maarten van Emden]] in ''I remember Donald Michie'' <ref>[http://vanemden.wordpress.com/2009/06/12/i-remember-donald-michie-1923-2007/ I remember Donald Michie (1923 – 2007) « A Programmers Place] by [[Maarten van Emden]], June 12, 2009</ref>:
In 1980 I spent another summer in Edinburgh as a guest of Donald Michie. Since the low point of 1975, thanks to assiduous and inventive joint pursuit of funding possibilities by Donald and [[Jean Hayes Michie|Jean]], the Machine Intelligence Research Unit was alive with work focused on [[Endgame|chess endgames]]. There were students, including [[Tim Niblett]] and [[Alen Shapiro]]. [[Danny Kopec]] was there, perhaps formally as a student, but de facto as the resident chess consultant. [[Ivan Bratko]] visited frequently. Alen was the administrator of the dream computing environment of that time: a small [[PDP-11]] running [[Unix]].
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
* [[Ivan Bratko]], [[Tim Niblett]] ('''1979'''). ''Conjectures and Refutations in a Framework for Chess Endgames''. in [[Donald Michie]] (ed.) ('''1979'''). ''[https://www.semanticscholar.org/paper/Expert-systems-in-the-micro-electronic-age-Michie/cbb537091d70fb1f4daf73fbaaa0859ece3a7acf Expert Systems in the Micro-Electronic Age]''. [https://en.wikipedia.org/wiki/Edinburgh_University_Press Edinburgh University Press]
* [[Danny Kopec]], [[Tim Niblett]] ('''1980'''). ''How Hard is the Play of the King-Rook-King-Knight Ending?'' [[Advances in Computer Chess 2]]
* [[Alen Shapiro]], [[Tim Niblett]] ('''1982'''). ''Automatic Induction of Classification Rules for Chess End game.'' [[Advances in Computer Chess 3]]
* [[Tim Niblett]] ('''1982'''). ''[https://www.era.lib.ed.ac.uk/handle/1842/6635 Validation of Machine-Oriented Strategies in Chess Endgames]''. Ph.D. thesis, [[University of Edinburgh]]
* [[Tim Niblett]], [[Ivan Bratko]] ('''1987'''). ''[https://www.semanticscholar.org/paper/Learning-decision-rules-in-noisy-domains-Niblett-Bratko/1418eea19ccb9170e4af15d3c960b98e332e2607 Learning decision rules in noisy domains]''. in [[Max Bramer]] (ed.) ('''1987'''). ''[https://www.cambridge.org/core/journals/robotica/article/research-and-development-in-expert-systems-iii-edited-by-ma-bramer-british-computer-society-workghop-series-cambridge-university-press-1987-277pp-3950/CB198384688E3E89423F5D42CAED2A88# Research and Development in Expert Systems III]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
=External Links=
* [https://twitter.com/tim_niblett Tim Niblett (@tim_niblett) | Twitter]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Entrepreneur|Niblett]]
[[Category:Researcher|Niblett]]
