A frontier-based tree-pruning algorithm (FBP) is proposed. The new method has comparable order of computational complexity, comparing with Cost-Complexity Pruning (CCP). Regarding tree pruning, it provides a full spectrum of information; specifically, (1) given the value of the penalization parameter λ, it gives the minimum size of a decision tree; (2) given the size of a decision tree, it prov...

1 I n t r o d u c t i o n Many induction algorithms construct models with unnecessary structure. These models contain components tha t do not improve accuracy, and tha t only reflect random variation in a single da ta sample. Such models are less efficient to store and use than their correctly-sized counterparts . Using these models requires the collection of unnecessary data. Portions of these...

Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined to not lie on an optimal path. We introduce an ε-pruning condition that extends pruning to include a possible error in the pruning step. This results in a greater reduction of the computation ...

In this paper we introduce a well-motivated abstract pruning criterion for LVCSR decoders based on the anticipated recombination of HMM state alignment paths. We show that several heuristical pruning methods common in dynamic network decoders are approximations of this pruning criterion. The abstract criterion is too complex to be applied directly in an efficient manner, so we derive approximat...

We provide an algorithm that finds optimal search strategies for and trees and or trees. Our model includes three outcomes when a node is explored: (1) finding a solution, (2) not finding a solution and realizing that there are no solutions beneath the current node (pruning), and (3) not finding a solution but not pruning the nodes below. The expected cost of examining a node and the probabilit...

Pruning is an unavoidable necessity of virtually all arboreal fruit crops. In the tropics and subtropics, pruning of mango (Mangifera indica L.) is particularly important due to its tendency for frequent flushes, especially in humid tropics. Commercial orchards must maintain control of both tree size and orchard productivity in order to remain productive. Tip, formation, and severe pruning can ...

Abstrak. Penelitian ini dilaksanakan di Kebun Percobaan dan Laboratorium Fisiologi Tumbuhan Fakultas Pertanian, Universitas Syiah Kuala. berlangsung dari bulan Oktober hingga Desember 2021 menggunakan Rancangan Acak Kelompok pola faktorial. Faktor pertama yaitu waktu pemangkasan pucuk mentimun tanpa pucuk, 2 minggu setelah tanam, 3 tanam. kedua konsentrasi pupuk organik cair 0, 2, 4 6 ml L-1 ai...

Objective: To determine the effect of pruning on seedlings Jatropha curcas L. during nursery stage.Design/Methodology/Approach: thenursery stage, a study was carried out at CPA “Abel Santamaría” Martí municipality,Cuba. A complete randomized design used. Three treatments (T) were tested: 1) control (without pruning),2) 30 cm above soil and seedling defoliation, 3) without seedlingdefoliation. d...

The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the other hand, the pruning algorithms based on posterior calculations such as BIC (MDL) and MEP are faster, but they sometimes produce too big or small trees to yield poor generalization errors. In this paper, we propose a...

In this paper, games with chance nodes are analysed. The evaluation of these game trees uses the expectiminimax algorithm. We present pruning techniques involving random effects. The gamma-pruning aims at increasing the efficiency of expectiminimax (analogously to alpha-beta pruning and the classical minimax). Some interesting properties of these games are shown: for instance, a game without dr...