{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001786889,0.00009804976,0.0001640959,0.0002809095,0.0001022034,0.00003458796,0.0008804677,0.00005745967,0.000009880997],"category_scores_gemma":[0.000004849288,0.0001237563,0.00006562829,0.0007725007,0.00004467908,0.000488912,0.0003130075,0.00009891564,0.00008974547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004775926,"about_ca_system_score_gemma":0.00003143917,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009963738,"about_ca_topic_score_gemma":0.04012405,"domain_scores_codex":[0.9990925,0.00003648301,0.0000829499,0.0003394724,0.0001962186,0.0002524383],"domain_scores_gemma":[0.9991918,0.00005075469,0.00009785443,0.0005450684,0.00005027848,0.00006431214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00005188865,0.002213676,0.7973374,0.0001928601,0.000173522,0.0002319134,0.009731495,0.0001385885,0.01322565,0.1199808,0.01957148,0.0371507],"study_design_scores_gemma":[0.004563616,0.0005672256,0.7577826,0.000396749,0.00004485513,0.00002204213,0.03678604,0.1047854,0.001543206,0.003526176,0.08884975,0.0011323],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9226967,0.00005978581,0.07335065,0.001082823,0.0001119747,0.0001564938,0.00002439951,0.00008652982,0.00243063],"genre_scores_gemma":[0.8982489,0.00002959063,0.1013608,0.00006209259,0.00001480934,5.936699e-7,0.0000188996,0.000008025848,0.0002563601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1164547,"threshold_uncertainty_score":0.9773912,"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."}}