A Causality-Aware Pattern Mining Scheme for Group Activity Recognition in a Pervasive Sensor Space

• URL: http://arxiv.org/abs/2312.00404v1
• Date: Fri, 1 Dec 2023 07:54:07 GMT
• Title: A Causality-Aware Pattern Mining Scheme for Group Activity Recognition in a Pervasive Sensor Space
• Authors: Hyunju Kim, Heesuk Son, Dongman Lee
• Abstract summary: We propose an efficient group activity recognition scheme for HAR in a smart space. A set of rules is leveraged to highlight causally related events in a given data stream. A pattern-tree algorithm extracts frequent causal patterns by means of a growing tree structure. Experiment results show that the proposed scheme performs higher recognition accuracy and with a small amount of runtime overhead.
• Score: 2.5486448837945765
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Human activity recognition (HAR) is a key challenge in pervasive computing and its solutions have been presented based on various disciplines. Specifically, for HAR in a smart space without privacy and accessibility issues, data streams generated by deployed pervasive sensors are leveraged. In this paper, we focus on a group activity by which a group of users perform a collaborative task without user identification and propose an efficient group activity recognition scheme which extracts causality patterns from pervasive sensor event sequences generated by a group of users to support as good recognition accuracy as the state-of-the-art graphical model. To filter out irrelevant noise events from a given data stream, a set of rules is leveraged to highlight causally related events. Then, a pattern-tree algorithm extracts frequent causal patterns by means of a growing tree structure. Based on the extracted patterns, a weighted sum-based pattern matching algorithm computes the likelihoods of stored group activities to the given test event sequence by means of matched event pattern counts for group activity recognition. We evaluate the proposed scheme using the data collected from our testbed and CASAS datasets where users perform their tasks on a daily basis and validate its effectiveness in a real environment. Experiment results show that the proposed scheme performs higher recognition accuracy and with a small amount of runtime overhead than the existing schemes.

Related papers

• Mining Java Memory Errors using Subjective Interesting Subgroups with Hierarchical Targets [1.188383832081829]
  Subgroup Discovery (SD) is a data mining method that can automatically mine incident code and extract discriminant patterns to identify the root causes of issues. We propose a novel SD approach that can handle complex target concepts with hierarchies. We apply this framework to investigate out-of-memory errors and demonstrate its usefulness in incident diagnosis.
  arXiv  Detail & Related papers  (2023-10-01T20:24:59Z)
• On the Universal Adversarial Perturbations for Efficient Data-free Adversarial Detection [55.73320979733527]
  We propose a data-agnostic adversarial detection framework, which induces different responses between normal and adversarial samples to UAPs. Experimental results show that our method achieves competitive detection performance on various text classification tasks.
  arXiv  Detail & Related papers  (2023-06-27T02:54:07Z)
• Towards Sequence Utility Maximization under Utility Occupancy Measure [53.234101208024335]
  In the database, although utility is a flexible criterion for each pattern, it is a more absolute criterion due to neglect of utility sharing. We first define utility occupancy on sequence data and raise the problem of High Utility-Occupancy Sequential Pattern Mining. An algorithm called Sequence Utility Maximization with Utility occupancy measure (SUMU) is proposed.
  arXiv  Detail & Related papers  (2022-12-20T17:28:53Z)
• Cluster-level pseudo-labelling for source-free cross-domain facial expression recognition [94.56304526014875]
  We propose the first Source-Free Unsupervised Domain Adaptation (SFUDA) method for Facial Expression Recognition (FER) Our method exploits self-supervised pretraining to learn good feature representations from the target data. We validate the effectiveness of our method in four adaptation setups, proving that it consistently outperforms existing SFUDA methods when applied to FER.
  arXiv  Detail & Related papers  (2022-10-11T08:24:50Z)
• Alignment-based conformance checking over probabilistic events [4.060731229044571]
  We introduce a weighted trace model and weighted alignment cost function, and a custom threshold parameter that controls the level of confidence on the event data. The resulting algorithm considers activities of lower but sufficiently high probability that better align with the process model.
  arXiv  Detail & Related papers  (2022-09-09T14:07:37Z)
• Task Agnostic and Post-hoc Unseen Distribution Detection [27.69612483621752]
  We propose a task-agnostic and post-hoc Unseen Distribution Detection (TAPUDD) method. It comprises of TAP-Mahalanobis, which clusters the training datasets' features and determines the minimum Mahalanobis distance of the test sample from all clusters. We show that our method can detect unseen samples effectively across diverse tasks and performs better or on-par with the existing baselines.
  arXiv  Detail & Related papers  (2022-07-26T17:55:15Z)
• Towards Target High-Utility Itemsets [2.824395407508717]
  In applied intelligence, utility-driven pattern discovery algorithms can identify insightful and useful patterns in databases. Targeted high-utility itemset mining has emerged as a key research topic. We propose THUIM (Targeted High-Utility Itemset Mining), which can quickly match high-utility itemsets during the mining process to select the targeted patterns.
  arXiv  Detail & Related papers  (2022-06-09T18:42:58Z)
• Causal Scene BERT: Improving object detection by searching for challenging groups of data [125.40669814080047]
  Computer vision applications rely on learning-based perception modules parameterized with neural networks for tasks like object detection. These modules frequently have low expected error overall but high error on atypical groups of data due to biases inherent in the training process. Our main contribution is a pseudo-automatic method to discover such groups in foresight by performing causal interventions on simulated scenes.
  arXiv  Detail & Related papers  (2022-02-08T05:14:16Z)
• End-to-end Person Search Sequentially Trained on Aggregated Dataset [1.9766522384767227]
  We propose a new end-to-end model that jointly computes detection and feature extraction steps. We show that aggregating more pedestrian detection datasets without costly identity annotations makes the shared feature maps more generic.
  arXiv  Detail & Related papers  (2022-01-24T11:22:15Z)
• Reliable Shot Identification for Complex Event Detection via Visual-Semantic Embedding [72.9370352430965]
  We propose a visual-semantic guided loss method for event detection in videos. Motivated by curriculum learning, we introduce a negative elastic regularization term to start training the classifier with instances of high reliability. An alternative optimization algorithm is developed to solve the proposed challenging non-net regularization problem.
  arXiv  Detail & Related papers  (2021-10-12T11:46:56Z)
• Learning Constraints and Descriptive Segmentation for Subevent Detection [74.48201657623218]
  We propose an approach to learning and enforcing constraints that capture dependencies between subevent detection and EventSeg prediction. We adopt Rectifier Networks for constraint learning and then convert the learned constraints to a regularization term in the loss function of the neural model.
  arXiv  Detail & Related papers  (2021-09-13T20:50:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.