Filters








18,678 Hits in 5.4 sec

An Efficient Decentralized Multidimensional Data Index: A Proposal

Francesco Gargiulo, Antonio Picariello, Vincenzo Moscato
2018 Proceedings of the 7th International Conference on Data Science, Technology and Applications  
Preliminary experiments have demonstrated that in about 65% of cases it starts a query in a random peer that does not involve the peer containing the root of the tree and in the 98% of cases it terminates  ...  the query in a peer that does not contain the root of the tree.  ...  Binary trees can be considered as k-d trees with one dimension and all k-d tree algorithms (insert, delete and search) apply to binary tree also.  ... 
doi:10.5220/0006851202310238 dblp:conf/data/GargiuloPM18 fatcat:iruj4ep3gbhypkckkzeftncsde

Randomized K-Dimensional Binary Search Trees [chapter]

Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez
1998 Lecture Notes in Computer Science  
This paper introduces randomized K-dimensional binary search trees (randomized Kd-trees), a variant of K-dimensional binary trees.  ...  We show that several types of associative queries are e ciently supported by randomized Kd-trees.  ...  K-Dimensional Search Trees Multidimensional binary search trees (K-dimensional search trees, Kd-trees) are a generalization of binary search trees to handle the case of multidimensional records.  ... 
doi:10.1007/3-540-49381-6_22 fatcat:4intdbx6cfg2nbp7pz32d5hvbe

Ingestion, Indexing and Retrieval of High-Velocity Multidimensional Sensor Data on a Single Node [article]

Juan A. Colmenares, Reza Dorrigiv, Daniel G. Waddington
2017 arXiv   pre-print
Its design centers around a two-level indexing structure, wherein the global index is an in-memory R*-tree and the local indices are serialized kd-trees.  ...  In addition, we evaluate a kd-tree partitioning based scheme for grouping incoming streamed data records.  ...  Each data segment contains multidimensional data records and a kd-tree [18] to index them.  ... 
arXiv:1707.00825v1 fatcat:idgvaejzljdc3j75wlp4sw756m

A Multi-Dimensional Data Storage Using Quad-Tree and Z-Ordering

Fang Hou, Cheng Hui Huang, Ji Yuan Lu
2013 Applied Mechanics and Materials  
Multi-dimensional applications use tree structure to store data and space filling curves to traverse data. Most frequently used Quad-tree and Z-ordering curve are analyzed.  ...  The most common used data structures for multidimensional application are the following 7 kinds of trees: kd-tree [7] , BSP-tree [8] , R-tree, R+-tree [9] , R*-tree, Quad-tree [10] , and Oct-tree  ...  The first 2 are binary trees, the branches numbers of following 3 are not fixed, and the last 2 are configured by dimension numbers of the data objects.  ... 
doi:10.4028/www.scientific.net/amm.347-350.2436 fatcat:kwtbnzmz2zgf3mkqqxsoodzub4

Page 6977 of Mathematical Reviews Vol. , Issue 99j [page]

1999 Mathematical Reviews  
Multidimensional binary trees arise in the construction of search trees for multidimensional keys.  ...  Mutafchiev (BG-AOS-A; Sofia) 99j:60013 60C05 05C05 Kemp, Rainer (D-FRNK-I; Frankfurt am Main) On the joint distribution of the nodes in uniform multidimensional binary trees.  ... 

Sovereign Debt Crisis – An Approach Based on Clusterization and Binary Classification Branche

Stelian Stancu, Alexandra Maria Constantin, Oana Mădălina Predescu, Steliana Violeta Stancu
2013 Procedia - Social and Behavioral Sciences  
Trees, Random Forest, Alternating Decision Tree, Naïve Bayesian Classifier, Bayesian Logistic Regression).  ...  Thus, in the multidimensional analysis of the sovereign debt crisis we will use advanced techniques such as: clusterization or those ased on binary classification branches (C 4.5, CART, Logistic Model  ...  Next, we will briefly explain the basic concept of Binary Recursive Trees (BRT). A tree is called binary if every node has at most two branches.  ... 
doi:10.1016/j.sbspro.2013.10.142 fatcat:dx7iefeufrd47igdrlu3ji37zu

Indexing method for multidimensional vector data

Justin Terry, Bela Stantic
2013 Computer Science and Information Systems  
This problem stems from the fact that multidimensional data has no order that preserves proximity.  ...  Efficient management of multidimensional data is a challenge when building modern database applications that involve many fold data such as temporal, spatial, data warehousing, bio-informatics, etc.  ...  It is worth stressing that the binary partitioning tree is only virtual in our approach.  ... 
doi:10.2298/csis120702022t fatcat:kcw22u5fgbe75lvtot3azdzwim

On Sampling in Higher-Dimensional Peer-to-Peer Systems [chapter]

Goran Konjevod, Andréa W. Richa, Donglin Xia
2006 Lecture Notes in Computer Science  
We present fully distributed algorithms for random sampling of nodes in peer-to-peer systems, extending and generalizing the work of King and Saia [Proceedings of PODC 2004] from simple Chord-like distributed  ...  This binary tree will be used for finding a suitable routing path during random sampling operations.  ...  Figure 3 illustrates the binary partition tree for the network shown in Figure 2 . Each leaf of the binary tree corresponds to an existing zone (peer).  ... 
doi:10.1007/11682462_59 fatcat:emzseie23ngijo4o7rfkzrs4vu

A survey of P2P multidimensional indexing structures [article]

Ewout Bongers, Johan Pouwelse
2015 arXiv   pre-print
Several proposals for P2P multidimensional indexes are reviewed and analyzed. Znet and VBI-tree are the most promising from a technical standpoint.  ...  Traditional databases have long since reaped the benefits of multidimensional indexes. Numerous proposals in the literature describe multidimensional index designs for P2P systems.  ...  However since it is a binary split, much like the kD-tree, the number of splits should again be similar, irrespective of dimensionality.  ... 
arXiv:1507.05501v1 fatcat:lf5zbvnklnda7ofjrkgyhrs3au

Randomized Ternary Search Tries [article]

Nicolai Diethelm
2017 arXiv   pre-print
This paper presents a new kind of self-balancing ternary search trie that uses a randomized balancing strategy adapted from Aragon and Seidel's randomized binary search trees ("treaps").  ...  After any sequence of insertions and deletions of strings, the tree looks like a ternary search trie built by inserting strings in random order.  ...  In a randomized binary search tree, each node is equally likely to be the root.  ... 
arXiv:1606.04042v20 fatcat:atuab7p625gl3gxerbdtyiv54m

Partial match queries in relaxed multidimensional search trees

C. Martínez, A. Panholzer, H. Prodinger
2001 Algorithmica  
We show that the probabilistic analysis of the relaxed multidimensional trees is very similar to that of standard K d-trees and K d-tries, and also to the analysis of quadtrees.  ...  We also compute the average cost of partial matches in other relaxed multidimensional digital tries, namely, relaxed K d-Patricia and relaxed K d-digital search trees.  ...  We may now symbolically write, for C(z, u), C(z, u) = t λ(t)z |t| u pm(t) , where the sum extends to all binary trees t, and λ(t) is the probability that a random permutation produces the binary search  ... 
doi:10.1007/bf02679618 fatcat:3lmqyyfqqvhtzhtdhpuvrwpleu

Page 612 of Educational and Psychological Measurement Vol. 74, Issue 4 [page]

2014 Educational and Psychological Measurement  
Tree-Based Item Response Models De Boeck and Partchev (2012) proposed item response models for data with a binary response tree (hereafter abbreviated as IRTree models).  ...  A response tree assumes that the observed responses Y can be recoded into any assumed pattern of binary responses for the internal nodes Y*. Table 1 shows a mapping matrix for this response tree.  ... 

Page 3329 of Mathematical Reviews Vol. , Issue 93f [page]

1993 Mathematical Reviews  
After an extensive chapter on basic tools there are chapters on binary search trees, search trees with higher branching factors, trees for multidimensional data, tries and finally digital search trees.  ...  Summary: “This paper presents simple randomized algorithms for dynamically embedding M-node binary trees in either a butterfly or a hypercube network of N processors.  ... 

Partial Match Queries in Relaxed K-dt trees

Amalia Duch, Gustavo Lau
2017 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)  
It was not until recently that fixed (as opposed to random) partial match queries were studied for random relaxed K-d trees, random standard K-d trees, and random 2-dimensional quad trees.  ...  The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech's 1986 seminal paper on partial match retrieval.  ...  Since the n K-dimensional points of the random tree T are a random permutation, when n is less than 2t + 1 the probability that the left subtree has size j is just 1/n as in random binary search trees.  ... 
doi:10.1137/1.9781611974775.13 dblp:conf/analco/DuchL17 fatcat:sbuqqrnmxff55k3gzoecuh7equ

Unsupervised Learning With Random Forest Predictors

Tao Shi, Steve Horvath
2006 Journal of Computational And Graphical Statistics  
A random forest (RF) predictor is an ensemble of individual tree predictors. As part of their construction, RF predictors naturally lead to a dissimilarity measure between the observations.  ...  The tree predictors of the random forest aim to separate synthetic from observed data. Hence each tree will be enriched with splitting variables that are dependent on other variables.  ...  RANDOM FOREST DISSIMILARITIES An RF predictor is an ensemble of individual classification tree predictors (Breiman 2001) .  ... 
doi:10.1198/106186006x94072 fatcat:gxkfl65rgnhrra4olzj74i3mke
« Previous Showing results 1 — 15 out of 18,678 results