| Weisstein, E. W. (2002) Stirling number of the second kind, http://mathworld.wolfram.com/StirlingNumberoftheSecondKind.html |
....of the partitioning. The size of this search space for a k term DNF learning problem with n positive examples is the number of possible partitionings of Pos into k pairwise disjunct nonempty subsets. This is the Stirling number of the second kind S(n, k) k k 1 i=0 ( 1) k i) [28]. For large n, S(n, k) grows approximately exponentially to the base k. For most practical settings this is considerably lower than 3 V ar k , the size of the space of all k term formulae. Additionally, one can prune the search whenever a negative example is covered during formula construction. ....
Weisstein, E. W. (2002) Stirling number of the second kind, http://mathworld.wolfram.com/StirlingNumberoftheSecondKind.html
No context found.
Weisstein, E. W. (2002) Stirling number of the second kind, http://mathworld.wolfram.com/StirlingNumberoftheSecondKind.html
No context found.
Weisstein, E. W. (2002) Stirling number of the second kind, http://mathworld.wolfram.com/StirlingNumberoftheSecondKind.html 408
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC