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資料分類