A linear optimization neural network for associative memory (Q2491006): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A learning and forgetting algorithm in associative memories: results involving pseudo-inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative analysis and synthesis of a class of neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and synthesis of a class of neural networks: linear systems operating on a closed hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A high performance neural network for solving nonlinear programming problems with hybrid constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4141027 / rank
 
Normal rank

Latest revision as of 13:23, 24 June 2024

scientific article
Language Label Description Also known as
English
A linear optimization neural network for associative memory
scientific article

    Statements

    A linear optimization neural network for associative memory (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2006
    0 references
    This short article investigates new alternative models for neural networks for associative memory. Traditionally, such models were based on optimizing a quadratic function, at the expense of a simple structure and implementation. The authors present an alternative to the quadratic function that is more efficient, based on a linear neural network for associative memory. The main part of the article concentrates in describing this model, which is then followed by a short numerical example and a useful list of references.
    0 references
    neural networks
    0 references
    associative memory
    0 references
    linear optimization
    0 references
    numerical example
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references