1813 search results - page 157 / 363 » Instance Pruning Techniques |
148
click to vote
CEAS
2007
Springer
16 years 19 days ago
2007
Springer
In this paper, we propose a new asymmetric boosting method, Boosting with Different Costs. Traditional boosting methods assume the same cost for misclassified instances from di...
136
click to vote
COLCOM
2005
IEEE
16 years 2 days ago
2005
IEEE
We do a case study of two different analysis techniques for studying the stochastic behavior of a randomized system/algorithms: (i) The first approach can be broadly termed as a ...
167
click to vote
IBPRIA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neigh...
159
click to vote
LFCS
1992
Springer
15 years 10 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
180
click to vote
FSTTCS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...