{"id":"W2169116170","doi":"10.1109/tnn.2004.839357","title":"Incremental Communication for Adaptive Resonance Theory Networks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Adaptive resonance theory; Computer science; Convergence (economics); Artificial neural network; Implementation; Process (computing); Communications system; Bounded function; Telecommunications network; Artificial intelligence; Algorithm; Mathematics; Telecommunications","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.0004784667,0.0003283219,0.0002366883,0.0002734827,0.0003375441,0.0004536216,0.0007402946,0.0005021357,0.00219392],"category_scores_gemma":[0.003185167,0.0001492975,0.0002108394,0.000264744,0.0004486544,0.001036456,0.0005455209,0.0006939919,0.0003055892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003990373,"about_ca_system_score_gemma":0.0003517435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006894713,"about_ca_topic_score_gemma":0.0009695667,"domain_scores_codex":[0.9996814,0.0001049137,0.0000144225,0.00003945121,0.000136477,0.0000234153],"domain_scores_gemma":[0.9992096,0.0004744149,0.00005715514,0.0001062706,0.0001342085,0.00001820234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000363085,0.00007690824,0.0007706136,0.0002204576,0.00004253239,0.0004113041,0.0003319674,0.4871646,0.04767774,0.1599163,0.00265637,0.300368],"study_design_scores_gemma":[0.00002376091,0.0001110227,0.0001480488,0.000009593017,0.00001096242,0.0001000474,0.00001714499,0.965867,0.008311361,0.02254652,0.002841733,0.00001274576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03432146,0.0003054746,0.9591308,0.0001976461,0.00007267125,0.00003656182,0.0000162077,0.0003734634,0.005545739],"genre_scores_gemma":[0.8359647,0.0002384189,0.1601808,0.0001580841,0.00009355897,0.000119772,0.00004080955,0.00004715184,0.003156527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00219392,"threshold_uncertainty_score":0.007339418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02048169323534046,"score_gpt":0.2519228460696076,"score_spread":0.2314411528342672,"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."}}