{"id":"W1496056286","doi":"10.1007/978-3-540-85126-4_8","title":"Density-Based Clustering Based on Topological Properties of the Data Set","year":2009,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Shortest path problem; Cluster analysis; Path (computing); K shortest path routing; Computer science; Set (abstract data type); Mathematical optimization; Simple (philosophy); Algorithm; Topology (electrical circuits); Mathematics; Theoretical computer science; Artificial intelligence; Combinatorics; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320535,0.0009606988,0.001622044,0.003647621,0.001156032,0.001941916,0.00273324,0.001137825,0.001800031],"category_scores_gemma":[0.007727347,0.0008315049,0.001204295,0.005643283,0.001113659,0.002919309,0.001686044,0.001320841,0.0009520589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001758663,"about_ca_system_score_gemma":0.001151968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008905607,"about_ca_topic_score_gemma":0.01046177,"domain_scores_codex":[0.9989187,0.0001997788,0.00007126322,0.000242685,0.0004989934,0.00006879183],"domain_scores_gemma":[0.9971415,0.001369508,0.0001701543,0.0004519693,0.0007837568,0.00008314648],"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.0001826377,0.0001316662,0.004316214,0.000529112,0.0002645784,0.00009812261,0.0004751706,0.3978654,0.009098152,0.047274,0.01046528,0.5292996],"study_design_scores_gemma":[0.00001367236,0.00003960736,0.002124594,0.00004715761,0.00004994978,0.0001976194,0.00009318143,0.9600667,0.003964598,0.03021525,0.003136144,0.00005145535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01268846,0.0009436203,0.982455,0.0001951508,0.00007386087,0.0001244479,0.0002075628,0.0007588485,0.002553226],"genre_scores_gemma":[0.2426817,0.00186136,0.7502216,0.0001196848,0.0001433001,0.0002789996,0.001301486,0.0003812045,0.003010751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008905607,"threshold_uncertainty_score":0.01770759,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3148305721766586,"score_gpt":0.3730323146751057,"score_spread":0.05820174249844706,"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."}}