Transfer learning for estimating occupancy and recognizing activities in smart buildings
Bibliographic record
Abstract
Activities Recognition (AR) and Occupancy Estimation (OE) are vital to many smart systems that work on providing good services in smart buildings . Many applications, such as energy management need information like activities and occupancy to provide good assistance. Most of the previous research about AR and OE focused on applying supervised machine learning methods . Researchers train a model and evaluate it using data collected from the same environment (Domain). A model trained in a specific domain will not generalize well in other domains. Creating a trained model to every environment is not feasible due to the lack of data. Collecting sufficient data can be time consuming and infeasible in some cases. Computational power can be a challenge for researchers by increasing the training time due to the lack of the required computing resources. Using traditional machine learning methods, the obtained performance may be unsatisfactory, and can not lead to optimal solutions. For all these reasons, we need a solution that helps us overcome the stated problem and obtain models with acceptable results. In this work, we present and discuss different transfer learning methods that help us transfer knowledge from a source domain to a target domain. The goal is to reuse as much as possible information from the source domain to enhance the performance of the model at the target domain. This type of approaches will solve the problems mentioned before such as the lack of data and will provide us with good results due to the use of knowledge from multiple source domains. We tested five Transfer learning (TL) approaches: a principal component analysis (PCA)-like method that creates a transformation like the PCA transformation and apply it to the data to create new common domain, a PCA based method that creates common domain using PCA, a PCA-SMOTE method that balances the data and creates common domain, a basic method based on a simple matching between similar features from source and target domain, and a sparse coding-based method that creates a common domain where the data representation will be as sparse as possible. The impressive results that we obtained in both tasks prove that the presented methods can be applied to transfer knowledge across different domains.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".