Pretropisms are candidates for the leading exponents of Puiseux series that represent positive dimensional solution sets of polynomial systems. We propose a new algorithm to both horizontally and vertically prune the tree of edges of a tuple of Newton polytopes. We provide experimental results with our preliminary implementation in Sage that demonstrates that our algorithm compares favorably to...

In saliency based pruning algorithms a pruning decision is made based on an ordering of the parameters. We will in this article focus on the fact that this ordering is invariant under certain transformations, and with that knowledge an equivalence class of algorithms is developed all yielding identical prunings. A sub-class is demonstrated to have a simple but sensible interpretation in terms o...

The sustainability of cocoa production in Indonesia is faced with the problem pod borer (Theobroma cacao L.). In an effort to control main pests on plants, various techniques can be used, namely use natural insecticides and by technical culture form pruning. Natural insecticide whose basic ingredients come from plants that are easilybiodegradablein nature, so they do not pollute environment rel...

Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pruning techniques should consider how pruning errors in a game-tree search propagate to the root to minimize the risk of making errors. In this paper, we explore forward pruning using theoretical analyses and Monte Carlo...

Over tting is a widely observed pathology of induction algorithms. Over tted models contain unnecessary structure that re ects nothing more than chance variations in the particular data sample used to construct the model. Portions of these models are literally wrong, and can mislead users. Over tted models require more storage space and take longer to execute than their correctlysized counterpa...

Most speech recognition systems search through large finite state machines to find the most likely path, or hypothesis. Efficient search in these large spaces requires pruning of some hypotheses. Popular pruning techniques include probability pruning which keeps only hypotheses whose probability falls within a prescribed factor from the most likely one, and rank pruning which keeps only a presc...

Decision tree technology has proven to be a valuable way of capturing human decision making within a computer. It has long been a popular artificial intelligence(AI) technique. During the 1980s, it was one of the primary ways for creating an AI system. During the early part of the 1990s, it somewhat fell out of favor, as did the entire AI field in general. However, during the later 1990s, with ...

A large-scale pruning study was established in the winter of 1999 to2000 at seven different sites on Green Diamond Resource Company forestlands in Humboldt County. The objective of this study was to determine the effects of pruning on increment, epicormic sprouting, stem taper, heartwood formation, and bear damage on these young trees. Pruning treatments varied pruning severity and were usually...

Many researchers have shown that ensemble methods such as Boosting and Bagging improve the accuracy of classification. Boosting and Bagging perform well with unstable learning algorithms such as neural networks or decision trees. Pruning decision tree classifiers is intended to make trees simpler and more comprehensible and avoid over-fitting. However it is known that pruning individual classif...