Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Initial Work
Get Factor Graph from Tuffy with the help of the in memory data structure MRF.
Tuffy uses Postgres for grounding and later converts the graph into Markov Random Field The instance of the MRF class is used to get the Factor Graph
Results: Smokers
Time (in seconds)
predicate smokes(person) cancer(person) friends(person, person) weighted formulas 0.5 !smokes(x) V cancer(x) 10.4 smokes(x) V !friends(x,y) => smokes(y)
1.48674701
0.01266217 1000
The results for compression for the smokers markov logic network of the current code and Babaks code are approximately same. The major difference is the conversion of MLN to Factor Graph
Results: Class
predicate Tuffy + Compression 12 Wrote(person,paper) Refers(paper,paper) 10 Category(paper,cat) 8 Samecat(cat,cat) 6 weighted formulas 4 1 !wrote(a1,a3) V !wrote(a1,a2) V category(a3,a4) 2 V category(a2,a4) 0 100 1000 10000 100000 2 !refers(a1,a2) V category(a2,a3) V Number of Ground Nodes !category(a1,a3) Tuffy + Compression 2 !refers(a1,a2) V category(a1,a3) V !category(a2,a3) The results for compression for the Class markov 10 sameCat(a2,a3) V ! category(a1,a3) V logic network of the current code run of of !category(a2,a3) memory for n = 10000 and Babaks code runs out of memory for n =1000 (while converting to factor graph) . This is because the number of factors is very high.
Time (in seconds)
10000 3.671 -
100000 -
Total Time
1.03059538
3.13847
Future Work
Get Results for National Football League mln to predict the game winner.