MétaCan
Menu
Back to cohort
Record W2057310371 · doi:10.1109/cidm.2013.6597220

Discovery of topological relations for spatial Activity Recognition

2013· article· en· W2057310371 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
TopicData Management and Algorithms
Canadian institutionsUniversité du Québec à Chicoutimi
Fundersnot available
KeywordsExploitComputer scienceActivity recognitionWearable computerUbiquitous computingMachine learningArtificial intelligenceHuman–computer interactionComputer securityEmbedded system

Abstract

fetched live from OpenAlex

Human Activity Recognition (HAR) is a challenging problem that could enable an outstanding number of applications in pervasive computing. Many approaches have been developed to overcome this issue, but they all suffer from major drawbacks. While some use invasive sensors such as video-cameras and wearable technology, other exploit complex models to only recognize coarse-grained activities. In this paper, we propose to exploit the largely neglected spatial aspects in the smart home to recognize the activity of daily living (ADLs) of a resident in a noninvasive fashion. To do so, we designed an extension to well-known data mining algorithms that we exploit to automatically learn the models of the resident ADLs. The models are built from the retrieval of spatial patterns corresponding to the topological relationships of the smart home entities. We demonstrate the advantages of our new semi-supervised system through comprehensive experiments inside a smart home and compare the results with expert defined models of 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.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.858
Threshold uncertainty score0.116

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.002
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.038
GPT teacher head0.256
Teacher spread0.219 · 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

Quick stats

Citations11
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicData Management and AlgorithmsFrench-language works237,207