25,161
edits
Changes
no edit summary
<ref>[http://www.cs.waikato.ac.nz/%7Ebernhard/pubs.html Bernhard Pfahringer's publications]</ref> <ref>[http://dblp.uni-trier.de/pers/hd/p/Pfahringer:Bernhard dblp: Bernhard Pfahringer]</ref>
==1995 ...==
* [[Bernhard Pfahringer]] ('''1995'''). ''Practical Uses of the Minimum Description Length Principle in Inductive Learning''. Ph.D. thesis, [[Vienna University of Technology|TU Vienna]], advisor [[Mathematician#GWidmer|Gerhard Widmer]]
* [[Bernhard Pfahringer]], [[Stefan Kramer]] ('''1995'''). ''Compression-Based Evaluation of Partial Determinations''. [http://www.aaai.org/Conferences/KDD/kdd95.php KDD-95], [[AAAI]] Press, [https://www.aaai.org/Papers/KDD/1995/KDD95-027.pdf pdf] <ref>[[Johannes Fürnkranz]] ('''1997'''). ''Knowledge Discovery in Chess Databases: A Research Proposal.'' Technical Report OEFAI-TR-97-33, Austrian Research Institute for Artificial Intelligence, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/chess-ws.ps.gz zipped ps], [http://www.top-5000.nl/ps/Knowledge%20discovery%20in%20chess%20databases%20-%20a%20research%20proposal.pdf pdf]
3.6 Non-classification techniques: ... General dependencies [Pfahringer and Kramer, 1995] might find interesting applications in chess databases for discovering typical piece-patterns, such as “In many cases when white castles queen-sides, he will sooner or later play h4.”</ref>
