MétaCan
Menu
Back to cohort
Record W2027111352 · doi:10.1108/17427371211262644

Novel model for inhabitants prediction in smart houses

2012· article· en· W2027111352 on OpenAlexaff
Rachid Kadouche, Bessam Abdulrazak

Bibliographic record

VenueInternational Journal of Pervasive Computing and Communications · 2012
Typearticle
Languageen
FieldComputer Science
TopicContext-Aware Activity Recognition Systems
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsComputer scienceSupport vector machineFeature selectionClassifier (UML)Artificial intelligenceMachine learningData miningFeature (linguistics)Pattern recognition (psychology)

Abstract

fetched live from OpenAlex

Purpose The purpose of this paper is to present a novel model for inhabitant prediction in smart houses based on daily life activities. It uses data provided by non intrusive sensors and devices to predict the house occupant. The authors' model, named Behavior Classification Model (BCM), applies Support Vector Machines (SVM) classifier to learn the users' habits when they perform activities, and then predicts the user. BCM was tested using real data and compared with a frequency based approach. In this paper the authors present also their approach to improve the accuracy of BCM using SVM feature selection algorithm. Design/methodology/approach The model, named Behavior Classification Model (BCM), applies Support Vector Machines (SVM) classifier to learn the users' habits when they perform activities, and then predicts the user. Findings BCM was tested using real data and compared with a frequency based approach. In this paper the authors' also present their approach to improve the accuracy of BCM using SVM feature selection algorithm. Originality/value The paper is based on blind user recognition in smart homes.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.014
Threshold uncertainty score0.028

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.101
GPT teacher head0.346
Teacher spread0.245 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations2
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Pervasive Computing and CommunicationsSame topicContext-Aware Activity Recognition SystemsFrench-language works237,207