Periodic Time Series Data Analysis by Deep Learning Methodology
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.
Bibliographic record
Abstract
The detection of periodicity in a time series is considered a challenge in many research areas. The difficulty of period length extraction involves the varying noise levels among working environments. A system that performs well in one environment may not be accurate in another. Different methods, including deep neural networks, have been proposed across many applications to find suitable solutions to the period length extraction problem. This article proposes a convolutional neural network (CNN) based period classification algorithm, named PCA, to detect the dataset periods. In particular, assuming that a data stream contains periodical features, the PCA utilizes historical labeled data as training material and classifies new instances accordingly based on their periods. Its performance has been tested on both synthetic and real-world periodic time series data (PTSD) with very encouraging results. In particular, We have observed that the PCA is capable of achieving 100% accuracy in the case of low noise PTSD. Even the training of the PCA is not economical if the data do not contain much noise, it still demonstrates high performance on both synthetic and real-world datasets. Besides, we have shown that our new algorithm can capture the relationship between the shape of the waves and the target period, which is significantly different from the classical methods that mainly focus on the wave's amplitude.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.004 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it