{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284443,0.0007986081,0.001632025,0.00230602,0.0008580115,0.001833639,0.001710003,0.001667784,0.001555543],"category_scores_gemma":[0.005666769,0.0006649427,0.001051604,0.002936475,0.001606858,0.003532902,0.002520435,0.001369723,0.0007071492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007599302,"about_ca_system_score_gemma":0.001001086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002804875,"about_ca_topic_score_gemma":0.002655972,"domain_scores_codex":[0.9982396,0.0006169552,0.00007821146,0.0004117638,0.0005512381,0.0001022552],"domain_scores_gemma":[0.9974775,0.0009944743,0.0003228561,0.0007577054,0.0003453259,0.000102214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000124342,0.00008428642,0.001129402,0.0001122201,0.0001362691,0.0001892314,0.0002585474,0.6610849,0.007894061,0.0599815,0.002088857,0.2669164],"study_design_scores_gemma":[0.000005084369,0.00001461991,0.0001659272,0.000004288849,0.000005983041,0.00005344203,0.00003427823,0.9637005,0.001767048,0.03366476,0.0005726113,0.00001147683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009115392,0.00008809091,0.9898493,0.00006747712,0.000009182724,0.00001857454,0.0000256138,0.0003339253,0.0004923313],"genre_scores_gemma":[0.2300316,0.0002307925,0.7672163,0.00007736525,0.0000345107,0.0001002213,0.0003437464,0.0001642874,0.001801212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002804875,"threshold_uncertainty_score":0.006792903,"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."}}