We describe an experimental study of pruning methods for decision tree classi ers when the goal is minimizing loss rather than error. In addition to two common methods for error minimization, CART's cost-complexity pruning and C4.5's error-based pruning, we study the extension of cost-complexity pruning to loss and one pruning variant based on the Laplace correction. We perform an empirical com...

abstract in order to study the effect of planting density and branch pruning on growth, yield and quality of greenhouse muskmelon, a study has been conducted using a factorial experiment in a completely randomized design with three replications and three factors, including cultivar (galia-52 and mirella), branch pruning (1 and 2 branch per plant), and plant density (2, 2.4, 2.8 and 3.6 plants p...

This research on intercropping productivity of several soybean varieties based pruning corn plant leaves was carried out road Alai Kapalo Koto, Limau Manis, Pauh District, Padang at an altitude 101 meters above sea level from July to November 2022. The purpose this is investigate the relationship between various types and pruning. best leaf for development production, as well productivity. stud...

Broadcasting is a key component of several networking mechanisms in mobile ad hoc networks. However, its traditional implementation suffers from resource consumption caused by message redundancy. Several efficient algorithms have been proposed to tackle this problem. Among them, the class of algorithms that construct on-demand a connected dominating set, known as dominant pruning, yields an imp...

background: we aimed to observe the effect of holistic nursing on patients undergoing hematodialysis for uremia who simultaneously were suffering from moderate to severe malnutrition. methods: eighty patients with uremia on maintenance hematodialysis with malnutrition between june 2014 and june 2015 from yantaishan hospital, yantai, shandong, china were included and equally and randomly were di...

This paper presents techniques designed to minimise the number of states which are explored during subgraph isomorphism detection. A set of advanced topological node features, calculated from nneighbourhood graphs, is presented and shown to outperform existing features. Further, the pruning effectiveness of both the new and existing topological node features is significantly improved through th...

Mining large-scale text corpora is an essential step in extracting the key themes in a corpus. We motivate a quantitative measure for significant associations through the distributions of pairs and triplets of co-occurring words. We consider the algorithmic problem of efficiently enumerating such significant associations and present pruning algorithms for these problems, with theoretical as wel...

We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as a-0 pruning provides over minimax.

In this paper we present a new parallelization of an efficient best-first branch-and-bound algorithm to solve the constrained two-dimensional single stock guillotine cutting stock problem (CSP) to optimality. The underlying sequential branch-and-bound algorithm is based on an exact version of Wang's heuristic suggested by Viswanathan and Bagchi. In our algorithm we improve the upper bound and i...