The current work applies Conditional Random Fields to the problem of temporal reference mapping from Chinese text to English text. The learning algorithm utilizes a moderate number...
The Decision Tree Learning Algorithms (DTLAs) are getting keen attention from the natural language processing research comlnunity, and there have been a series of attempts to appl...
In the past years, the theory and practice of machine learning and data mining have been focused on static and finite data sets from where learning algorithms generate a static m...
Manual generation of training examples for supervised learning is an expensive process. One way to reduce this cost is to produce training instances that are highly informative. T...
Justus H. Piater, Edward M. Riseman, Paul E. Utgof...
In this paper we apply the recent notion of anytime universal intelligence tests to the evaluation of a popular reinforcement learning algorithm, Q-learning. We show that a general...