Sciweavers

627 search results - page 54 / 126
» The Laplace-Jaynes approach to induction
Sort
View
COGSCI
2002
108views more  COGSCI 2002»
15 years 6 months ago
Statistical models for the induction and use of selectional preferences
Selectional preferences have a long history in both generative and computational linguistics. However, since the publication of Resnik's dissertation in 1993, a new approach ...
Marc Light, Warren R. Greiff
SNPD
2003
15 years 7 months ago
Deductive and Inductive Methods for Program Synthesis
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
Jaan Penjam, Elena Sanko
ICML
2009
IEEE
16 years 7 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
ICML
2005
IEEE
16 years 7 months ago
Learning the structure of Markov logic networks
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
Stanley Kok, Pedro Domingos
KDD
2004
ACM
151views Data Mining» more  KDD 2004»
16 years 6 months ago
Feature selection in scientific applications
Numerous applications of data mining to scientific data involve the induction of a classification model. In many cases, the collection of data is not performed with this task in m...
Erick Cantú-Paz, Shawn Newsam, Chandrika Ka...