{"id":"W2103991913","doi":"10.1093/bioinformatics/btg030","title":"<i>K</i>-ary clustering with optimal leaf ordering for gene expression data","year":2003,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"Leverhulme Trust; Florida State University; Natural Sciences and Engineering Research Council of Canada; Burroughs Wellcome Fund","keywords":"Cluster analysis; Hierarchical clustering; Computer science; Tree (set theory); Binary tree; Pairwise comparison; Hierarchical clustering of networks; Single-linkage clustering; Robustness (evolution); CURE data clustering algorithm; Data mining; Algorithm; Nearest-neighbor chain algorithm; Correlation clustering; Canopy clustering algorithm; Tree structure; Mathematics; Artificial intelligence; Gene; Biology; Combinatorics; Genetics","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.0004352963,0.000183532,0.0001763087,0.0001025016,0.0002421556,0.0002511642,0.001585623,0.0000593692,0.000004228434],"category_scores_gemma":[0.0001802609,0.0001499872,0.00002537266,0.0002830002,0.0000460651,0.002003104,0.001133139,0.0001461407,0.00001721414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005156801,"about_ca_system_score_gemma":0.0001529818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002000756,"about_ca_topic_score_gemma":0.000001940493,"domain_scores_codex":[0.9984377,0.00002174524,0.0003223815,0.0003071792,0.0003949802,0.0005159879],"domain_scores_gemma":[0.9979311,0.0001148015,0.0001195792,0.001555635,0.0001027633,0.0001761741],"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.0003343166,0.0004214087,0.0002406022,0.00278609,0.0002267104,0.0001238494,0.01016453,0.4575956,0.02336447,0.005136206,0.006969645,0.4926365],"study_design_scores_gemma":[0.0007020261,0.0001400371,0.000006820253,0.00006884495,0.000003430689,0.0001008807,0.0001614093,0.9643651,0.01651857,0.00004907758,0.01763409,0.0002497676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007065247,0.00006439203,0.997188,0.00005917369,0.0001720068,0.0003796126,0.00002038311,0.0001837565,0.001226172],"genre_scores_gemma":[0.005356442,0.00002357149,0.9941798,0.00009599646,0.00004178732,0.00003505057,0.00002943534,0.00002211996,0.0002158279],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5067694,"threshold_uncertainty_score":0.6116299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0550618501563367,"score_gpt":0.306350724116407,"score_spread":0.2512888739600703,"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."}}