Sciweavers

1412 search results - page 261 / 283
» Selectivity Estimation using Probabilistic Models
Sort
View
EC
2006
195views ECommerce» more  EC 2006»
15 years 2 months ago
Automated Global Structure Extraction for Effective Local Building Block Processing in XCS
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...
Martin V. Butz, Martin Pelikan, Xavier Llorà...
TNN
1998
114views more  TNN 1998»
15 years 2 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan
TNN
2008
181views more  TNN 2008»
15 years 2 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
NIPS
2003
15 years 3 months ago
A Classification-based Cocktail-party Processor
At a cocktail party, a listener can selectively attend to a single voice and filter out other acoustical interferences. How to simulate this perceptual ability remains a great cha...
Nicoleta Roman, DeLiang L. Wang, Guy J. Brown
TSD
2007
Springer
15 years 8 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an