Separating points by parallel hyperplanes-characterization problem

IEEE Transactions on Neural Networks

Volumn 18, Issue 5, 2007, Pages 1356-1363

  Ghilezan, Silvia ^a   Pantović, Jovanka ^a   Žunić, Joviša ^b,c  

^a UNIVERSITY OF NOVI SAD   (Serbia)

^b UNIVERSITY OF EXETER   (United Kingdom)

^c MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Discrete moments; Encoding; Multilevel threshold function; Multilinear partitions; Neural networks; Storage complexity

Indexed keywords

BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; IMAGE CODING; MANY VALUED LOGICS;

DISCRETE MOMENTS; MULTILEVEL THRESHOLD FUNCTION; MULTILINEAR PARTITIONS;

NEURAL NETWORKS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER SIMULATION; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; SIGNAL PROCESSING; THEORETICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; MODELS, THEORETICAL; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY; SIGNAL PROCESSING, COMPUTER-ASSISTED;

EID: 34548609623     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2007.891678     Document Type: Article

References (27)

1. M. Anthony, "Partitioning points by parallel planes," Discrete Math., vol. 282, pp. 17-21, 2004.
2. M. Antony, "Connections between neural networks and boolean functions," in A Chapter in Boolean Methods and Models, Y. Crama and P. Hammer, Eds. Cambridge, U.K.: Cambridge Univ. Press, 2006 [Online]. Available: http://www.cdam.lse.ac.uk/Reports/Files/ cdam-2005-25.pdf
3. J. Bruck, "Harmonic analysis of polynomial threshold functions," SIAM J. Discrete Math., vol. 3, pp. 168-177, 1990.
4. C. K. Chow, "Boolean functions realizable with single threshold devices," Proc. IRE, vol. 49, no. 1, pp. 370-371, Jan. 1960.
5. C. K. Chow, "On the characterization of threshold functions," in Switching Circuit Theory and Logical Design, 1961, vol. S-134, pp. 34-38, IEEE Special Publication.
6. S. Corteel, G. Rémond, G. Schaeffer, and H. Thomas, "The number of plane corner cuts," Adv. Appl. Math., vol. 23, pp. 49-53, 1999.
7. T. M. Cover, "Geometric and statistical properties of systems of linear inequalities with applications in pattern recognition," IEEE Trans. Electron. Comput., vol. EC-14, no. 3, pp. 326-334, Jun. 1965.
8. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, 2nd ed. New York: Wiley, 2000.
9. A. S. Hayes and D. C. Larman, "The vertices of knapsack polytope," Discrete Appl. Math., vol. 6, pp. 135-138, 1983.
10. T. Hegedüs and N. Megiddo, "On the geometric separability of boolean functions," Discrete Appl. Math., vol. 66, pp. 205-218, 1996.
11. A. Ivić, J. Koplowitz, and J. Žunić, "On the number of digital convex polygons inscribed into an (m,m)-grid," IEEE Trans. Inf. Theory, vol. 40, no. 5, pp. 1681-1686, Sep. 1994.
12. R. Klette, I. Stojmenovié, and J. Žunić, "A new parametrization of digital planes by least squares plane fit and generalizations," Graph. Models Image Process., vol. 58, pp. 295-300, 1996.
13. J. Koplowitz, M. Lindenbaum, and A. Bruckstein, "The number of straight lines on an n X n grid," IEEE Trans. Inf. Theory, vol. 36, no. 1, pp. 192-197, Jan. 1990.
14. S. Muroga, "Lower bounds on the number of threshold functions and a maximum weight," IEEE Trans. Electron. Comput., vol. EC-14, no. 2, pp. 136-148, Apr. 1965.
15. A. Ngom, I. Stojmenović, and J. Žunić, "On the number of multilinear partitions and computing capacity of multiple-valued multiple threshold perceptrons," IEEE Trans. Neural Netw., vol. 15, no. 3, pp. 469-447, May 2003.
16. Z. Obradović and I. Parberry, "Computing with discrete multivalued neurons," J. Comp. Syst. Sci., vol. 45, pp. 471-492, 1992.
17. P. C. Ojha, "Enumeration of linear threshold functions from the lattice of hyperplane intersections," IEEE Trans. Neural Netw., vol. 11, no. 4, pp. 839-850, Jul. 2000.
18. S. Onn and B. Sturmfels, "Cutting corners," Adv. Appl. Math., vol. 23, pp. 29-48, 1999.
19. S. 'Olafsson and Y. S. Abu-Mostafa, "The capacity of multilevel threshold functions," IEEE Trans. Pattern Anal. Mach. Intell., vol. 10, no. 2, pp. 277-281, Mar. 1988.
20. L. Schläfli, Gessamelte Mathematische Abhandlungen 1. Basel, Germany: Birkhäuser, 1950.
21. K.-Y. Siu, V. Roychowdhury, and T. Kailtah, Discrete Neural Computation A Theoretical Foundation. Englewood Cliffs, NJ: Prentice-Hall, 1995.
22. U. Wagner, "On the number of corner cuts," Adv. Appl. Math., vol. 29, pp. 152-161, 2002.
23. R. O. Winder, "Threshold logic asymptotes," IEEE Trans. Comput., vol. C-19, no. 4, pp. 349-253, Apr. 1970.
24. Y. A. Zuev, "Asymptotics of the logarithm of the number of threshold functions of the algebra of logic," Sov. Math. Dok., vol. 39, pp. 512-513, 1989.
25. J. Žunić, "On encoding and enumerating threshold functions," IEEE Trnas. Neural Netw., vol. 15, no. 2, pp. 261-267, Mar. 2004.
26. J. Žunić and D. M. Acketa, "A general coding scheme for families of digital curve segments," Graph. Models Image Process., vol. 60, pp. 437-460, 1998.
27. J. Žunić, "On the number of ways to occupy n lattice points by balls in a d-dimensional space," J. Number Theory, vol. 110, pp. 396-402, 2005.