| Maintainer | bastiaan.heeren@ou.nl |
|---|---|
| Stability | provisional |
| Portability | portable (depends on ghc) |
| Safe Haskell | Safe |
| Language | Haskell98 |
Bayes.Network
Description
Synopsis
- data Network a
- makeNetwork :: String -> [Node a] -> Network a
- name :: Network a -> String
- nodes :: Network a -> [Node a]
- nodeIds :: Network a -> Set String
- mapNodes :: (Node a -> Node b) -> Network a -> Network b
- mapNodesM :: Monad m => (Node a -> m (Node b)) -> Network a -> m (Network b)
- renameNodes :: (String -> String) -> Network a -> Network a
- filterNodes :: (Node a -> Bool) -> Network a -> Network a
- addNode :: Node a -> Network a -> Network a
- data Node a = Node {
- nodeId :: String
- label :: String
- states :: [(String, a)]
- parentIds :: [String]
- definition :: Definition
- parents :: Network a -> Node a -> [Node a]
- node :: String -> Node a
- node_ :: Node a -> Node ()
- size :: Node a -> Int
- sizeId :: Network a -> String -> Int
- descendants :: Network a -> Node a -> [Node a]
- ancestors :: Network a -> Node a -> [Node a]
- findNode :: Network a -> String -> Maybe (Node a)
- findStates :: Network a -> String -> [(String, Int)]
- data Definition
- = CPT [Probability]
- | NoisyMax [Int] [Probability]
- | NoisyAdder [Int] [Double] [Probability]
- findNodeFuzzy :: Monad m => Network a -> String -> m (Node a)
- state2label :: Network a -> String -> Int -> String
- label2state :: Network a -> String -> String -> Int
Documentation
Instances
| Functor Network Source # | |
| Eq (Network a) Source # | |
| Ord (Network a) Source # | |
| Show a => Show (Network a) Source # | |
| Semigroup (Network a) Source # | |
| Monoid (Network a) Source # | |
Constructors
| Node | |
Fields
| |
findStates :: Network a -> String -> [(String, Int)] Source #
Find all states associated with a certain node.
data Definition Source #
Constructors
| CPT [Probability] | |
| NoisyMax [Int] [Probability] | |
| NoisyAdder [Int] [Double] [Probability] |
findNodeFuzzy :: Monad m => Network a -> String -> m (Node a) Source #
Find a node based on its name, ignoring capitalisation, whitespace and interpunction, and also ignoring if the network is prefixed with its own name.