Bernhard Pfahringer, an Austrian computer scientist and AI researcher, since 2000 associate professor at the Computer Science Department at the University of Waikato, New Zealand. His research interests covers Machine Learning and Programming Languages.
Bernhard Pfahringer [1]

Selected Publications

1995 ...

• Bernhard Pfahringer, Stefan Kramer (1995). Compression-Based Evaluation of Partial Determinations. KDD-95, AAAI Press, pdf ^[4]
• Johannes Fürnkranz, Bernhard Pfahringer (1998). Guest Editorial: First-Order Knowledge Discovery in Databases. Applied Artificial Intelligence, Vol. 12, No. 5, 345-362, 1998

2000 ...

• Johannes Fürnkranz, Bernhard Pfahringer, Hermann Kaindl, Stefan Kramer (2000). Learning to Use Operational Advice. ECAI-00, pdf
• Geoffrey Holmes, Bernhard Pfahringer, Richard Kirkby, Eibe Frank, Marc Hall (2002). Multiclass Alternating Decision Trees. ECML, pdf

2010 ...

• Jan van Rijn, Geoffrey Holmes, Bernhard Pfahringer, Joaquin Vanschoren (2014). Algorithm Selection on Data Streams. DS 2014
• Jan van Rijn, Geoffrey Holmes, Bernhard Pfahringer, Joaquin Vanschoren (2014). Towards Meta-learning over Data Streams. MetaSel 2014

External Links

• Homepage of Bernhard Pfahringer

References

1. ^ Image from Homepage of Bernhard Pfahringer (cropped)
2. ^ Bernhard Pfahringer's publications
3. ^ Johannes Fürnkranz - Research Areas (Selected Publications)
4. ^ Johannes Fürnkranz (1997). Knowledge Discovery in Chess Databases: A Research Proposal. Technical Report OEFAI-TR-97-33, Austrian Research Institute for Artificial Intelligence, zipped ps, 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.”

What links here?