4255 search results - page 493 / 851 » On Learning Boolean Functions |
197
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
180
click to vote
COLING
2002
15 years 6 months ago
2002
This paper proposes a learning and extracting method of word sequence correspondences from non-aligned parallel corpora with Support Vector Machines, which have high ability of th...
123
click to vote
JMLR
2002
15 years 6 months ago
2002
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
162
click to vote
SEAL
2010
Springer
15 years 5 months ago
2010
Springer
During engineering design, it is often difficult to quantify product reliability because of insufficient data or information for modeling the uncertainties. In such cases, one need...
150
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...