{"id":"W1988109548","doi":"10.1007/s10489-008-0144-9","title":"STNR: A suffix tree based noise resilient algorithm for periodicity detection in time series databases","year":2008,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Noise (video); Suffix tree; Algorithm; Series (stratigraphy); Suffix; Tree (set theory); Sequence (biology); Time series; Symbol (formal); Data structure; Data mining; Artificial intelligence; Machine learning; Mathematics","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.0003124464,0.0002268162,0.0002505484,0.0001760647,0.0003151232,0.00007980805,0.0009401157,0.00006956,0.00003473389],"category_scores_gemma":[0.0000443948,0.0002112193,0.00006247285,0.0005046126,0.0001500435,0.0005695148,0.0003348428,0.0001693733,0.00009527078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007547077,"about_ca_system_score_gemma":0.0001054362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001408074,"about_ca_topic_score_gemma":0.00006791129,"domain_scores_codex":[0.9981309,0.00003925532,0.0003760039,0.000695691,0.0003668447,0.000391304],"domain_scores_gemma":[0.99871,0.0001941751,0.0001103153,0.0008025307,0.00007087307,0.0001121211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001401772,0.0003865153,0.0001609959,0.00002676357,0.000008310876,0.00004980135,0.0005356285,0.0009662451,0.009508663,0.002611275,0.000864106,0.9847415],"study_design_scores_gemma":[0.0003257926,0.0002154035,0.001447766,0.00004344378,0.000005170339,0.00002586742,0.0000521347,0.73291,0.2556092,0.0007707374,0.008202065,0.0003923842],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009928042,0.00008819366,0.9887587,0.00005838356,0.0001573457,0.000536602,0.00005996018,0.0001672987,0.0002454828],"genre_scores_gemma":[0.3310532,0.00009845295,0.6676923,0.000323897,0.0001284506,0.0003729803,0.0000996704,0.00002571933,0.0002053349],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9843491,"threshold_uncertainty_score":0.8613272,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02542355260735932,"score_gpt":0.253906476987624,"score_spread":0.2284829243802647,"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."}}