{"id":"W2036747135","doi":"10.1016/j.compbiolchem.2011.07.005","title":"A degree-distribution based hierarchical agglomerative clustering algorithm for protein complexes identification","year":2011,"lang":"en","type":"article","venue":"Computational Biology and Chemistry","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Hierarchical clustering; Partition (number theory); Hierarchical clustering of networks; Computer science; Cluster analysis; Measure (data warehouse); Data mining; Identification (biology); Hierarchical organization; Degree (music); Algorithm; Pattern recognition (psychology); Artificial intelligence; Mathematics; Fuzzy clustering; Canopy clustering algorithm; Biology","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.001776188,0.001173059,0.002105248,0.003011752,0.003113154,0.001658378,0.003866817,0.001650715,0.00249841],"category_scores_gemma":[0.004012711,0.001122781,0.002033006,0.003642154,0.0009459074,0.001791597,0.002275665,0.001745214,0.001993448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00171406,"about_ca_system_score_gemma":0.003849767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02026278,"about_ca_topic_score_gemma":0.02870218,"domain_scores_codex":[0.9984124,0.0003229637,0.0001265884,0.0003253698,0.0006732098,0.0001394365],"domain_scores_gemma":[0.9983505,0.0004595883,0.000105529,0.0003054363,0.0006698396,0.0001090766],"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.0006122154,0.0004398974,0.00339874,0.0003601178,0.0006059358,0.0002010203,0.0006518472,0.2400942,0.02200422,0.018752,0.01499437,0.6978853],"study_design_scores_gemma":[0.00005915012,0.0000372438,0.001137156,0.00001338116,0.00006730559,0.0001363993,0.00007364694,0.9791797,0.004760097,0.01059001,0.003898901,0.00004695462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008048552,0.0001406822,0.9894556,0.0001101937,0.00003412222,0.0001300295,0.0001710878,0.001461124,0.0004485601],"genre_scores_gemma":[0.04653163,0.0001116745,0.9501517,0.00005801036,0.0000181341,0.0001956502,0.0007577718,0.0003231211,0.001852324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02026278,"threshold_uncertainty_score":0.0402897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02156164124581855,"score_gpt":0.2575647815886553,"score_spread":0.2360031403428367,"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."}}