{"id":"W2998525497","doi":"","title":"WeFreS: weighted frequent subgraph mining in a single large graph","year":2019,"lang":"en","type":"article","venue":"Mspace (University of Manitoba)","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Induced subgraph isomorphism problem; Data mining; Theoretical computer science; Line graph; Voltage graph","routes":{"ca_aff":true,"ca_fund":true,"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.001377382,0.0009101475,0.0007566062,0.004106264,0.0007562822,0.001001841,0.001665925,0.0009317106,0.002196364],"category_scores_gemma":[0.008609583,0.0004885657,0.001296045,0.003036728,0.0003787722,0.001942403,0.001222913,0.000588696,0.0008905961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003835409,"about_ca_system_score_gemma":0.00111167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002604554,"about_ca_topic_score_gemma":0.007213044,"domain_scores_codex":[0.9988794,0.000244028,0.0001267777,0.0003226371,0.0003083647,0.0001187244],"domain_scores_gemma":[0.9973682,0.001354594,0.0003234321,0.0005038165,0.0003339756,0.0001160873],"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.0007568301,0.0003605349,0.03421818,0.0009544715,0.0007211995,0.001204995,0.000662764,0.0759168,0.04107065,0.01467391,0.02798416,0.8014755],"study_design_scores_gemma":[0.0001088202,0.0002547092,0.006857134,0.00009117612,0.0001342044,0.001629812,0.0003991188,0.9129751,0.02064246,0.03753127,0.01932888,0.0000472183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09643798,0.000489525,0.8842831,0.0003454792,0.00007564639,0.0004382261,0.004356557,0.01198187,0.001591668],"genre_scores_gemma":[0.1954159,0.0001949669,0.7935692,0.0001095586,0.00003011893,0.0002853071,0.008700359,0.000392999,0.001301602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004106264,"threshold_uncertainty_score":0.007347584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01306810465812657,"score_gpt":0.1927067657575053,"score_spread":0.1796386610993787,"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."}}