Sciweavers

1222 search results - page 113 / 245
» Machine Learning of Temporal Relations
Sort
View
NIPS
2007
14 years 11 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
ICML
2009
IEEE
15 years 10 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
ML
2010
ACM
185views Machine Learning» more  ML 2010»
14 years 4 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
KI
2008
Springer
14 years 10 months ago
Autonomous Learning of User's Preferences Improved through User Feedback
Ambient Intelligent (AmI) environments are supposed to act proactively anticipating the user's needs and preferences, therefore the capability of an AmI system to learn those ...
Asier Aztiria, Juan Carlos Augusto, Alberto Izagui...
EVOW
2010
Springer
15 years 4 months ago
Learning to Dance through Interactive Evolution
A relatively rare application of artificial intelligence at the nexus of art and music is dance. The impulse shared by all humans to express ourselves through dance represents a u...
Greg A. Dubbin, Kenneth O. Stanley