In this paper an exact and general formula is derived for the number of linear partitions of a given subset V /spl sub/ R/sup 3/, depending on the configuration formed by the points of V. V can be a multi-set, that is it may contain points that coincide. Using the formula, we obtain a fast algorithm for computing the capacity of three-input k-valued one-threshold perceptrons.
展开▼
机译:在本文中,针对给定子集V / SPL子/ R / SUP 3 /的线性分区的数量来导出精确和通式,具体取决于由V的点形成的配置可以是多组,这可能包含一致的点。使用公式,我们获得了一种快速算法,用于计算三输入k值一阈值的Perceptrons的容量。
展开▼