Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Connectionistic models of Boolean category representation.

D J Volper, S E Hampson

    Biological Cybernetics
    |January 1, 1986
    PubMed
    Summary
    This summary is machine-generated.

    Related Concept Videos

    You might also read

    Related Articles

    Articles linked to this work by shared authors, journal, and citation graph.

    Sort by
    Same author

    Personality and overweight in 6-12-year-old children.

    Pediatric obesity·2015
    Same author

    Behavioral research on diabetes at the Oregon Research Institute.

    Annals of behavioral medicine : a publication of the Society of Behavioral Medicine·2013
    Same author

    Mothers' negative affectivity during pregnancy and food choices for their infants.

    International journal of obesity (2005)·2009
    Same author

    Statistical detection of chromosomal homology using shared-gene density alone.

    Bioinformatics (Oxford, England)·2004
    Same author

    Comparison of patients' and healthcare professionals' beliefs about and attitudes towards Type 2 diabetes.

    Diabetic medicine : a journal of the British Diabetic Association·2003
    Same author

    Neuropsychological functioning in older people with type 2 diabetes: the effect of controlling for confounding factors.

    Diabetic medicine : a journal of the British Diabetic Association·2002
    Same journal

    Harmonic memory in phasor neural networks.

    Biological cybernetics·2026
    Same journal

    Correction: Decreased spinal inhibition leads to undiversified locomotor patterns.

    Biological cybernetics·2026
    Same journal

    Foundational issues of network models in biology.

    Biological cybernetics·2026
    Same journal

    Dynamical mechanisms for coordinating long-term working memory based on the precision of spike-timing in cortical neurons.

    Biological cybernetics·2026
    Same journal

    Distinct dopaminergic spike-timing-dependent plasticity rules are suited to different functional roles.

    Biological cybernetics·2026
    Same journal

    Fluctuation-response relations for a two-stage population of spiking neurons stimulated by common noise.

    Biological cybernetics·2026
    See all related articles

    This study explores neural network representations for Boolean functions, highlighting threshold logic units (TLUs) for real-world categories. Findings reveal exponential increases in nodes and weights, impacting efficiency and learning time.

    Area of Science:

    • Artificial Intelligence
    • Computational Neuroscience
    • Machine Learning

    Background:

    • Connectionistic or neural networks can compute arbitrary Boolean functions.
    • Threshold Logic Units (TLUs) offer advantages for representing real-world categories due to their ability to model prototypical groupings.

    Purpose of the Study:

    • To describe and discuss distinct neural representations for Boolean functions.
    • To analyze tradeoffs between time, space, and clarity in these representations.
    • To establish bounds on the number of nodes required for Boolean completeness.

    Main Methods:

    • Analysis of connectionistic/neural network architectures.
    • Mathematical derivation of upper and lower bounds for Boolean completeness.
    • Examination of network complexity in terms of nodes and connection weights.

    Related Experiment Videos

    Main Results:

    • The number of nodes required for Boolean completeness increases exponentially with input features.
    • Non-recurrent networks show exponential increases in connection weights with node reduction, potentially leading to long learning times.
    • Two extensions for handling non-Boolean values were considered.

    Conclusions:

    • The choice of neural representation impacts computational tradeoffs.
    • TLUs are advantageous for categorical data representation in neural networks.
    • Memory efficiency in neural networks may necessitate compromises in learning time.