{"id":"W2235825999","doi":"10.1007/978-3-662-44415-3_9","title":"A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Hasler Stiftung; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Edit distance; Hausdorff distance; Computer science; Computation; Heuristic; Matching (statistics); Algorithm; Graph; Theoretical computer science; Computational complexity theory; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013514,0.0004817996,0.0006654782,0.0008202984,0.0002583976,0.0002194595,0.002493756,0.0002250804,0.000003253099],"category_scores_gemma":[0.000139099,0.0004420438,0.0002515369,0.0006867929,0.0009977531,0.0001608394,0.0005124592,0.0004033134,0.000007873447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009960325,"about_ca_system_score_gemma":0.0002320907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004182849,"about_ca_topic_score_gemma":0.000008424907,"domain_scores_codex":[0.9964982,0.00004920285,0.0006784776,0.001346451,0.0008445078,0.0005831293],"domain_scores_gemma":[0.9969114,0.0009742563,0.0005390119,0.0009881789,0.0004374053,0.0001497248],"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.00001883049,0.0000518452,0.000008104214,0.0001951767,0.00001586835,0.00001271858,0.0006537073,0.288893,0.00007867664,0.306831,0.00002824182,0.4032128],"study_design_scores_gemma":[0.0002978391,0.000208743,0.00002775609,0.0003562464,0.000009362402,0.00001355069,1.179143e-7,0.6111726,0.0005466797,0.3866964,0.0003177117,0.0003530242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00009392786,0.0003429298,0.9952407,0.0002023519,0.002946883,0.0006138717,0.00001937166,0.0001099634,0.0004299455],"genre_scores_gemma":[0.5838618,0.000009497439,0.4151201,0.0003733244,0.000453699,0.0000215366,0.00001063237,0.00003445761,0.0001150308],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5837678,"threshold_uncertainty_score":0.9998031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009986013772851765,"score_gpt":0.2334601779373866,"score_spread":0.2234741641645348,"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."}}