SR-tree is an index structure for high-dimensional nearest neighbor queries
SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially...
high-dimensional技术资料
📦 资源总数：859
📄 技术文档：1
💻 源代码：17428
🔥 high-dimensional热门资料
查看全部859个资源 »TV-tree的c实现源码
TV-tree的c实现源码，对应原文章K.-I. Lin, H. V. Jagadish, C. Faloutsos: The TV-Tree: An Index Structure for High-Dimensional Data....
X-tree的C++源码
X-tree的C++源码，对应文章S. Berchtold, D. A. Keim, H.-P. Kriegel: The X-tree : An Index Structure for High-Dimensional Data....
Feature selection is a preprocessing technique frequently used in data mining and machine learning t
Feature selection is a preprocessing technique frequently used in data mining and machine learning tasks. It can reduce dimensionality, remove irrelev...
In this paper, we consider the problem of filtering in relational hidden Markov models. We present
In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an a...
📂 high-dimensional资料分类