{"id":"W2171446221","doi":"10.1109/is.2008.4670501","title":"Using suffix trees for periodicity detection in time series databases","year":2008,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Suffix; Pruning; Suffix tree; Computer science; Series (stratigraphy); Time series; Data mining; Symbol (formal); Sequence (biology); Dynamic time warping; Data structure; Algorithm; Generalized suffix tree; Pattern recognition (psychology); Artificial intelligence; Machine learning","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009697231,0.00007152191,0.00009449976,0.00006722019,0.0002039153,0.00005081313,0.0002666095,0.00002059535,0.00002017799],"category_scores_gemma":[0.00002311399,0.00005872713,0.00002372563,0.0001574832,0.00003370842,0.001210052,0.0002050884,0.00003856705,0.000008306925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002269978,"about_ca_system_score_gemma":0.0000330912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004044045,"about_ca_topic_score_gemma":0.0001926069,"domain_scores_codex":[0.9993821,0.0000198511,0.0001168998,0.0002217324,0.0001171501,0.0001422566],"domain_scores_gemma":[0.9996054,0.00003903721,0.00002970674,0.0002688273,0.00002416204,0.00003286385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006638605,0.001967184,0.06083273,0.0001764421,0.00007593668,0.0003163912,0.006071115,0.005420943,0.4685979,0.02316365,0.01400582,0.4187081],"study_design_scores_gemma":[0.0004753879,0.000116426,0.01418065,0.00002500443,0.000002412682,0.0001154392,0.00002674034,0.9183828,0.0565037,0.0002707493,0.009671303,0.0002293957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2340886,0.00002653301,0.7655149,0.00003059749,0.00007786531,0.00009013018,0.00001140322,0.00007323036,0.00008669682],"genre_scores_gemma":[0.4900183,0.00001919219,0.5093473,0.00008602943,0.00008477749,0.00001268041,0.00001855548,0.000006596049,0.0004065647],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9129618,"threshold_uncertainty_score":0.2394823,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06277645949789548,"score_gpt":0.2847816033280793,"score_spread":0.2220051438301839,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}