{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002115394,0.001072253,0.001203182,0.002406828,0.001857343,0.001616001,0.002739578,0.001859837,0.004141501],"category_scores_gemma":[0.01025134,0.0008082603,0.001219742,0.004193914,0.00123501,0.00193353,0.002185735,0.001972206,0.00544974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550411,"about_ca_system_score_gemma":0.002454538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006121623,"about_ca_topic_score_gemma":0.008840216,"domain_scores_codex":[0.9979377,0.0004461702,0.0001885449,0.0005006033,0.0007726861,0.0001542805],"domain_scores_gemma":[0.9969487,0.0009310616,0.0003253991,0.0009291266,0.0006864117,0.0001793366],"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.0006282751,0.000357411,0.004625145,0.0006794899,0.0001286519,0.0002718981,0.0008622683,0.1810596,0.04641232,0.02183096,0.03661605,0.7065279],"study_design_scores_gemma":[0.00008747509,0.00008242814,0.001317839,0.00003989337,0.00002166478,0.000216292,0.00008967266,0.9379001,0.0194751,0.03069058,0.01002718,0.00005176188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006297597,0.0001145863,0.9838688,0.0001713091,0.00003039016,0.000114093,0.0004208825,0.008386512,0.0005958102],"genre_scores_gemma":[0.02429341,0.00006083597,0.9731079,0.00005941912,0.0000144548,0.0001536757,0.001178359,0.0005686024,0.0005633194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006121623,"threshold_uncertainty_score":0.01385474,"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."}}