翻訳と辞書 Words near each other ・ M-Source ・ M-spline ・ M-Sport ・ M-Sport World Rally Team ・ M-Squared Breese ・ M-Systems ・ M-Tag ・ M-tel (Bosnia and Herzegovina) ・ M-Tel Masters ・ M-theory ・ M-Theory (learning framework) ・ M-Toluic acid ・ M-Towers ・ M-Train ・ M-Tram ・ M-tree ・ M-type asteroid ・ M-V ・ M-Wave ・ M-Xylene ・ M-Xylene (data page) ・ M. & N. Hanhart ・ M. A. Abdul Majeed ・ M. A. Aleem ・ M. A. Alford ・ M. A. Ayyangar ・ M. A. Aziz Stadium ・ M. A. Baby ・ M. A. Bayfield ・ M. A. Benton House Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク M-tree ： ウィキペディア英語版 M-tree M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle inequality for efficient range and k-NN queries. While M-trees can perform well in many conditions, the tree can also have large overlap and there is no clear strategy on how to best avoid overlap. In addition, it can only be used for distance functions that satisfy the triangle inequality, while many advanced dissimilarity functions used in information retrieval do not satisfy this. ==Overview== As in any Tree-based data structure, the M-Tree is composed of Nodes and Leaves. In each node there is a data object that identifies it uniquely and a pointer to a sub-tree where its children reside. Every leaf has several data objects. For each node there is a radius $r$ that defines a Ball in the desired metric space. Thus, every node $n$ and leaf $l$ residing in a particular node $N$ is at most distance $r$ from $N$, and every node $n$ and leaf $l$ with node parent $N$ keep the distance from it. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「M-tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.