Sciweavers

1859 search results - page 153 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
ICDIM
2008
IEEE
16 years 20 days ago
Unsupervised key-phrases extraction from scientific papers using domain and linguistic knowledge
The domain of Digital Libraries presents specific challenges for unsupervised information extraction to support both the automatic classification of documents and the enhancement ...
Mikalai Krapivin, Maurizio Marchese, Andrei Yadran...
ICML
2010
IEEE
15 years 7 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
GAMESEC
2010
136views Game Theory» more  GAMESEC 2010»
15 years 4 months ago
Effective Multimodel Anomaly Detection Using Cooperative Negotiation
Abstract. Many computer protection tools incorporate learning techniques that build mathematical models to capture the characteristics of system's activity and then check whet...
Alberto Volpatto, Federico Maggi, Stefano Zanero
PKDD
2009
Springer
152views Data Mining» more  PKDD 2009»
16 years 23 days 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
ICCBR
2007
Springer
16 years 12 days ago
Using Cases Utility for Heuristic Planning Improvement
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
Tomás de la Rosa, Angel García Olaya...