{"id":"W2006707333","doi":"10.1016/s0925-7721(02)00102-5","title":"Fast approximations for sums of distances, clustering and the Fermat–Weber problem","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fermat's Last Theorem; Mathematics; Cluster analysis; Dimension (graph theory); Combinatorics; Randomized algorithm; Euclidean geometry; Preprocessor; Constant (computer programming); Set (abstract data type); Point (geometry); Approximation algorithm; Discrete mathematics; Algorithm; Computer science; Geometry; Statistics; 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.003812445,0.001479074,0.002328821,0.002892112,0.001678145,0.003146112,0.003832527,0.002629686,0.005599998],"category_scores_gemma":[0.02762563,0.001155459,0.001297749,0.004120417,0.002512891,0.008760001,0.004670608,0.003613587,0.001563891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002607667,"about_ca_system_score_gemma":0.001527305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003924944,"about_ca_topic_score_gemma":0.004779537,"domain_scores_codex":[0.9980763,0.0006129551,0.0001180685,0.0003185029,0.000706484,0.0001676533],"domain_scores_gemma":[0.993288,0.004614235,0.0004265078,0.0007953144,0.0005520589,0.0003238881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004566909,0.000103336,0.0009899592,0.0004093577,0.0001071361,0.0001381025,0.0003952593,0.3209707,0.002026311,0.5017212,0.01153163,0.1611503],"study_design_scores_gemma":[0.00002228931,0.00002195927,0.0001487852,0.00002504964,0.00001291413,0.00007934944,0.00005668772,0.6866023,0.0006340368,0.3097719,0.002605094,0.00001965093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02343458,0.001230844,0.97049,0.0006486406,0.0002259115,0.00004253721,0.0001317387,0.0004425636,0.003353079],"genre_scores_gemma":[0.2204327,0.001142642,0.7671581,0.0002286797,0.0002843875,0.000188348,0.0007160047,0.000544909,0.009304246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005599998,"threshold_uncertainty_score":0.0201624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01932622633743269,"score_gpt":0.2275792836494696,"score_spread":0.2082530573120369,"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."}}