Sciweavers

32 search results - page 5 / 7
» Efficient Learning with Partially Observed Attributes
Sort
View
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 8 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
ICML
2006
IEEE
14 years 9 months ago
An analytic solution to discrete Bayesian reinforcement learning
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
Pascal Poupart, Nikos A. Vlassis, Jesse Hoey, Kevi...
DIS
2009
Springer
14 years 3 months ago
An Iterative Learning Algorithm for Within-Network Regression in the Transductive Setting
Within-network regression addresses the task of regression in partially labeled networked data where labels are sparse and continuous. Data for inference consist of entities associ...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
TVCG
2010
217views more  TVCG 2010»
13 years 6 months ago
How Information Visualization Novices Construct Visualizations
—It remains challenging for information visualization novices to rapidly construct visualizations during exploratory data analysis. We conducted an exploratory laboratory study i...
Lars Grammel, Melanie Tory, Margaret-Anne D. Store...
ATAL
2010
Springer
13 years 9 months ago
Closing the learning-planning loop with predictive state representations
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
Byron Boots, Sajid M. Siddiqi, Geoffrey J. Gordon