Sciweavers

995 search results - page 156 / 199
» Learning Useful Horn Approximations
Sort
View
137
Voted
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 8 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
EMNLP
2008
15 years 5 months ago
Stacking Dependency Parsers
We explore a stacked framework for learning to predict dependency structures for natural language sentences. A typical approach in graph-based dependency parsing has been to assum...
André F. T. Martins, Dipanjan Das, Noah A. ...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
15 years 5 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
JFR
2006
88views more  JFR 2006»
15 years 4 months ago
Discovering natural kinds of robot sensory experiences in unstructured environments
We derive categories directly from robot sensor data to address the symbol grounding problem. Unlike model-based approaches where human intuitive correspondences are sought betwee...
Daniel H. Grollman, Odest Chadwicke Jenkins, Frank...
ML
2002
ACM
135views Machine Learning» more  ML 2002»
15 years 3 months ago
Bayesian Treed Models
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
Hugh A. Chipman, Edward I. George, Robert E. McCul...