{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002255808,0.0005429969,0.0007294404,0.003158512,0.0006949039,0.001148857,0.0007810962,0.0008352351,0.0009875087],"category_scores_gemma":[0.01199164,0.0003097027,0.0004972277,0.004942474,0.0004200155,0.002104607,0.0005837582,0.0006664971,0.0008019025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002340916,"about_ca_system_score_gemma":0.0007034068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006107678,"about_ca_topic_score_gemma":0.0007068797,"domain_scores_codex":[0.9984113,0.0004985176,0.0002925767,0.0002578896,0.0004715164,0.00006814717],"domain_scores_gemma":[0.9928201,0.004391652,0.0007730733,0.000994363,0.0009144066,0.0001064466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004118656,0.0001514678,0.007337518,0.0003195799,0.0001288564,0.0004984929,0.0003693609,0.0363098,0.03380623,0.01019469,0.004158601,0.9063137],"study_design_scores_gemma":[0.00007776242,0.0003116863,0.004258673,0.0001027933,0.0001008782,0.001525535,0.0002613026,0.8976628,0.04748557,0.03532251,0.01281432,0.00007622194],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05865634,0.0009120372,0.9365681,0.0001877611,0.00008442244,0.0000966388,0.0004740376,0.002020257,0.001000432],"genre_scores_gemma":[0.2198467,0.0008087705,0.7767609,0.00009819007,0.0001103781,0.0001368062,0.00144596,0.0001464839,0.0006458245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003158512,"threshold_uncertainty_score":0.01192999,"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."}}