Keywords
Multiplicative functionPerceptronMathematicsLogarithmAlgorithmMonotone polygonWeightSimple (philosophy)Computer scienceArtificial neural networkArtificial intelligence
Affiliated Institutions
Related Publications
Part-Based Statistical Models for Object Classification and Detection
We propose using simple mixture models to define a set of mid-level binary local features based on binary oriented edge input. The features capture natural local structures in t...
Selection of Relevant Features in Machine Learning.
In this paper, we review the problem of selecting relevant features for use in machine learning.We describe this problem in terms of heuristic search through a space of feature ...
Network In Network
Abstract: We propose a novel deep network structure called In Network (NIN) to enhance model discriminability for local patches within the receptive field. The conventional con...
Feature selection for multiclass discrimination via mixed-integer linear programming
We reformulate branch-and-bound feature selection employing L/sub /spl infin// or particular L/sub p/ metrics, as mixed-integer linear programming (MILP) problems, affording con...
CutMix: Regularization Strategy to Train Strong Classifiers With Localizable Features
Regional dropout strategies have been proposed to enhance performance of convolutional neural network classifiers. They have proved to be effective for guiding the model to atte...
Publication Info
- Year
- 1997
- Type
- article
- Volume
- 97
- Issue
- 1-2
- Pages
- 325-343
- Citations
- 87
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
87
OpenAlex
Cite This
Jyrki Kivinen,
Manfred K. Warmuth,
Peter Auer
(1997).
The perceptron algorithm versus winnow: linear versus logarithmic mistake bounds when few input variables are relevant.
Artificial Intelligence
, 97
(1-2)
, 325-343.
https://doi.org/10.1016/s0004-3702(97)00039-8
Identifiers
- DOI
- 10.1016/s0004-3702(97)00039-8