module Bayes.VariableElimination(
priorMarginal
, posteriorMarginal
, interactionGraph
, degreeOrder
, minDegreeOrder
, minFillOrder
, allVariables
, marginal
, EliminationOrder
) where
import Bayes
import Bayes.Factor
import Data.List(partition,minimumBy,(\\),find,foldl')
import Data.Maybe(fromJust)
import Data.Function(on)
import qualified Data.Map as M
type EliminationOrder = [DV]
allVariables :: (Graph g, Factor f)
=> BayesianNetwork g f
-> [DV]
allVariables g =
let s = allVertexValues g
createDV = factorMainVariable
in
map createDV s
data Buckets f = Buckets !EliminationOrder !(M.Map DV [f])
createBuckets :: (Factor f)
=> [f]
-> EliminationOrder
-> EliminationOrder
-> Buckets f
createBuckets s e r =
let
theOrder = e ++ r
addDVToBucket (rf, m) dv =
let (fk,remaining) = partition (flip containsVariable dv) rf
in
(remaining, M.insert dv fk m)
(_,b) = foldl' addDVToBucket (s,M.empty) theOrder
in
Buckets (tail theOrder) b
getBucket :: DV
-> Buckets f
-> [f]
getBucket dv (Buckets _ m) = fromJust $ M.lookup dv m
updateBucket :: Factor f
=> DV
-> f
-> Buckets f
-> Buckets f
updateBucket dv f b@(Buckets e m) =
if isScalarFactor f
then
Buckets (tail e) (M.insert dv [f] m)
else
let b' = removeFromBucket dv b
Buckets e' m' = addBucket b' f
in
Buckets (tail e') m'
addBucket :: Factor f => Buckets f -> f -> Buckets f
addBucket (Buckets e b) f =
let inBucket = find (f `containsVariable`) e
in
case inBucket of
Nothing -> Buckets e b
Just bucket -> Buckets e (M.insertWith' (++) bucket [f] b)
removeFromBucket :: DV -> Buckets f -> Buckets f
removeFromBucket dv (Buckets e m) = Buckets e (M.delete dv m)
marginal :: (Factor f)
=> [f]
-> EliminationOrder
-> EliminationOrder
-> [DVI Int]
-> f
marginal lf p r assignment =
let bucket = createBuckets lf p r
assignmentFactors = map factorFromInstantiation assignment
bucket' = foldl' addBucket bucket assignmentFactors
Buckets _ resultBucket = foldl' marginalizeOneVariable bucket' p
resultFactor = factorProduct . concat . M.elems $ resultBucket
in
resultFactor
where
marginalizeOneVariable currentBucket dv =
let fk = getBucket dv currentBucket
p = factorProduct fk
f' = factorProjectOut [dv] p
in
updateBucket dv f' currentBucket
posteriorMarginal :: (Graph g, Factor f, Show f)
=> BayesianNetwork g f
-> EliminationOrder
-> EliminationOrder
-> [DVI Int]
-> f
posteriorMarginal g p r assignment =
let s = allVertexValues g
resultFactor = marginal s p r assignment
norm = factorNorm resultFactor
in
resultFactor `factorDivide` norm
priorMarginal :: (Graph g, Factor f, Show f)
=> BayesianNetwork g f
-> EliminationOrder
-> EliminationOrder
-> f
priorMarginal g ea eb =
let s = allVertexValues g
resultFactor = marginal s ea eb []
norm = factorNorm resultFactor
in
resultFactor `factorDivide` norm
interactionGraph :: (FoldableWithVertex g,Factor f, UndirectedGraph g')
=> BayesianNetwork g f
-> g' () DV
interactionGraph g =
foldrWithVertex addFactor emptyGraph g
where
addFactor vertex factor graph =
let allvars = factorVariables factor
edges = [(x,y) | x <- allvars, y <- allvars , x /= y]
addNewEdge g (va,vb) =
let g' = addVertex (variableVertex vb) vb . addVertex (variableVertex va) va $ g
in
addEdge (edge (variableVertex va) (variableVertex vb)) () $ g'
in
foldl' addNewEdge graph edges
nbNeighbors :: UndirectedSG () DV
-> DV
-> Int
nbNeighbors g dv =
let r = fromJust $ neighbors g (variableVertex dv)
in
length r
nbMissingLinks :: UndirectedSG () DV
-> DV
-> Int
nbMissingLinks g dv =
let r = fromJust $ neighbors g (variableVertex dv)
edges = [(x,y) | x <- r, y <- r , x /= y, not (isLinkedWithAnEdge g x y)]
in
length edges
degreeOrder :: (FoldableWithVertex g, Factor f, Graph g)
=> BayesianNetwork g f
-> EliminationOrder
-> Int
degreeOrder g p =
let ig = interactionGraph g :: UndirectedSG () DV
(_,w) = foldl' processVariable (ig,0) p
in
w
where
addAnEdge g (va,vb) = addEdge (edge va vb) () g
processVariable (g,w) bdv =
let r = fromJust $ neighbors g (variableVertex bdv)
nbNeighbors = length r
edges = [(x,y) | x <- r, y <- r , x /= y, not (isLinkedWithAnEdge g x y)]
g' = removeVertex (variableVertex bdv) (foldl' addAnEdge g edges)
in
if nbNeighbors > w
then
(g',nbNeighbors)
else
(g',w)
eliminationOrderForMetric :: (Graph g, Factor f, FoldableWithVertex g, UndirectedGraph g')
=> (g' () DV -> DV -> Int)
-> BayesianNetwork g f
-> EliminationOrder
eliminationOrderForMetric metric g =
let ig = interactionGraph g
s = allVertexValues ig
getOptimalNode _ [] = []
getOptimalNode g l =
let (optimalNode,_) = minimumBy (compare `on` snd) . map (\v -> (v,metric g v)) $ l
g' = removeVertex (variableVertex optimalNode) g
in
optimalNode : getOptimalNode g' (l \\ [optimalNode])
in
getOptimalNode ig s
minDegreeOrder :: (Graph g, Factor f, FoldableWithVertex g)
=> BayesianNetwork g f
-> EliminationOrder
minDegreeOrder = eliminationOrderForMetric nbNeighbors
minFillOrder :: (Graph g, Factor f, FoldableWithVertex g)
=> BayesianNetwork g f
-> EliminationOrder
minFillOrder = eliminationOrderForMetric nbMissingLinks