Introduction Bonferroni Pruning Pruning is a common technique to avoid over tting in decision trees. Most pruning techniques do not account for one important factor | multiple comparisons. Multiple comparisons occur when an induction algorithm examines several candidate models and selects the one that best accords with the data. Making multiple comparisons produces incorrect inferences about mo...

among the most important mineral nutrients calcium is involved in determining fruit quality. there is one approad to increase fruit firmness, how to harvest, transport and storage of kiwifruit in iran is not appropriate and resulting damages caused by careless use of traditional methods in the field to offer to the consumer is very high. how harvest, transport and storage of kiwifruit, in iran,...

The increased cost of labor in modern viticulture stemming from the nature operations that require physical strength and precision, coupled with shortages, poses a significant constraint facilitating scheduling seasonal activities. Therefore, autonomous collaborative robots present potential solution for achieving sustainable development objectives decreasing operational expenditures agricultur...

In this study, we tackled the reduction of computational complexity by pruning the igo game tree using the potential model based on the knowledge expression of igo. The potential model considers go stones as potentials. Specific potential distributions on the go board result from each arrangement of the stones on the go board. Pruning using the potential model categorizes the legal moves into e...

This paper addresses the problem of generalizing temporal data based on calendar (date and time) attributes. The proposed method is based on a domain generalization graph, i.e., a lattice deening a partial order that represents a set of generalization relations for the attribute. We specify the components of a domain generalization graph suited to calendar attributes. We deene granularity, subs...

Recent DNN pruning algorithms have succeeded in reducing the number of parameters in fully connected layers, often with little or no drop in classification accuracy. However, most of the existing pruning schemes either have to be applied during training or require a costly retraining procedure after pruning to regain classification accuracy. We start by proposing a cheap pruning algorithm for f...

The logic programming community has a love{hate relationship with operators for pruning the search space of logic programs such as cut, commit, once, conditionals and variations on these. Pruning operators typically are not declarative, result in incom-pleteness and/or unsoundness, decrease readability and exibility of code and make program analysis and transformation more diicult. Despite this...