Towards a Real-time Error Detection within a Smart Home by Using Activity Recognition with a Shoe-mounted Accelerometer
Bibliographic record
Abstract
Taking care of the elders constitutes a major issue in the western societies. Smart homes appear to be a socially and economically viable solution. They consist in habitats augmented with sensors and actuators enabling to achieve activity recognition and to provide assistive services to a resident. Stationary aspect of sensors used in most smart homes makes the concept difficult to deploy in existing homes, and involves a high cost. In this paper, we propose an inexpensive non-vision-based system ably to recognize, in real-time, activities and errors of a resident. This proposed recognition system is based on a shoe equipped with a single sensor: a three-axis accelerometer and on a state- transition algorithmic approach using fuzzy logic. We have examined the learning data as frequency distributions, where the probability histograms have been directly interpreted as fuzzy set. We conducted experiments of the system in our smart home by simulating (multiple times) several scenarios based on a morning routine. These scenarios were based on clinical data gathered in a previous experiment with actual Alzheimer's patients. We obtained promising results showing that the proposed activity and error recognition system are highly effective.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".