MétaCan
Menu
Back to cohort
Record W2005833134 · doi:10.1109/is.2012.6335132

Periodicity data mining in time series using Suffix Arrays

2012· article· en· W2005833134 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
TopicAlgorithms and Data Compression
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceData miningSuffixTime seriesSeries (stratigraphy)Time complexityData structureAlgorithmMachine learning

Abstract

fetched live from OpenAlex

This research paper focuses on data mining in time series and its applications on financial data. Data-mining attempts to analyze time series and extract valuable information about pattern periodicity, which might be concealed by substantial amounts of unformatted, random information. Such information, however, is of great importance as it can be used to forecast future behavior. In this paper, a new methodology is introduced aiming to utilize Suffix Arrays in data mining instead of the commonly used data structure Suffix Trees. Although Suffix Arrays, normally, require high storage capacity, the algorithm proposed allows them to be constructed in linear time. The methodology is also extended to detect repeated patterns in time series with time complexity of. This, combined with the capability of external storage, creates a critical advantage, for an overall efficient data mining and analysis regarding the construction of time series data structure and periodicity detection. The test results, presented below demonstrate the applicability and effectiveness of the proposed technique.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.960
Threshold uncertainty score0.279

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.004
Open science0.0010.002
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.066
GPT teacher head0.291
Teacher spread0.225 · 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
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicAlgorithms and Data CompressionFrench-language works237,207