{"id":"W4410197165","doi":"10.1016/j.inffus.2025.103272","title":"IncA-DES: An incremental and adaptive dynamic ensemble selection approach using online K-d tree neighborhood search for data streams with concept drift","year":2025,"lang":"en","type":"article","venue":"Information Fusion","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Fonds de recherche du Québec; Alliance de recherche numérique du Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Concept drift; Selection (genetic algorithm); Data stream mining; Data mining; Tree (set theory); STREAMS; Dynamic data; Machine learning; Computer network; Mathematics; Database","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.0004174193,0.0001485088,0.0001397622,0.0002790716,0.0003069619,0.000284047,0.0006684043,0.00007638594,0.000001575175],"category_scores_gemma":[0.00003039727,0.0001306426,0.00001240608,0.0004945669,0.00007672166,0.005819845,0.0007025141,0.0001215721,6.379179e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336239,"about_ca_system_score_gemma":0.0001824227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003898464,"about_ca_topic_score_gemma":0.0001847542,"domain_scores_codex":[0.9989134,0.00006430746,0.0002824036,0.0002919422,0.0002418941,0.0002060183],"domain_scores_gemma":[0.9989951,0.00006115271,0.000132279,0.0005661721,0.0001882478,0.00005706642],"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.0001194287,0.0001613724,0.0009394142,0.0000656694,0.00002931087,3.245123e-7,0.00284806,0.0003746393,0.001595945,0.00813235,0.000279172,0.9854543],"study_design_scores_gemma":[0.0006985671,0.0004463462,0.0009790764,0.0000914433,0.00001541961,0.00001677563,0.001266848,0.9934401,0.002413116,0.0003105586,0.0001763315,0.0001454444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1113482,0.00001168455,0.886816,0.00003708652,0.00002905955,0.0005409531,0.0001872968,0.000228536,0.0008011261],"genre_scores_gemma":[0.5677834,0.000006972601,0.4302352,0.00007400612,0.000008945439,0.0000124117,0.001866259,0.000004445893,0.000008338998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9930654,"threshold_uncertainty_score":0.5327449,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04283078563687173,"score_gpt":0.3158478974943149,"score_spread":0.2730171118574432,"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."}}