Sciweavers

4903 search results - page 250 / 981
» The Set Covering Machine
Sort
View
ACL
2006
15 years 8 months ago
Automatic Learning of Textual Entailments with Cross-Pair Similarities
In this paper we define a novel similarity measure between examples of textual entailments and we use it as a kernel function in Support Vector Machines (SVMs). This allows us to ...
Fabio Massimo Zanzotto, Alessandro Moschitti
ICML
2010
IEEE
15 years 7 months ago
A Stick-Breaking Construction of the Beta Process
We present and derive a new stick-breaking construction of the beta process. The construction is closely related to a special case of the stick-breaking construction of the Dirich...
John William Paisley, Aimee Zaas, Christopher W. W...
ML
2006
ACM
110views Machine Learning» more  ML 2006»
15 years 6 months ago
Distribution-based aggregation for relational learning with identifier attributes
Abstract Identifier attributes--very high-dimensional categorical attributes such as particular product ids or people's names--rarely are incorporated in statistical modeling....
Claudia Perlich, Foster J. Provost
ML
2000
ACM
15 years 6 months ago
Randomizing Outputs to Increase Prediction Accuracy
Bagging and boosting reduce error by changing both the inputs and outputs to form perturbed training sets, grow predictors on these perturbed training sets and combine them. A que...
Leo Breiman
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 9 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh