{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005649147,0.000323831,0.0004677075,0.0001750549,0.0001529583,0.00003780547,0.00261419,0.0001339926,0.000004275249],"category_scores_gemma":[0.0003856326,0.0002249692,0.00008965719,0.0001455638,0.0005779819,0.00009075308,0.001201978,0.0004736274,0.00001790172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001470696,"about_ca_system_score_gemma":0.0002551294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008845531,"about_ca_topic_score_gemma":0.00001465698,"domain_scores_codex":[0.9975953,0.00009838713,0.000591285,0.0007260347,0.000760627,0.0002284131],"domain_scores_gemma":[0.997349,0.0008763997,0.0003187259,0.001129595,0.0002919667,0.00003426658],"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.00001507072,0.0000316609,0.0000279685,0.00007406096,0.00003113296,0.00003802314,0.0002500026,0.9707318,8.392054e-7,0.02083606,0.0002070699,0.007756291],"study_design_scores_gemma":[0.00006834883,0.0001236664,0.000137581,0.001474259,0.00001110284,0.00000918423,0.00002582848,0.9638987,0.00008513933,0.03364187,0.0002799514,0.0002443371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00002904779,0.001028695,0.9886096,0.002021599,0.001007422,0.000419479,0.00003910912,0.00008046049,0.006764663],"genre_scores_gemma":[0.5103793,0.00008457447,0.4802521,0.003426082,0.0002489614,0.00002224767,0.00006143656,0.00004407598,0.005481153],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5103503,"threshold_uncertainty_score":0.9173978,"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."}}