Agnostic learning vs. prior knowledge challenge

Guyon, Isabelle, Saffari, Amir, Dror, Gideon and Cawley, Gavin C. ORCID: (2007) Agnostic learning vs. prior knowledge challenge. In: IEEE/INNS International Joint Conference on Neural Networks, 2007-08-12 - 2007-08-17.

Full text not available from this repository. (Request a copy)


"When everything fails, ask for additional domain knowledge" is the current motto of machine learning. Therefore, assessing the real added value of prior/domain knowledge is a both deep and practical question. Most commercial data mining programs accept data pre-formatted as a table, each example being encoded as a fixed set of features. Is it worth spending time engineering elaborate features incorporating domain knowledge and/or designing ad hoc algorithms? Or else, can off-the-shelf programs working on simple features encoding the raw data without much domain knowledge do as well or better than skilled data analysts? To answer these questions, we organized a challenge for IJCNN 2007. The participants were allowed to compete in two tracks: The "prior knowledge" (PK) track, for which they had access to the original raw data representation and as much knowledge as possible about the data, and the "agnostic learning" (AL) track for which they were forced to use data pre-formatted as a table with dummy features. The AL vs. PK challenge Web site remains open:

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences

UEA Research Groups: Faculty of Science > Research Groups > Data Science and Statistics
Faculty of Science > Research Groups > Computational Biology
Faculty of Science > Research Groups > Centre for Ocean and Atmospheric Sciences
Depositing User: EPrints Services
Date Deposited: 01 Oct 2010 13:42
Last Modified: 22 Apr 2023 02:44
DOI: 10.1109/IJCNN.2007.4371065

Actions (login required)

View Item View Item