Synthetic Behavior Sequence Generation Using Generative Adversarial Networks
Bibliographic record
Abstract
Due to the increase in life expectancy in advanced societies leading to an increase in population age, data-driven systems are receiving more attention to support the older people by monitoring their health. Intelligent sensor networks provide the ability to monitor their activities without interfering with routine life. Data collected from smart homes can be used in a variety of data-driven analyses, including behavior prediction. Due to privacy concerns and the cost and time required to collect data, synthetic data generation methods have been considered seriously by the research community. In this article, we introduce a new Generative Adversarial Network (GAN) algorithm, namely, BehavGAN , that applies GAN to the problem of behavior sequence generation. This is achieved by learning the features of a target dataset and utilizing a new application for GANs in the simulation of older people’s behaviors. We also propose an effective reward function for GAN back-propagation by incorporating n-gram-based similarity measures in the reinforcement mechanism. We evaluate our proposed algorithm by generating a dataset of human behavior sequences. Our results show that BehavGAN is more effective in generating behavior sequences compared to MLE, LeakGAN, and the original SeqGAN algorithms in terms of both similarity and diversity of generated data. Our proposed algorithm outperforms current state-of-the-art methods when it comes to generating behavior sequences consisting of limited-space sequence tokens.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.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".