3716 search results - page 321 / 744 » On the monotonization of the training set |
162
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
186
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...
193
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Machine learning approaches in natural language processing often require a large annotated corpus. We present a complementary approach that utilizes expert knowledge to o...
170
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
155
click to vote
EUROSSC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In the domain of ubiquitous computing, the ability to identify the occurrence of situations is a core function of being ’contextaware’. Given the uncertain nature of ...