2002
DOI: 10.1016/s0925-2312(01)00604-x
|View full text |Cite
|
Sign up to set email alerts
|

On a perceptron-type learning rule for higher order Hopfield neural networks including dilation and translation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2002
2002
2002
2002

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(5 citation statements)
references
References 28 publications
0
5
0
Order By: Relevance
“…The following theorem, which gives a sufficient condition for the termination of this learning rule after a finite number of steps, has also been proved in Ref. 13.…”
Section: Remarkmentioning
confidence: 93%
See 4 more Smart Citations
“…The following theorem, which gives a sufficient condition for the termination of this learning rule after a finite number of steps, has also been proved in Ref. 13.…”
Section: Remarkmentioning
confidence: 93%
“…In this paper, we focus our attention on a corresponding generalization of the perceptron learning rule as introduced in Ref. 13. We are especially interested in the question, whether similar results can be obtained in the latter case.…”
Section: Remarkmentioning
confidence: 97%
See 3 more Smart Citations