{"id":"W2157149375","doi":"10.1142/s0218001404003186","title":"INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERING","year":2004,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Vertex (graph theory); Subspace topology; Combinatorics; Cluster analysis; Mathematics; Matching (statistics); Graph; Pattern recognition (psychology); Computer science; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004947439,0.0001329193,0.0001405038,0.0004184382,0.0001203963,0.0003433852,0.0004403645,0.00005180871,0.00002737031],"category_scores_gemma":[0.00004309209,0.0001240495,0.0001092718,0.0002134299,0.00005825107,0.001026474,0.0001014275,0.0002347138,0.00002014996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006327239,"about_ca_system_score_gemma":0.00005141207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008013094,"about_ca_topic_score_gemma":0.00003452701,"domain_scores_codex":[0.9986835,0.00006802884,0.0005216658,0.000196567,0.000371549,0.0001587284],"domain_scores_gemma":[0.9989694,0.00005557601,0.0003821155,0.00008607734,0.0004176789,0.00008911121],"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.00005525958,0.0001748677,0.0001226399,0.00001290734,0.00009301177,0.0001709657,0.003078385,0.009287976,0.01287442,0.003742893,0.000001395703,0.9703853],"study_design_scores_gemma":[0.0002602863,0.0002722249,0.0002437129,0.0006362093,0.00002538335,0.002157284,0.001564764,0.03840021,0.08226121,0.8737547,0.00003372914,0.0003902338],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3061132,0.00003752833,0.6919987,0.0004446726,0.001289448,0.00004934931,0.000004177219,0.00002032811,0.00004256922],"genre_scores_gemma":[0.9781075,0.0000935957,0.02109786,0.0003010662,0.0003846202,0.000001507677,0.000002411398,0.000008354251,0.000003072656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.969995,"threshold_uncertainty_score":0.505859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08839100040127454,"score_gpt":0.3158971288049581,"score_spread":0.2275061284036836,"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."}}