{"id":"W2600673011","doi":"","title":"Inexact graph matching : application to 2D and 3D Pattern Recognition","year":2016,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Modular decomposition; Computer science; Lattice graph; Matching (statistics); Kite; Theoretical computer science; Pattern recognition (psychology); Graph; Algorithm; Artificial intelligence; Line graph; Mathematics; Pathwidth; Voltage graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007199298,0.0005449337,0.0004712394,0.0003823883,0.0007042332,0.00094953,0.001876366,0.0003603928,0.0001005542],"category_scores_gemma":[0.0004680812,0.0005530083,0.0002122259,0.0006703007,0.000318622,0.0006148407,0.002322188,0.0006518022,0.0003514974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001075807,"about_ca_system_score_gemma":0.0001431845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001117158,"about_ca_topic_score_gemma":0.0006625591,"domain_scores_codex":[0.9907567,0.005802957,0.0007471167,0.001582144,0.0005009262,0.0006101428],"domain_scores_gemma":[0.9929211,0.001705884,0.0006272761,0.002518285,0.001757513,0.0004699271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000852086,0.0002850156,0.0005367618,0.0001472678,0.00004684229,0.000004872184,0.01080189,0.00005326976,0.00256743,0.1307438,0.0001194103,0.8546849],"study_design_scores_gemma":[0.001514342,0.000004370068,0.01600964,0.009692121,0.000151982,0.0001342497,0.0002589097,0.05612888,0.0298516,0.8626571,0.02125251,0.002344278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04863103,0.0005637944,0.915343,0.02359746,0.0004998283,0.0007874348,0.0001301916,0.0002726617,0.01017458],"genre_scores_gemma":[0.8483418,0.0007976561,0.1451904,0.0006731002,0.0001117015,0.0003060614,0.0003115148,0.00007724587,0.004190521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8523406,"threshold_uncertainty_score":0.9996921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01489428916684796,"score_gpt":0.2226947104241731,"score_spread":0.2078004212573251,"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."}}