搜索结果
找到约 4 项符合
high-dimensional 的查询结果
数据结构 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 for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.
数据结构 X-tree的C++源码
X-tree的C++源码，对应文章S. Berchtold, D. A. Keim, H.-P. Kriegel: The X-tree : An Index Structure for High-Dimensional Data.
数据结构 TV-tree的c实现源码
TV-tree的c实现源码，对应原文章K.-I. Lin, H. V. Jagadish, C. Faloutsos: The TV-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 irrelevant data, increase learning accuracy, and improve results comprehensibility. FCBF is a fast correlation-based filter algorithm designed for high-dimen ...