Sciweavers

590 search results - page 59 / 118
» Can We Learn to Beat the Best Stock
Sort
View
EMNLP
2009
14 years 11 months ago
Simple Coreference Resolution with Rich Syntactic and Semantic Features
Coreference systems are driven by syntactic, semantic, and discourse constraints. We present a simple approach which completely modularizes these three aspects. In contrast to muc...
Aria Haghighi, Dan Klein
96
Voted
ICML
2004
IEEE
16 years 2 months ago
A MFoM learning approach to robust multiclass multi-label text categorization
We propose a multiclass (MC) classification approach to text categorization (TC). To fully take advantage of both positive and negative training examples, a maximal figure-of-meri...
Sheng Gao, Wen Wu, Chin-Hui Lee, Tat-Seng Chua
IJCNN
2007
IEEE
15 years 7 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
CIKM
2010
Springer
15 years 2 days ago
Online learning for recency search ranking using real-time user feedback
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
Taesup Moon, Lihong Li, Wei Chu, Ciya Liao, Zhaohu...
IJCNN
2007
IEEE
15 years 7 months ago
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...