Sciweavers

2665 search results - page 233 / 533
» Bundle Methods for Machine Learning
Sort
View
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
15 years 6 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
EACL
2006
ACL Anthology
15 years 4 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti
142
Voted
JMLR
2010
185views more  JMLR 2010»
14 years 9 months ago
Multiple Kernel Learning on the Limit Order Book
Simple features constructed from order book data for the EURUSD currency pair were used to construct a set of kernels. These kernels were used both individually and simultaneously...
Tristan Fletcher, Zakria Hussain, John Shawe-Taylo...
134
Voted
JMLR
2010
99views more  JMLR 2010»
14 years 9 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko
97
Voted
IJCNLP
2005
Springer
15 years 8 months ago
PP-Attachment Disambiguation Boosted by a Gigantic Volume of Unambiguous Examples
We present a PP-attachment disambiguation method based on a gigantic volume of unambiguous examples extracted from raw corpus. The unambiguous examples are utilized to acquire prec...
Daisuke Kawahara, Sadao Kurohashi