Sciweavers

242 search results - page 11 / 49
» Approximate substring selectivity estimation
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
TIT
1998
126views more  TIT 1998»
13 years 7 months ago
An Asymptotic Property of Model Selection Criteria
—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...
Yuhong Yang, Andrew R. Barron
VLDB
2004
ACM
180views Database» more  VLDB 2004»
14 years 20 days ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 7 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
ESANN
2001
13 years 8 months ago
Penalized least squares, model selection, convex hull classes and neural nets
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
Gerald H. L. Cheang, Andrew R. Barron