A Java library for Probabilistic Graphical Models
- Implement Discrete Factor Representation
- Base Class
- Factor Product
- Joint Probability Distribution
- Independencies
- Base Class
- Implement Continuous Factor Representation
- Linear Gaussian
- Bayesian Network Representation
- Basic structure and construction
- d-sep/independencies
- Markov Network
- Basic structure and construction
- d-sep
- Partitioning/Normalization
- Inference
- Variable Elimination
- Elimination ordering
- Sum-Product
- Max-Product
- Variable Elimination
- Toy Examples
- Student example
- Showcase current features for 1.0.0
- Student example
- Documentation
- Fully document all classes
- Testing
- More robust testing of edge cases
- Variables of the same name
- Catching/Throwing errors
- More robust testing of edge cases
- Implement Discrete Factor Representation
- Base Class
- String Representations
- inplace operations
- Joint Probability Distribution
- i-map of a network
- p-map of a network
- minimal i-map
- Base Class
- Implement Continuous Factor Representation
- User defined distribution (dirichlet, etc.)
- Models
- Factor Graph
- Creation as a base class?
- Conversions from other models
- Bayesian Network Representation
- Caching of graph queries (d-sep, trails)
- i-equivalence
- Markov Network
- Factor Graph
- Inference
- Inference over generalized factor graph
- Toy Examples
- Student example
- Showcase current features for 1.1.0
- Student example
- Documentation
- Fully document all classes
- Add documentation coverage
- Testing
- More robust testing of edge cases
- Variables of the same name
- Catching/Throwing errors
- More robust testing of edge cases
- Logging
- Decide upon and implement a logging structure
- log4j/slf4j
- Decide upon and implement a logging structure