Sciweavers

19 search results - page 1 / 4
» Recognizing bounds of context change in on-line learning
Sort
View
IRMA
2000
13 years 5 months ago
Recognizing bounds of context change in on-line learning
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
NIPS
2001
13 years 5 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
ACL
2010
13 years 1 months ago
Tools for Multilingual Grammar-Based Translation on the Web
This is a system demo for a set of tools for translating texts between multiple languages in real time with high quality. The translation works on restricted languages, and is bas...
Aarne Ranta, Krasimir Angelov, Thomas Hallgren
EUROCOLT
1999
Springer
13 years 8 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
IJCAI
2007
13 years 5 months ago
Color Learning on a Mobile Robot: Towards Full Autonomy under Changing Illumination
A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. It is commonly asserted that in order to ...
Mohan Sridharan, Peter Stone