{"id":"W1484935596","doi":"10.1007/978-3-540-27868-9_60","title":"Matching Concavity Trees","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Matching (statistics); Tree (set theory); Representation (politics); Context (archaeology); Pattern matching; Tree structure; Node (physics); Pattern recognition (psychology); Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Binary tree","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.0006392536,0.0004835646,0.0009664844,0.002295702,0.001143723,0.00182223,0.00161531,0.001385214,0.01125844],"category_scores_gemma":[0.00503869,0.0008043721,0.0007677038,0.002283518,0.001024927,0.0028872,0.002910458,0.001711948,0.004322588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006749809,"about_ca_system_score_gemma":0.0006893796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001474321,"about_ca_topic_score_gemma":0.002304222,"domain_scores_codex":[0.9988206,0.0001710089,0.00006072312,0.0003239006,0.0004673983,0.0001563464],"domain_scores_gemma":[0.9979518,0.0005046376,0.0001490702,0.000830223,0.0004574901,0.000106763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004907657,0.0001700811,0.003097959,0.0002177977,0.00008036459,0.0003667674,0.0003580359,0.03168469,0.02145281,0.2626035,0.02794635,0.651531],"study_design_scores_gemma":[0.00004346888,0.0001438537,0.00218406,0.00008253304,0.00007469462,0.001032989,0.0002192946,0.4309765,0.02505577,0.4856285,0.05450732,0.00005116595],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08516106,0.0006345421,0.87076,0.0004345901,0.0001937115,0.0001768979,0.0008580438,0.002658739,0.03912244],"genre_scores_gemma":[0.4842465,0.0005399967,0.4762852,0.0003301016,0.0001858925,0.000151492,0.003541657,0.00168391,0.03303514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01125844,"threshold_uncertainty_score":0.03766328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01851273090228665,"score_gpt":0.2580426705247887,"score_spread":0.2395299396225021,"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."}}