MétaCan
Menu
Back to cohort

Logistic Model Tree for Human Activity Recognition Using Smartphone-Based Inertial Sensors

2019· article· en· W2999753048 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicContext-Aware Activity Recognition Systems
Canadian institutionsCarleton University
Fundersnot available
KeywordsRandom forestComputer scienceActivity recognitionArtificial intelligenceInertial measurement unitTree (set theory)Logistic regressionDecision treeMachine learningData miningSet (abstract data type)Data setPattern recognition (psychology)Mathematics

Abstract

fetched live from OpenAlex

Human Activity Recognition (HAR) systems using sensor data have widespread use in many real-life applications, making it an important emerging area of research. As inertial sensors are readily available in many handheld devices, HAR systems are generally designed based on the data obtained from them. In this paper, the Logistic Model Trees (LMT) machine learning method for predicting the human motion from smartphone-based inertial sensors is considered. This study aims to demonstrate the capabilities of LMT in obtaining higher prediction rates even with short time segment of data (1 sec), in comparison with longer time segments (2.5 sec) used in the literature. The performance of HAR system designed with LMT is compared with those designed with Random Forest (RF) and Logistic Regression Tree (LR) for a set of dynamic and static activities. The system is trained and tested on two publically available datasets, namely WISDM and UCI HAR. The proposed LMT method outperforms RF and LR by achieving recognition accuracies 90.86% and 94.02% on WISDM and UCI HAR respectively, and achieves between 89.82% - 88.73% overall accuracy during cross-dataset evaluation.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.933
Threshold uncertainty score0.931

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.170
GPT teacher head0.327
Teacher spread0.157 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it