Sciweavers

1760 search results - page 40 / 352
» Learning from Partial Observations
Sort
View
AI
2006
Springer
13 years 11 months ago
Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games
So far, most equilibrium concepts in game theory require that the rewards and actions of the other agents are known and/or observed by all agents. However, in real life problems, a...
Stéphane Ross, Brahim Chaib-draa
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 8 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
NIPS
2004
13 years 9 months ago
Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices
We prove generalization error bounds for predicting entries in a partially observed matrix by fitting the observed entries with a low-rank matrix. In justifying the analysis appro...
Nathan Srebro, Noga Alon, Tommi Jaakkola
PERCOM
2007
ACM
14 years 7 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
ICTAI
2007
IEEE
14 years 2 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz