{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00163636,0.0008474576,0.001374229,0.002139958,0.001091897,0.001328387,0.002250588,0.001830319,0.003479816],"category_scores_gemma":[0.004480198,0.0005774199,0.001089464,0.002229648,0.0016743,0.002503087,0.002261158,0.001988924,0.001840768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008330874,"about_ca_system_score_gemma":0.001276695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002777929,"about_ca_topic_score_gemma":0.002487994,"domain_scores_codex":[0.9981734,0.0005755369,0.00006601034,0.0004025443,0.0007028523,0.00007958486],"domain_scores_gemma":[0.9984195,0.0004766466,0.0001203493,0.0005308336,0.0003807301,0.00007192229],"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.0001541524,0.0001325898,0.000661201,0.0002011814,0.000145726,0.0002171717,0.000334558,0.3396819,0.02459366,0.2050346,0.005248612,0.4235947],"study_design_scores_gemma":[0.000008736372,0.00002451787,0.0001684781,0.000007791023,0.000009704216,0.0001031351,0.00002770692,0.9585459,0.003640506,0.03445698,0.00297682,0.00002972717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001713594,0.00006308052,0.9973259,0.00004577482,0.00001906023,0.00002325614,0.00001538724,0.0002579185,0.000535983],"genre_scores_gemma":[0.05852735,0.0001640499,0.9383032,0.00008528726,0.00004169679,0.0001309416,0.0001764288,0.0002307359,0.002340273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003479816,"threshold_uncertainty_score":0.01164114,"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."}}