Sciweavers

1292 search results - page 165 / 259
» Bayesian learning in negotiation
Sort
View
IOR
2011
107views more  IOR 2011»
13 years 3 months ago
Information Collection on a Graph
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
Ilya O. Ryzhov, Warren B. Powell
ALT
2007
Springer
14 years 2 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
ISDA
2008
IEEE
14 years 2 months ago
Performance Comparison of ADRS and PCA as a Preprocessor to ANN for Data Mining
In this paper we compared the performance of the Automatic Data Reduction System (ADRS) and principal component analysis (PCA) as a preprocessor to artificial neural networks (ANN...
Nicholas Navaroli, David Turner, Arturo I. Concepc...
JMLR
2011
167views more  JMLR 2011»
13 years 3 months ago
Logistic Stick-Breaking Process
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
Lu Ren, Lan Du, Lawrence Carin, David B. Dunson
JMLR
2010
156views more  JMLR 2010»
13 years 2 months ago
Classification with Incomplete Data Using Dirichlet Process Priors
A non-parametric hierarchical Bayesian framework is developed for designing a classifier, based on a mixture of simple (linear) classifiers. Each simple classifier is termed a loc...
Chunping Wang, Xuejun Liao, Lawrence Carin, David ...