Sentence examples for based on pruning from inspiring English sources

Computation is based on a hypothesis tree and is exact, but an approximate version of the estimator is also proposed for large state spaces or long time horizons, based on pruning the hypothesis tree.

Because the problem becomes very difficult to solve as size increases, a heuristic is developed, based on pruning techniques, to solve the problem to near-optimality in a shorter period of time as compared to complete enumeration.

Given a file T, we suggest a data structure based on pruning a Huffman shaped Wavelet tree (WT) according to the underlying skeleton Huffman tree that enables direct access to the i-th element of T. This pruned WT is especially designed to support faster random access and save memory storage, at the price of less effective rank and select operations, as compared to the original Huffman shaped WT.

This observation calls into question rule extraction methodologies based on pruning, since this practice can lock the network into a subspace of achievable continuous valued logic functions that prevent it from mapping the simplest logic to explain the data.

This algorithm is aiming to create context-specific subnetwork in a random order based on heuristically pruning the generic human metabolic model.

For accurately forecasting the liquid steel temperature in ladle furnace (LF), a novel temperature prediction model based on optimally pruned Bagging combined with modified extreme learning machine (ELM) is proposed.

This procedure is based on network pruning using the orthogonal least-squares technique to determine insignificant or redundant synaptic weights, biases, hidden nodes and network inputs.

This algorithm uses random network initialisation and a simulated annealing algorithm, both of which are based on random pruning or branching processes, to converge the multi-objective properties of the networks; the reconstructed networks are directed tree graphs, conform to a given cumulative length and maximise the proportion of reconnected reaches.

RIPPER [ 63] is a direct rule extraction method based on a pruning procedure, whose aim is to minimize the error on the training set; it performs the following steps: i) growth of the rules; ii) pruning of the rules; iii) optimization of the model; iv) selection of the model.

In this paper, we use the SP-score and recast the motif finding problem as that of finding a maximum (or minimum) weight clique in a multi-partite graph, and introduce a two-pronged approach, based on graph pruning and mathematical programming, to solve it.

Finally, to demonstrate the generalizability of our weighted pathway method, we compared weighting SNPs based on LD vs. pruning SNPs at various LD cutoffs.