134 search results - page 18 / 27 » On the Complexity of Approximating the VC Dimension |
TIT
1998
14 years 9 months ago
1998
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...
ISNN
2007
Springer
15 years 3 months ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
COLCOM
2007
IEEE
14 years 11 months ago
2007
IEEE
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
JMLR
2008
14 years 9 months ago
2008
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...