Sciweavers

4128 search results - page 251 / 826
» Learning and using relational theories
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
KAIS
2006
121views more  KAIS 2006»
15 years 6 months ago
Using discriminant analysis for multi-class classification: an experimental investigation
Abstract. Many supervised machine learning tasks can be cast as multi-class classification problems. Support vector machines (SVMs) excel at binary classification problems, but the...
Tao Li, Shenghuo Zhu, Mitsunori Ogihara
PKDD
2009
Springer
152views Data Mining» more  PKDD 2009»
16 years 1 months ago
Feature Selection for Value Function Approximation Using Bayesian Model Selection
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
Tobias Jung, Peter Stone
AIED
2005
Springer
16 years 5 days ago
Engagement tracing: using response times to model student disengagement
Time on task is an important predictor for how much students learn. However, students must be focused on their learning for the time invested to be productive. Unfortunately, stude...
Joseph E. Beck
AAAI
1996
15 years 8 months ago
Building Classifiers Using Bayesian Networks
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competit...
Nir Friedman, Moisés Goldszmidt