{"id":"W1500622093","doi":"10.1007/978-3-642-11164-8_100","title":"Evolutionary and Iterative Crisp and Rough Clustering I: Theory","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Cluster analysis; Rough set; Computer science; Data mining; Medoid; Canopy clustering algorithm; CURE data clustering algorithm; Correlation clustering; Single-linkage clustering; Algorithm; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004840876,0.0003174936,0.0002826077,0.0003185609,0.0003428837,0.0005876844,0.001109973,0.0001479067,0.000004454927],"category_scores_gemma":[0.00003709782,0.0002875925,0.00003228802,0.0002527355,0.0005846338,0.0007328349,0.001257149,0.0004192627,0.000006268767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008213897,"about_ca_system_score_gemma":0.0001365162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008300389,"about_ca_topic_score_gemma":0.00001025795,"domain_scores_codex":[0.9978718,0.00002636583,0.0002669482,0.001152479,0.000347962,0.0003344535],"domain_scores_gemma":[0.9985916,0.0003472752,0.000124442,0.0007146066,0.00009588911,0.0001261825],"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.000001628037,0.000008743613,0.000007987543,0.000009797412,0.000003996412,0.00001636654,0.0007673478,0.0007843875,0.00001723988,0.05005904,0.00002403626,0.9482994],"study_design_scores_gemma":[0.0001336116,0.0001093978,0.0005649727,0.0002156598,0.000005512351,0.0001630983,3.513065e-7,0.6655185,0.00004473046,0.3303015,0.002560403,0.0003822342],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004747161,0.001457534,0.9949104,0.000944845,0.000251469,0.0002036334,0.00001270164,0.00008784327,0.002084087],"genre_scores_gemma":[0.02419083,0.0001914146,0.9730683,0.001654684,0.0002906033,0.00001072462,0.00000889526,0.00001753991,0.0005670151],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9479172,"threshold_uncertainty_score":0.9999576,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01399186733943312,"score_gpt":0.2499797236705177,"score_spread":0.2359878563310846,"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."}}