{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001076001,0.0008581607,0.001595367,0.003159926,0.0006035541,0.002123432,0.001714038,0.002149624,0.003549265],"category_scores_gemma":[0.005374121,0.0007006811,0.001486711,0.003310781,0.001428467,0.002492206,0.002380383,0.001360221,0.001053775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009570791,"about_ca_system_score_gemma":0.0007326039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002896059,"about_ca_topic_score_gemma":0.002161482,"domain_scores_codex":[0.9985507,0.0002504636,0.00009800019,0.0004859569,0.0005350779,0.00007983232],"domain_scores_gemma":[0.9980414,0.0008050378,0.0002394489,0.0005178259,0.0002887755,0.0001074171],"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.0001326132,0.00008625193,0.001287925,0.0003088998,0.0001018581,0.0003176391,0.0002400557,0.3964761,0.01371012,0.04378969,0.003022716,0.5405262],"study_design_scores_gemma":[0.000007919015,0.00003176554,0.0005009322,0.0000144127,0.00001064935,0.0002257811,0.00004272512,0.9623263,0.003982896,0.0291656,0.003673296,0.00001765672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006330266,0.0003712412,0.9912894,0.0001488582,0.00005325562,0.00003766724,0.00006894024,0.0008778638,0.0008224925],"genre_scores_gemma":[0.1782384,0.0008185782,0.8179061,0.0001555031,0.00009107638,0.0001062452,0.0003703077,0.000384743,0.001928976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003549265,"threshold_uncertainty_score":0.01187354,"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."}}