Activities Recognition, Anomaly Detection and Next Activity Prediction Based on Neural Networks in Smart Homes
Bibliographic record
Abstract
In this paper, we propose a unified deep learning model for monitoring elderly in execution of daily life activities such as eating, sleeping or taking medication. The proposed approach consists of three stages which are activity recognition, anomaly detection and next activity prediction. Such a system can provide useful information for the elderly, caregivers and medical teams to identify activities and generate preventive and corrective measures. In literature, these stages are discussed separately, however, in our approach, we make use of each stage to progress into the next stage. At first, activity recognition based on different extracted features is performed using a deep neural network (DNN), then an overcomplete-deep autoencoder (OCD-AE) is employed to separate the normal from anomalous activities. Finally, a cleaned sequence of consecutive activities is constructed and used by a long short-term memory (LSTM) algorithm to predict the next activity. Since the last two stages depend on the activity recognition stage, we propose to increase its accuracy by exploiting different extracted features. The performance of the proposed unified approach has been evaluated on real smart home datasets to demonstrate its ability to recognize activities, detect anomalies and predict the next activity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".