In this paper we have developed an algorithm that converts a given k-ary tree, for any k ≥ 3, to its equivalent binary tree structure. The binary tree is generated in O(n) time, for a k-ary tree with a total of n nodes. The algorithm is designed aiming at reducing the height of the constructed binary tree. The constructed tree does not contain any free links in the non-leaf nodes. That means th...

We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-tree is a metric access method for similarity search in large multimedia databases. As an extension of M-tree, the structure of PM-tree exploits local dynamic pivots (like M-tree does it) as well as global static pivots (used by LAESA-like methods). While in M-tree a metric region is represented by a hyper-...

As a basic method of spatial data operation, keyword query can provide meaningful information to meet user demands by searching textual datasets. How accurately understand users’ intentions and efficiently retrieve results from big are always the focus research. Spatial their complex correlation between features not only enrich connotation objects but also bring difficulties efficient recogniti...

Tree-like isometric subgraphs of hypercubes, or tree-like partial cubes as we shall call them, are a generalization of median graphs. Just as median graphs they capture numerous properties of trees, but encompass a larger class of graphs that may be easier to recognize than the class of median graphs. We investigate the structure of tree-like partial cubes, characterize them, and provide exampl...

Answering a question raised by Luis Pereira, we show that a continuous tree-like scale can exist above a supercompact cardinal. We also show that the existence of a continuous tree-like scale at אω is consistent with Martin’s Maximum.

<span lang="EN-US">Machine learning is a cutting-edge technology used for predicting and diagnosing various diseases. Various machine algorithm facilitates the prediction. The decision tree belongs to that performs both classification constructs tree-like evaluate best features. well in prediction of Endometriosis recurrence disease creates an emotional impact women. lump-like structure a...

Feature based similarity search is emerging as an important search paradigm in database systems. The technique used is to map the data items as points into a high dimensional feature space which is indexed using a multidimensional data structure. Similarity search then corresponds to a range search over the data structure. Although several data structures have been proposed for feature indexing...

We recast the idea of decision trees as they emerge in Information theory and Complexity theory into a set theoretical language; the result we call tree structures over a given set. We identify all main structural elements of tree structures, the most important of which is the tree function, defined as a sum over certain quantities at every nod in the tree. We show in detail that the minimizati...