{"id":"W2115139257","doi":"10.1109/tpami.2004.1265866","title":"An eigenspace projection clustering method for inexact graph matching","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":208,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; Eigenvalues and eigenvectors; Matching (statistics); Combinatorics; Graph homomorphism; Projection method; Graph; Theoretical computer science; Algorithm; Mathematics; Line graph; Artificial intelligence; Graph power; Dykstra's projection algorithm","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.0005698864,0.0002401824,0.0002933635,0.0007278481,0.0004249674,0.0002199072,0.0004212653,0.00007065207,0.00001371093],"category_scores_gemma":[0.000002390908,0.000213145,0.0003111023,0.001204487,0.0000363401,0.0005043312,0.000004385919,0.0002275801,0.00000412681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003308161,"about_ca_system_score_gemma":0.00001867495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001647794,"about_ca_topic_score_gemma":0.002739017,"domain_scores_codex":[0.9984656,0.0001153495,0.0003207785,0.0006337934,0.0001883782,0.0002760844],"domain_scores_gemma":[0.9990897,0.0001125262,0.0001065841,0.0004833417,0.00007222587,0.0001355888],"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.00001590247,0.000151721,0.00002614527,0.00001824367,0.0002567551,0.000003286535,0.001082324,0.4445331,0.001375669,0.0006121147,1.719083e-7,0.5519245],"study_design_scores_gemma":[0.0002365034,0.0004454069,0.000190459,0.00003375323,0.000402793,0.0000359456,0.0002394295,0.8053698,0.1676376,0.02497539,0.00001091319,0.0004220223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002943449,0.00002776352,0.9960901,0.0002442198,0.0002518717,0.0002376789,0.0000340666,0.000156997,0.00001386055],"genre_scores_gemma":[0.8985189,0.00006499442,0.101018,0.0002747142,0.0000245445,0.00005198726,0.000004647955,0.00001354748,0.00002865011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8955754,"threshold_uncertainty_score":0.8691801,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02158284435524615,"score_gpt":0.304401850513753,"score_spread":0.2828190061585069,"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."}}