Sciweavers

1760 search results - page 185 / 352
» Learning from Partial Observations
Sort
View
CN
2007
91views more  CN 2007»
15 years 4 months ago
Improving the quality of alerts and predicting intruder's next goal with Hidden Colored Petri-Net
Intrusion detection systems (IDS) often provide poor quality alerts, which are insufficient to support rapid identification of ongoing attacks or predict an intruder’s next lik...
Dong Yu, Deborah A. Frincke
CIARP
2006
Springer
15 years 6 months ago
Robustness Analysis of the Neural Gas Learning Algorithm
The Neural Gas (NG) is a Vector Quantization technique where a set of prototypes self organize to represent the topology structure of the data. The learning algorithm of the Neural...
Carolina Saavedra, Sebastián Moreno, Rodrig...
IJCAI
2001
15 years 5 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
UAI
2003
15 years 5 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
AAI
2005
113views more  AAI 2005»
15 years 4 months ago
Analysis and Synthesis of Learning Agent's Communicative Behavior
This paper is about people. It is about understanding how learning and communication mutually influence one another; allowing people to infer each other's communicative behavi...
Nik Nailah Binti Abdullah, Stefano A. Cerri