{"id":"W4416251048","doi":"10.1109/ijcnn64981.2025.11228428","title":"Optimizing view generation in classification datasets","year":2025,"lang":"","type":"article","venue":"","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Decomposition; k-nearest neighbors algorithm; Key (lock); Computational complexity theory; Decomposition method (queueing theory); Divide and conquer algorithms","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.001372656,0.000252748,0.0002673165,0.0005442576,0.0002722254,0.0007673103,0.001040477,0.0001798531,0.0001426205],"category_scores_gemma":[0.0002687477,0.0002619395,0.00005209136,0.001785407,0.00005764411,0.001272448,0.0003628568,0.0004235815,0.0002448565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001972866,"about_ca_system_score_gemma":0.0003159055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002615571,"about_ca_topic_score_gemma":0.0003395814,"domain_scores_codex":[0.9969642,0.00050956,0.000813965,0.001057688,0.0002878236,0.00036681],"domain_scores_gemma":[0.9978963,0.0001050479,0.0002238937,0.001604793,0.00009009469,0.00007985545],"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.00000695237,0.0001984736,0.001096583,0.00008583389,0.00001278602,0.000002836545,0.0002972323,0.001931127,0.003447292,0.3043457,0.01723539,0.6713398],"study_design_scores_gemma":[0.000377023,0.00002320103,0.01615689,0.0001106347,0.0000142023,0.000001621111,0.00004917241,0.875495,0.0003900082,0.0002468124,0.1069216,0.000213881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008834803,0.001951611,0.9582644,0.01539115,0.0009087257,0.0004318334,0.0000340585,0.0001143314,0.02202041],"genre_scores_gemma":[0.9277567,0.001551634,0.06316937,0.001802924,0.0001514098,0.00006454464,0.002626768,0.00001232445,0.002864386],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9268731,"threshold_uncertainty_score":0.9999833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0555552130765447,"score_gpt":0.3284996722206477,"score_spread":0.272944459144103,"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."}}