Enumeration of Seven-Argument Threshold Functions
From MaRDI portal
Publication:5531563
DOI10.1109/PGEC.1965.264136zbMath0152.18206MaRDI QIDQ5531563
Publication date: 1965
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Related Items
Neural Networks with Local Receptive Fields and Superlinear VC Dimension, use of neural networks for system structure identification, The Dynamic Neural Filter: A Binary Model of Spatiotemporal Coding, General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Learning Classification in the Olfactory System of Insects, Unnamed Item, Learning Only When Necessary: Better Memories of Correlated Patterns in Networks with Bounded Synapses, Algorithms for weak and wide separation of sets, On selection of kernel parametes in relevance vector machines for hydrologic applications, Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data, Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks, An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution, A simultaneous learning framework for clustering and classification, On the asymptotic properties of smoothed estimators of the classification error rate, On the capabilities of multilayer perceptrons, Quantifying inductive bias: AI learning algorithms and Valiant's learning framework, Some special Vapnik-Chervonenkis classes, Contrivedness: the boundary between pattern recognition and numerology, Programmed interactions in higher-order neural networks: Maximal capacity, The Vapnik-Chervonenkis dimension of decision trees with bounded rank, An application of rate-distortion theory to pattern recognition and classification, Balls in \(\mathbb{R}^k\) do not cut all subsets of \(k+2\) points, The capacity of monotonic functions, Neural networks as systems for recognizing patterns, Covering cubes by random half cubes, with applications to binary neural networks, On the perceptron learning algorithm on data with high precision, A review of combinatorial problems arising in feedforward neural network design, Identificaction of nonlinear block-oriented systems by the recursive kernel estimate, On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions, On the risk of estimates for block decreasing densities, Gauge groups and data classification., On finding global optima for the hinge fitting problem., Gradient-assisted radial basis function networks: Theory and applications, Techniques of replica symmetry breaking and the storage problem of the McCulloch-Pitts neuron, Consistency of data-driven histogram methods for density estimation and classification, Histogram regression estimation using data-dependent partitions, Partitioning points by parallel planes, On the complexity of learning for spiking neurons with temporal coding., On data classification by iterative linear partitioning, Classification by polynomial surfaces, On specifying Boolean functions by labelled examples, Witness sets for families of binary vectors, Automatic speech recognition using a predictive echo state network classifier, The application of an oblique-projected Landweber method to a model of supervised learning, Extremal properties of polynomial threshold functions, Edit distance-based kernel functions for structural pattern classification, Notions of associative memory and sparse coding, From Hopfield nets to recursive networks to graph machines: numerical machine learning for structured data, On the Complexity of Computing and Learning with Multiplicative Neural Networks, Computational Capacity of an Odorant Discriminator: The Linear Separability of Curves, Theory of Classification: a Survey of Some Recent Advances
