ual-logo Compact representation of conditional probability for rule-based mobile context-aware systems Szymon Bobek , Grzegorz J. Nalepa AGH University of Science and Technology RuleML 2015 5 August 2015, Berlin http://geist.agh.edu.pl SBK+GJN (AGH-UST) Indect 5 August 2015 1 / 28
51
Embed
RuleML2015: Compact representation of conditional probability for rule-based mobile context-aware systems
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
ual-logo
Compact representation of conditional probabilityfor rule-based mobile context-aware systems
Szymon Bobek, Grzegorz J. Nalepa
AGH University of Science and Technology
RuleML 20155 August 2015, Berlinhttp://geist.agh.edu.pl
Data: E – the set of all known attributes valuesA – the set of attributes which values are to be found
Result: V – values for attributes from the set A1 Create a stack of tables T that needs to be processed to obtain V ;2 while not empty T do3 t = pop(T );4 Identify schema (COND,DEC) of table t;5 if ∀c ∈ COND,Val(c) ∈ E then6 Execute table t;7 ∀a ∈ DEC ∩ A : add Val(a) to E and V ;8 else9 Run probabilistic reasoning to obtain P(a)∀a ∈ DEC;
10 Select rule 〈rmax , pmax〉 such that: ∀ 〈r , p〉 ∈ t : p ≤ pmax ;11 if pmax ≥ ε then12 execute rule r ;13 ∀a ∈ DEC ∩ A : add Val(a) to E and V ;14 else15 ∀a ∈ DEC ∩ A : add P(a) to E and V ;16 t = pop(T );17 Identify schema (COND,DEC) of table t;18 goto 919 end20 end21 end22 return V ;
Inference modes1 Deterministic
inference2 Probabilistic
inference3 Hybrid
inference
SBK+GJN (AGH-UST) Indect 5 August 2015 22 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
(->) B
1
2
3
4
5
No. (?) A
B = a
B = b
B = c
B = d
B = e
P(B=d | evidence) = 0.2
P(B=c | evidence) = 0.2
P(B=b | evidence) = 0.2
P(B=a | evidence) = 0.2
P(B=e | evidence) = 0.2
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
(->) E(?) B
1
2
3
4
5
No. (?) D
E = a
E = b
E = c
E = d
E = e
P(E=d | evidence) = 0.6
P(E=c | evidence) = 0.1
P(E=b | evidence) = 0.0
P(E=a | evidence) = 0.1
P(E=e | evidence) = 0.2
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Hybrid reasoning
Assumptions
Value of attribute G is needed
Only value of attribute C is known
Attribute F is set to be in/out
A B
C D
B D E
E F
E G
SBK+GJN (AGH-UST) Indect 5 August 2015 23 / 28
ual-logo
Outline
1 Introduction
2 Previous works
3 Proposed solution
4 Probabilistic interpretation of XTT2 rules
5 Probabilistic reasoning in XTT2 models
6 Implementation
7 Summary and future work
SBK+GJN (AGH-UST) Indect 5 August 2015 24 / 28
ual-logo
Prototype Implementation
Components
HeaRTDroid for deterministic reasoning and training set preparation
Translator XTT2 to BN
WEKA
Prototype reasoner that combines HeaRTDroid and WEKA
HeaRTDroidWeka
XTT2 Model
Translator XTT2 to BN
Hybrid Reasoner
States
SBK+GJN (AGH-UST) Indect 5 August 2015 25 / 28
ual-logo
Outline
1 Introduction
2 Previous works
3 Proposed solution
4 Probabilistic interpretation of XTT2 rules
5 Probabilistic reasoning in XTT2 models
6 Implementation
7 Summary and future work
SBK+GJN (AGH-UST) Indect 5 August 2015 26 / 28
ual-logo
Summary and future work
Summary
We provided probabilistic interpretation of XTT2 knowledge representation
We proposed a hybrid inference algorithm
We implemented prototype reasoner that binds HeaRTDroid, XTT2 andBayesian network representation of XTT2 into one hybrid reasoner
Future works
Make the reasoner part of HeaRTDroid
Evaluate the hybrid reasoning on the real-life use case