Sciweavers

1880 search results - page 84 / 376
» Robust Learning - Rich and Poor
Sort
View
MLG
2007
Springer
15 years 8 months ago
Improving Frequent Subgraph Mining in the Presence of Symmetry
While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases that have a few or no la...
Christian Desrosiers, Philippe Galinier, Pierre Ha...
ROBOCUP
2000
Springer
130views Robotics» more  ROBOCUP 2000»
15 years 5 months ago
Improvement Continuous Valued Q-learning and Its Application to Vision Guided Behavior Acquisition
Q-learning, a most widely used reinforcement learning method, normally needs well-defined quantized state and action spaces to converge. This makes it difficult to be applied to re...
Yasutake Takahashi, Masanori Takeda, Minoru Asada
JCAL
2002
96views more  JCAL 2002»
15 years 1 months ago
Improving continuing professional development in the use of ICT
Common shortcomings in educational design in Higher Education have not been fully addressed during the rapid shift towards online, resource-based learning. A contributing factor to...
A. H. Littlejohn
ML
2010
ACM
15 years 12 days ago
Semi-supervised local Fisher discriminant analysis for dimensionality reduction
When only a small number of labeled samples are available, supervised dimensionality reduction methods tend to perform poorly due to overfitting. In such cases, unlabeled samples ...
Masashi Sugiyama, Tsuyoshi Idé, Shinichi Na...
ICML
2009
IEEE
14 years 11 months ago
Accelerated sampling for the Indian Buffet Process
We often seek to identify co-occurring hidden features in a set of observations. The Indian Buffet Process (IBP) provides a nonparametric prior on the features present in each obs...
Finale Doshi-Velez, Zoubin Ghahramani