Sentence examples for split policy from inspiring English sources

Splitting up UKBA, like the previous decision to split policy and operations, could actually make this worse.

Another split policy for the M-Tree MAM restricted to multidimensional data was presented in [14].

Its strategy consists in employing the minimum spanning tree (MST) algorithm as a node split policy, reducing the complexity to O(n2 log(n)) distance calculations.

When another element must be inserted in a full node, a new node is created (split) and the elements are distributed between the two nodes according to a node split policy.

An ideal split policy must select two elements as representatives and their respective coverage radii, defining balls, partitioning the data elements into two sets, creating branches with the minimum possible overlap, aiming at efficient queries.

A simple split policy (random) selects two random elements as the representatives and then distributes the node elements by minimizing the coverage radii up to the capacity of the nodes.

The four node split policies presented herein, for M-tree and Slim-tree, meet these requirements.

The experiments show that the new split policies build more efficient trees in less time.

An illustration of this issue can be seen in Figure 2 in which (b) presents an overlap region greater than (a). Figure 2 An illustration of different split policies and the resulting overlap among nodes.

The three sets of experiments presented herein were designed with the intent to evaluate MAM built with the four node split policies regarding both querying and mining complex datasets.

In this article we present four node split policies that can be employed in the construction of M-tree, the pioneer dynamic MAM, and of Slim-tree, the M-tree successor.