SHOGUN v0.9.0
组合类型 | 宏定义
Trie.h文件参考

浏览该文件的源代码。

组合类型

class  CTrie< Trie >

宏定义

#define IGNORE_IN_CLASSLIST
 Template class Trie implements a suffix trie, i.e. a tree in which all suffixes up to a certain length are stored.

宏定义文档

#define IGNORE_IN_CLASSLIST

Template class Trie implements a suffix trie, i.e. a tree in which all suffixes up to a certain length are stored.

It is excessively used in the CWeightedDegreeStringKernel and CWeightedDegreePositionStringKernel to construct the whole features space $\Phi(x)$ and enormously helps here to speed up SVM training and evaluation.

Note that depending on the underlying structure used, a single symbol in the tree requires 20 bytes (DNATrie). It is also used to do the efficient recursion in computing positional oligomer importance matrices (POIMs) where the structure requires * 20+3*8 (POIMTrie) bytes.

Finally note that this tree may use compact internal nodes (for strings that appear without modifications, thus not requiring further branches), which may save a lot of memory on higher degree tries.

在文件Trie.h155行定义。


SHOGUN Machine Learning Toolbox - Documentation