Sciweavers

590 search results - page 60 / 118
» Can We Learn to Beat the Best Stock
Sort
View
NN
2008
Springer
152views Neural Networks» more  NN 2008»
14 years 9 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
ECML
2007
Springer
15 years 4 months ago
Probabilistic Models for Action-Based Chinese Dependency Parsing
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
Xiangyu Duan, Jun Zhao, Bo Xu
AI
2002
Springer
14 years 9 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
ICML
2007
IEEE
15 years 10 months ago
Three new graphical models for statistical language modelling
The supremacy of n-gram models in statistical language modelling has recently been challenged by parametric models that use distributed representations to counteract the difficult...
Andriy Mnih, Geoffrey E. Hinton
WWW
2005
ACM
15 years 10 months ago
Online curriculum on the semantic Web: the CSD-UoC portal for peer-to-peer e-learning
Online Curriculum Portals aim to support networks of instructors and learners by providing a space of convergence for enhancing peer-to-peer learning interactions among individual...
Dimitris Kotzinos, Sofia Pediaditaki, Apostolos Ap...