Proceedings of the 2012 ACM Conference on Ubiquitous Computing 2012
DOI: 10.1145/2370216.2370443
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating the robustness of activity recognition using computational causal behavior models

Abstract: Activity recognition is a challenging research problem in ubiquitous computing domain and has to tackle omnipresent uncertainties, e.g., resulting from ambiguous or intermittent sensor readings. In this paper, we introduce an activity recognition approach based on causal modeling and probabilistic plan recognition. To evaluate the performance of our approach systematically, we generated sensor data with different error rates using a simulation. This data served as input for the activity recognition in a series… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 15 publications
(6 reference statements)
0
2
0
Order By: Relevance
“…A TP (TN) indicates a sample in the positive (negative) class was classified correctly, and an FP (FN) a sample in the negative (positive) class that was classified as positive (negative). The multi-class classification model of the confusion matrix can then be extrapolated as follows (Krüger, 2016), see Figure 4. Per row n ∈ C, the confusion matrix E ∈ N (N +1)×(N +1) comprises a 1 × (N + 1) vector whose n ′ -th entry is m:cm=n 1 {nm=n ′ } .…”
Section: Discussionmentioning
confidence: 99%
“…A TP (TN) indicates a sample in the positive (negative) class was classified correctly, and an FP (FN) a sample in the negative (positive) class that was classified as positive (negative). The multi-class classification model of the confusion matrix can then be extrapolated as follows (Krüger, 2016), see Figure 4. Per row n ∈ C, the confusion matrix E ∈ N (N +1)×(N +1) comprises a 1 × (N + 1) vector whose n ′ -th entry is m:cm=n 1 {nm=n ′ } .…”
Section: Discussionmentioning
confidence: 99%
“…To overcome the problem of the multi-interpretable nature of LTL, the author convert them into deterministic finite automatons such that they can be embedded as hierarchical graph into the loss calculation of the neural network's training process and achieve learning consistent to the LTL rules and better accuracy at classification. The works by Yordanaova et al [5] and Rueda et al [6] use computational causal behavioral models (CCBM) [20] to model domain knowledge and reason about the current state of the environment. CCBM also uses PPDL-like rules to describe the domain-specific properties of the activities.…”
Section: Related Workmentioning
confidence: 99%