{"id":"W3090078726","doi":"10.20382/jocg.v11i1a11","title":"An improved cost function for hierarchical cluster trees","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Ohio State University; National Science Foundation","keywords":"Hierarchical clustering; Cluster analysis; Granularity; Tree (set theory); Function (biology); Mathematics; Graph; Similarity (geometry); Tree structure; Computer science; Set (abstract data type); Hierarchical clustering of networks; Data mining; Algorithm; Correlation clustering; Combinatorics; CURE data clustering algorithm; Artificial intelligence; Statistics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004222701,0.0001346164,0.0002437565,0.001105265,0.0001296564,0.0001280115,0.00092409,0.00008266805,0.00002645342],"category_scores_gemma":[0.00005326219,0.0001357151,0.0001702551,0.0009378103,0.00005108683,0.001569181,0.0001650254,0.0003103836,0.00001072758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002324358,"about_ca_system_score_gemma":0.0002623531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002927521,"about_ca_topic_score_gemma":0.000001730117,"domain_scores_codex":[0.9985156,0.0001135467,0.0002829862,0.000274303,0.0005375901,0.0002759925],"domain_scores_gemma":[0.9978933,0.0005335857,0.0002840828,0.0002341601,0.000825826,0.0002290349],"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.001039562,0.0002981387,0.001046842,0.00004855289,0.0001835622,0.00004535111,0.0001905847,0.8639044,0.002182045,0.01684931,0.0003532193,0.1138584],"study_design_scores_gemma":[0.003598334,0.002037266,0.00921838,0.0000303955,0.00002149704,0.0001051912,0.0001411463,0.9542325,0.0001519749,0.006785677,0.02343495,0.0002427287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1010824,0.00001430294,0.8973471,0.0005105674,0.0004936161,0.0002521406,0.000009540297,0.00003300637,0.0002572883],"genre_scores_gemma":[0.7817234,0.000005835636,0.2166225,0.0002292153,0.000228208,6.022067e-7,0.0000126684,0.00001535789,0.001162142],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6807246,"threshold_uncertainty_score":0.5534301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01200130474763249,"score_gpt":0.2603167225421988,"score_spread":0.2483154177945663,"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."}}