590 search results - page 1 / 118 » Can We Learn to Beat the Best Stock |
111
Voted
NIPS
2003
15 years 18 days ago
2003
A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our app...
106
click to vote
ICDM
2007
IEEE
15 years 5 months ago
2007
IEEE
Recently, the web has rapidly emerged as a great source of financial information ranging from news articles to personal opinions. Data mining and analysis of such financial info...
104
click to vote
FLAIRS
2009
14 years 9 months ago
2009
In this paper, we investigate the hypothesis that plan recognition can significantly improve the performance of a casebased reinforcement learner in an adversarial action selectio...
CG
2006
Springer
15 years 1 months ago
2006
Springer
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
ECML
2004
Springer
15 years 4 months ago
2004
Springer
Given the pattern-based multi-predictors of the stock price, we study a method of dynamic asset allocation to maximize the trading performance. To optimize the proportion of asset ...