{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000337559,0.0002745398,0.0002219185,0.00007710609,0.0008088856,0.0001494312,0.001056626,0.0001470865,0.00002404632],"category_scores_gemma":[0.000002045117,0.0002638887,0.0002052113,0.0005170541,0.0001140431,0.0006221784,0.00001216713,0.0005515479,0.00001392093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009222853,"about_ca_system_score_gemma":0.00001670638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009274028,"about_ca_topic_score_gemma":0.00009854704,"domain_scores_codex":[0.9981918,0.0001788213,0.0003882142,0.0005360923,0.0001954504,0.0005096057],"domain_scores_gemma":[0.9980028,0.0006617667,0.0001409009,0.000955294,0.00009214265,0.0001471454],"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.0000725724,0.0001024497,0.00000153269,0.000001014877,0.00001444357,4.519634e-7,0.0000349587,0.6327773,0.00002310855,0.01357868,0.001672429,0.351721],"study_design_scores_gemma":[0.0005286889,0.0001684512,0.00007274753,0.00002669667,0.0000214089,0.00001226427,0.00001309501,0.9920295,0.0004566646,0.001120481,0.005268352,0.0002815879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001146963,0.0008868454,0.993822,0.002276787,0.0004426168,0.0007948797,0.00001276497,0.0003386152,0.0002785216],"genre_scores_gemma":[0.9743063,0.0003559777,0.02136161,0.002692909,0.0003397884,0.0005260464,0.000007681674,0.00003259064,0.0003771057],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9731593,"threshold_uncertainty_score":0.9999813,"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."}}