{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003645015,0.001409199,0.001864888,0.002441043,0.001109801,0.001913223,0.003600646,0.003036758,0.005621748],"category_scores_gemma":[0.01181097,0.0005466718,0.001514978,0.003394328,0.0009888894,0.005197858,0.002322358,0.002611193,0.001146519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003351697,"about_ca_system_score_gemma":0.002543148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005589978,"about_ca_topic_score_gemma":0.004632697,"domain_scores_codex":[0.9970371,0.000917497,0.0001549679,0.0003522382,0.00119089,0.0003472852],"domain_scores_gemma":[0.9949948,0.002145973,0.0003079747,0.000537781,0.001719317,0.0002942886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002333522,0.0001665398,0.001430188,0.0002597699,0.00006737715,0.0001610842,0.0001390022,0.703162,0.004308856,0.1148445,0.01414162,0.1610857],"study_design_scores_gemma":[0.00001226409,0.00004697012,0.0002534038,0.00001669566,0.00001077916,0.00006745964,0.00001881228,0.9782473,0.0007039233,0.01782306,0.002785462,0.00001369536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01142904,0.0005326101,0.9836873,0.0005246269,0.00009368736,0.0001477529,0.0002493246,0.0003850097,0.002950639],"genre_scores_gemma":[0.2527145,0.0007181219,0.734918,0.0004585945,0.0002047063,0.0006274726,0.001367736,0.0006242662,0.008366722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005621748,"threshold_uncertainty_score":0.0243184,"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."}}