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
Rates of the strong uniform consistency for the kernel-type regression function estimators with general kernels on manifolds, A Scale-Free Approach for False Discovery Rate Control in Generalized Linear Models, Distributed strategies for mixed equilibrium problems: continuous-time theoretical approaches, Tensor networks in machine learning, Tractability from overparametrization: the example of the negative perceptron, On the perceptron learning algorithm on data with high precision, Memory Capacity of Neural Networks with Threshold and Rectified Linear Unit Activations, Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data, Non intrusive reduced order modeling of parametrized PDEs by kernel POD and neural networks, A review of combinatorial problems arising in feedforward neural network design, Probability-enhanced effective dimension reduction for classifying sparse functional data, On the inverse power index problem, Identificaction of nonlinear block-oriented systems by the recursive kernel estimate, On data classification by iterative linear partitioning, Pattern capacity of a single quantum perceptron, Automatic speech recognition using a predictive echo state network classifier, On Dedekind's problem for complete simple games, On the proliferation of support vectors in high dimensions*, Classification by polynomial surfaces, On specifying Boolean functions by labelled examples, Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data, A precise high-dimensional asymptotic theory for boosting and minimum-\(\ell_1\)-norm interpolated classifiers, 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, General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Witness sets for families of binary vectors, Trading transforms of non-weighted simple games and integer weights of weighted simple games, On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions, Learning Classification in the Olfactory System of Insects, Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks, The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression, Probabilistic lower bounds for approximation by shallow perceptron networks, The capacity of feedforward neural networks, On the risk of estimates for block decreasing densities, Unnamed Item, Fast and robust face recognition via coding residual map learning based adaptive masking, Gauge groups and data classification., Neural Networks with Local Receptive Fields and Superlinear VC Dimension, Some special Vapnik-Chervonenkis classes, Average case recovery analysis of tomographic compressive sensing, The existence of maximum likelihood estimate in high-dimensional binary response generalized linear models, Support vector machines with applications, Contrivedness: the boundary between pattern recognition and numerology, Neural network coding of natural images with applications to pure mathematics, On finding global optima for the hinge fitting problem., Representing Objects, Relations, and Sequences, McCulloch-Pitts Brains and Pseudorandom Functions, Asymmetry of Neuronal Combinatorial Codes Arises from Minimizing Synaptic Weight Change, Delay Differential Analysis of Seizures in Multichannel Electrocorticography Data, Some new maximum VC classes, Gradient-assisted radial basis function networks: Theory and applications, Unnamed Item, Programmed interactions in higher-order neural networks: Maximal capacity, The Vapnik-Chervonenkis dimension of decision trees with bounded rank, Learning Only When Necessary: Better Memories of Correlated Patterns in Networks with Bounded Synapses, use of neural networks for system structure identification, The application of an oblique-projected Landweber method to a model of supervised learning, A practical application of kernel-based fuzzy discriminant analysis, Algorithms for weak and wide separation of sets, Extremal properties of polynomial threshold functions, A kernel-based block matrix decomposition approach for the classification of remotely sensed images, Algorithms for Radon partitions with tolerance, On minimum sum representations for weighted voting games, A hybrid radial basis function and data envelopment analysis neural network for classification, Sequential reconstruction of driving-forces from nonlinear nonstationary dynamics, An effective high order interpolation scheme in BIEM for biharmonic boundary value problems, The Dynamic Neural Filter: A Binary Model of Spatiotemporal Coding, On the Complexity of Computing and Learning with Multiplicative Neural Networks, An application of rate-distortion theory to pattern recognition and classification, Edit distance-based kernel functions for structural pattern classification, The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square, Effective kernel FCM: Finding appropriate structure in cancer database, Information divergence estimation based on data-dependent partitions, Robust exponential memory in Hopfield networks, A local Vapnik-Chervonenkis complexity, A Theoretical Basis for Emergent Pattern Discrimination in Neural Systems Through Slow Feature Extraction, On the fusion of threshold classifiers for categorization and dimensionality reduction, On selection of kernel parametes in relevance vector machines for hydrologic applications, Linear read-once and related Boolean functions, Theory of Classification: a Survey of Some Recent Advances, Balls in \(\mathbb{R}^k\) do not cut all subsets of \(k+2\) points, Complexity of Shallow Networks Representing Finite Mappings, 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, The capacity of monotonic functions, Neural networks as systems for recognizing patterns, Consistency of data-driven histogram methods for density estimation and classification, Histogram regression estimation using data-dependent partitions, Covering cubes by random half cubes, with applications to binary neural networks, Distributed resource allocation via multi-agent systems under time-varying networks, A novel distribution-free hybrid regression model for manufacturing process efficiency improvement, Partitioning points by parallel planes, A nonparametric ensemble binary classifier and its statistical properties, Notions of associative memory and sparse coding, When Does a Mixture of Products Contain a Product of Mixtures?, From Hopfield nets to recursive networks to graph machines: numerical machine learning for structured data, Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution, On the complexity of learning for spiking neurons with temporal coding., Techniques of replica symmetry breaking and the storage problem of the McCulloch-Pitts neuron, The interpolation phase transition in neural networks: memorization and generalization under lazy training, On Boolean threshold functions with minimum specification number, Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors, Similarity, kernels, and the fundamental constraints on cognition, Computational Capacity of an Odorant Discriminator: The Linear Separability of Curves
