Closed-form expressions for the moments of the binomial probability distribution

SIAM Journal on Applied Mathematics

Volumn 69, Issue 1, 2008, Pages 197-204

  Knoblauch, Andreas ^a  

^a HONDA RESEARCH INSTITUTE EUROPE GMBH   (Germany)

Author keywords

Neural associative memory; Pochhammer polynomial; Retrieval errors; Stirling numbers; Storage capacity

Indexed keywords

ASSOCIATIVE PROCESSING; ASSOCIATIVE STORAGE; DATA STORAGE EQUIPMENT; FUNCTION EVALUATION; PROBABILITY; RECURSIVE FUNCTIONS;

NEURAL ASSOCIATIVE MEMORY; POCHHAMMER POLYNOMIAL; RETRIEVAL ERRORS; STIRLING NUMBERS; STORAGE CAPACITY;

PROBABILITY DISTRIBUTIONS;

EID: 55149100884     PISSN: 00361399     EISSN: None     Source Type: Journal    
DOI: 10.1137/070700024     Document Type: Article

References (22)

1. M. ABRAMOWITZ and I. A. STEGUN, eds., Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th ed., Dover, New York, 1972.
2. A. BENYI and S. M. MANAGO, A recursive formula for moments of a binomial distribution, College Math. J., 36 (2005), pp. 68-72.
3. H. BOSCH and F. KURFESS, Information storage capacity of incompletely connected associative memories, Neural Networks, 11 (1998), pp. 869-876.
4. J. J. HOPFIELD, Neural networks and physical systems with emergent collective computational abilities, Proc. Natl. Acad. Sci. USA, 79 (1982), pp. 2554-2558.
5. R. A. JORTNER, S. S. FARIVAR, and G. LAURENT, A simple connectivity scheme for sparse coding in an olfactory system, J. Neurosci., 27 (2007), pp. 1659-1669.
6. A. KNOBLAUCH, Neural associative memory for brain modeling and information retrieval, Inform. Process. Lett., 95 (2005), pp. 537-544.
7. A. KNOBLAUCH, Asymptotic Conditions for High-Capacity Neural Associative Networks, Internal Report HRI-EU 07-02, Honda Research Institute Europe GmbH, Offenbach/Main, Germany, 2007.
8. A. KNOBLAUCH, Neural associative memory and the Willshaw-Palm probability distribution, SIAM J. Appl. Math., 69 (2008), pp. 169-196.
9. D. E. KNUTH, The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd ed., Addison-Wesley, Reading, MA, 1997.
10. T. KOHONEN, Associative Memory: A System-Theoretical Approach, Springer, Berlin, 1977.
11. J.-P. NADAL, Associative Memory: On the (puzzling) sparse coding limit, J. Phys. A, 24 (1991), pp. 1093-1101.
12. G. PALM, On associative memories, Biol. Cybern., 36 (1980), pp. 19-31.
13. G. PALM, Neural Assemblies. An Alternative Approach to Artificial Intelligence, Springer, Berlin, 1982.
14. A. PAPOULIS, Probability, Random Variables, and Stochastic Processes, 3rd ed., McGraw-Hill, New York, 1991.
15. M. REHN and F. T. SOMMER, Storing and restoring visual input with collaborative rank coding and associative memory, Neurocomputing, 69 (2006), pp. 1219-1223.
16. J. RIORDAN, An Introduction to Combinatorial Analysis, Wiley, New York, 1958.
17. S. ROMAN, The Umbral Calculus, Pure Appl. Math. 111, Academic Press, New York, 1984.
18. F. T. SOMMER and G. PALM, Improved bidirectional retrieval of sparse patterns stored by Hebbian learning, Neural Networks, 12 (1999), pp. 281-297.
19. L. G. VALIANT, Memorization and association on a realistic neural model, Neural Comput., 17 (2005), pp. 527-555.
20. L. G. VALIANT, A quantitative theory of neural computation, Biol. Cybern., 95 (2006), pp. 205-211.
21. D. J. WILLSHAW, O. P. BUNEMAN, and H. C. LONGUET-HIGGINS, Nonholographic associative memory, Nature, 222 (1969), pp. 960-962.
22. X. XIE, R. H. R. HAHNLOSER, and H. S. SEUNG, Selectively grouping neurons in recurrent networks of lateral inhibition, Neural Comput., 14 (2002), pp. 2627-2646.