Difference between revisions of "Aritz Pérez"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
Line 9: | Line 9: | ||
In 2007, he joined [[Matej Guid]] and [[Ivan Bratko]] in their [https://en.wikipedia.org/wiki/Comparison_of_top_chess_players_throughout_history#Matej_Guid_and_Ivan_Bratko investigation] | In 2007, he joined [[Matej Guid]] and [[Ivan Bratko]] in their [https://en.wikipedia.org/wiki/Comparison_of_top_chess_players_throughout_history#Matej_Guid_and_Ivan_Bratko investigation] | ||
to compare moves played by [https://en.wikipedia.org/wiki/World_Chess_Championship World Chess Champions] with [[Crafty|Crafty's]] choices <ref>[[Matej Guid]], [[Ivan Bratko]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-75538-8_1 Computer Analysis of Chess Champions]''. [[CG 2006]]</ref> <ref>[https://en.chessbase.com/post/computers-choose-who-was-the-strongest-player- Computers choose: who was the strongest player?] by [[Matej Guid]] and [[Ivan Bratko]], [[ChessBase|ChessBase News]], October 30, 2006</ref>, | to compare moves played by [https://en.wikipedia.org/wiki/World_Chess_Championship World Chess Champions] with [[Crafty|Crafty's]] choices <ref>[[Matej Guid]], [[Ivan Bratko]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-75538-8_1 Computer Analysis of Chess Champions]''. [[CG 2006]]</ref> <ref>[https://en.chessbase.com/post/computers-choose-who-was-the-strongest-player- Computers choose: who was the strongest player?] by [[Matej Guid]] and [[Ivan Bratko]], [[ChessBase|ChessBase News]], October 30, 2006</ref>, | ||
− | concerning how using stronger chess programs, searching more [[Depth|deeply]], or larger sets of positions would influence the conclusion of the relative [[Playing Strength|playing strength]] of World Champions <ref>[[Matej Guid]], [[Aritz Pérez]], [[Ivan Bratko]] ('''2008'''). ''How trustworthy is Crafty's analysis of world chess champions''? [[ICGA Journal#31_3|ICGA Journal, Vol. 31, No. 3]]</ref>. | + | concerning how using stronger chess programs, searching more [[Depth|deeply]], or using larger sets of positions would influence the conclusion of the relative [[Playing Strength|playing strength]] of World Champions <ref>[[Matej Guid]], [[Aritz Pérez]], [[Ivan Bratko]] ('''2008'''). ''How trustworthy is Crafty's analysis of world chess champions''? [[ICGA Journal#31_3|ICGA Journal, Vol. 31, No. 3]]</ref>. |
=Selected Publications= | =Selected Publications= |
Revision as of 11:48, 22 November 2020
Aritz Pérez Martínez,
a Spanish computer scientist, researcher at the University of the Basque Country [2], and its affiliated Basque Center for Applied Mathematics.
His research interests include machine learning, probabilistic graphical models, Bayesian networks, hypothesis testing and bioinformatics
[3].
In 2007, he joined Matej Guid and Ivan Bratko in their investigation
to compare moves played by World Chess Champions with Crafty's choices [4] [5],
concerning how using stronger chess programs, searching more deeply, or using larger sets of positions would influence the conclusion of the relative playing strength of World Champions [6].
Contents
Selected Publications
2006 ...
- Aritz Pérez, Pedro Larrañaga, Iñaki Inza (2006). Information Theory and Classification Error in Probabilistic Classifiers. Discovery Science 2006
- Matej Guid, Aritz Pérez, Ivan Bratko (2007). How trustworthy is Crafty's analysis of world chess champions? CGW 2007 » Crafty
- Matej Guid, Aritz Pérez, Ivan Bratko (2008). How trustworthy is Crafty's analysis of world chess champions? ICGA Journal, Vol. 31, No. 3, pdf
- Aritz Pérez, Pedro Larrañaga, Iñaki Inza (2009). Bayesian classifiers based on kernel density estimation: Flexible classifiers. International Journal of Approximate Reasoning, Vol. 50, No. 2
2010 ...
- Aritz Pérez (2010). Supervised classification in continuous domains with Bayesian networks. Ph. D. thesis, pdf
- Marco Capó, Aritz Pérez, José Antonio Lozano (2016). An efficient K-means algorithm for Massive Data. arXiv:1605.02989
- Marco Capó, Aritz Pérez, José Antonio Lozano (2018). An efficient K -means clustering algorithm for massive data. arXiv:1801.02949
- Santiago Mazuelas, Aritz Pérez (2019). General Supervision via Probabilistic Transformations. arXiv:1901.08552
- Santiago Mazuelas, Andrea Zanoni, Aritz Pérez (2019). Supervised classification via minimax probabilistic transformations. arXiv:1902.00693
2020 ...
- Santiago Mazuelas, Yuan Shen, Aritz Pérez (2020). Generalized Maximum Entropy for Supervised Classification. arXiv:2007.05447
- Santiago Mazuelas, Andrea Zanoni, Aritz Pérez (2020). Minimax Classification with 0-1 Loss and Performance Guarantees. arXiv:2010.07964
External Links
References
- ↑ Image from Aritz Pérez - Home Page
- ↑ Intelligent Systems Group
- ↑ Aritz Pérez - Home Page
- ↑ Matej Guid, Ivan Bratko (2006). Computer Analysis of Chess Champions. CG 2006
- ↑ Computers choose: who was the strongest player? by Matej Guid and Ivan Bratko, ChessBase News, October 30, 2006
- ↑ Matej Guid, Aritz Pérez, Ivan Bratko (2008). How trustworthy is Crafty's analysis of world chess champions? ICGA Journal, Vol. 31, No. 3
- ↑ dblp: Aritz Pérez Martínez