Sciweavers

220 search results - page 9 / 44
» Learning probabilistic decision graphs
Sort
View
ICIP
2010
IEEE
13 years 5 months ago
Learning image similarities via Probabilistic Feature Matching
In this paper, we propose a novel image similarity learning approach based on Probabilistic Feature Matching (PFM). We consider the matching process as the bipartite graph matchin...
Ziming Zhang, Ze-Nian Li, Mark S. Drew
IOR
2011
107views more  IOR 2011»
13 years 2 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
AAAI
1990
13 years 8 months ago
What Should Be Minimized in a Decision Tree?
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
Usama M. Fayyad, Keki B. Irani
ICTAI
2009
IEEE
14 years 2 months ago
Probabilistic Neural Logic Network Learning: Taking Cues from Neuro-Cognitive Processes
This paper describes an attempt to devise a knowledge discovery model that is inspired from the two theoretical frameworks of selectionism and constructivism in human cognitive le...
Henry Wai Kit Chia, Chew Lim Tan, Sam Yuan Sung
NETWORKS
2010
13 years 5 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...