{"id":"W2943003953","doi":"10.1007/s11280-019-00686-w","title":"Mining top-k sequential patterns in transaction database graphs","year":2019,"lang":"en","type":"article","venue":"World Wide Web","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China; Ministry of Science and Technology","keywords":"Computer science; Database transaction; Graph database; Database; Graph; Sequence (biology); Sequence database; Vertex (graph theory); Transaction data; Theoretical computer science; Algorithm","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.0006232623,0.0006552643,0.0009457835,0.005625619,0.0009337617,0.001986901,0.001256734,0.0009747898,0.001415197],"category_scores_gemma":[0.007300369,0.0005781634,0.001227397,0.00519665,0.0004685214,0.002928434,0.0007086911,0.001077943,0.0006839794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005908044,"about_ca_system_score_gemma":0.001234888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004313365,"about_ca_topic_score_gemma":0.01041456,"domain_scores_codex":[0.9987198,0.0001393675,0.0001739204,0.0003697177,0.0004448418,0.0001523775],"domain_scores_gemma":[0.9941921,0.003067167,0.0007777713,0.0006806861,0.0009269119,0.0003553462],"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.00150829,0.001116525,0.242461,0.002150295,0.001291426,0.005184094,0.001123874,0.08212128,0.02453131,0.02275682,0.0270744,0.5886807],"study_design_scores_gemma":[0.0001152053,0.0004257954,0.040906,0.0002429429,0.0008907516,0.00471302,0.001516084,0.7794816,0.01303899,0.1440035,0.01459584,0.00007022754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6537718,0.003526662,0.3200319,0.001672841,0.0002466891,0.0004389715,0.01339955,0.002808329,0.004103316],"genre_scores_gemma":[0.8645986,0.001013648,0.1201988,0.0001777504,0.00009464249,0.000144168,0.01130904,0.0001527162,0.002310545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005625619,"threshold_uncertainty_score":0.008576512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01612727833813928,"score_gpt":0.2525454430266931,"score_spread":0.2364181646885539,"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."}}