On Fast and Simple Algorithms for Finding Maximal Subarrays and Applications in Learning Theory
暂无分享,去创建一个
Consider the following problem SUB(k, n). Given an array A = (a1,..., an) of real elements ai and a natural number k, find (at most) k disjoint subarrays A1,...,Ak in A such that the sum of the elements contained in the subarrays is maximum.
[1] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[2] Simon Kasif,et al. Efficient Algorithms for Finding Multi-way Splits for Decision Trees , 1995, ICML.
[3] Peter Auer,et al. Theory and Applications of Agnostic PAC-Learning with Small Decision Trees , 1995, ICML.
[4] Wolfgang Maass,et al. Efficient agnostic PAC-learning with simple hypothesis , 1994, COLT '94.
[5] R. Schapire. Toward Eecient Agnostic Learning , 1992 .