Recent work on decision tree pruning [1] has brought to the attention of the machine learning community the fact that, in classification problems, the use of subadditive penalties in cost-complexity pruning has a stronger theoretical basis than the usual additive penalty terms. We implement cost-complexity pruning algorithms with general size-dependent penalties to confirm the results of [1]. N...

Pushing monotone constraints in frequent pattern mining can help pruning the search space, but at the same time it can also reduce the effectiveness of anti-monotone pruning. There is a clear tradeoff. Is it better to exploit more monotone pruning at the cost of less antimonotone pruning, or viceversa? The answer depends on characteristics of the dataset and the selectivity of constraints. In t...

The regulated degeneration of axons or dendrites (pruning) and neuronal apoptosis are widely used during development to determine the specificity of neuronal connections. Pruning and apoptosis often share similar mechanisms; for example, developmental dendrite pruning of Drosophila class IV dendritic arborization (da) neurons is induced by local caspase activation triggered by ubiquitin-mediate...

Pruning processes (F(θ), θ ≥ 0) have been studied separately for Galton-Watson trees and for Lévy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem by Abraham and Delmas, also formulated as a conjecture by Löhr, Voisin and Winter. Specifically, we show that for any sequence of Galton-Watson forests Fn, n ≥ 1, in the domain of att...

Evaluation of ranked queries on large text collections can be costly in terms of processing time and memory space. Dynamic pruning techniques allow both costs to be reduced, at the potential risk of decreased retrieval effectiveness. In this paper we describe an improved query pruning mechanism that offers a more resilient tradeoff between query evaluation costs and retrieval effectiveness than...

A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this global constraint. We introduce a pruning rule that improves propagation from the objective variable to the decision variables, which is believed to be harder to achieve. We further introduce a pruning rule based on li...

We present a context-sensitive chart pruning method for CKY-style MT decoding. Source phrases that are unlikely to have aligned target constituents are identified using sequence labellers learned from the parallel corpus, and speed-up is obtained by pruning corresponding chart cells. The proposed method is easy to implement, orthogonal to cube pruning and additive to its pruning power. On a ful...

We analyse the use of pruning operators for reducing the search space of logic programming computations. The synthesis of a few key choices arising in the implementation of pruning operators allows us to compare alternative pruning strategies at a suitably abstract level. In this perspective, we examine the commit operator featured by the language GG odel.

Many renderers perform poorly on scenes that contain a lot of detailed geometry. Level-of-detail techniques can alleviate the load on the renderer by creating simplified representations of primitives that are small on the screen. Current methods work well when the detail is due to the complexity of the individual elements, but not when it is due to the large number of elements. In this paper, w...