1) non-compact suffix tree
非压缩后缀树
1.
This paper presents an on-line PPM prediction model based on non-compact suffix tree.
该文提出基于非压缩后缀树的在线PPM预测模型,采用非压缩后缀树实现增量式在线更新,提高了模型的更新速度。
2.
In order to improve the updating speed, it makes use of non-compact suffix tree to incrementally insert the new user request and delete the outdated browsing information.
该模型仅保留处于滑动窗口之内的最近访问序列,从而反映用户兴趣的变化,同时利用非压缩后缀树增量式添加新的用户请求和删除过时的浏览信息,以提高更新速度。
2) compressed prefix-tree
压缩前缀树
1.
In this paper,we propose a new algorithm CPM that designs a new tree structure called compressed prefix-tree,which stores all of the information in a highly compact form,decreases the consumption of system resources greatly.
针对FP-growth算法存在动态维护复杂、在挖掘过程中需要递归地创建大量的条件频繁模式树,导致时空效率不高等不足,本算法在压缩前缀树的基础上,通过调整树中节点信息和节点链,采用深度优先的策略挖掘频繁模式,无需任何附加的数据结构,极大地减少了系统资源的消耗,减少树的规模和遍历次数,挖掘效率大大提高。
3) Compressed Suffix Array(CSA)
压缩后缀数组
1.
In order to overcome the disadvantage of large memory cost as with full-text indexing,research is done for Compressed Suffix Array(CSA).
该文引入后缀数组技术进行全文索引,为克服全文索引时占用空间大的缺点,研究了压缩后缀数组技术,把后缀数组索引的大小压缩到了O(n)位,并给出应用压缩后缀数组索引的步骤和核心操作伪代码。
4) Suffix tree
后缀树
1.
Automatic extraction of software plans for program comprehension based on suffix trees;
基于后缀树的程序理解Plan自动提取
2.
Information extraction for web forum based on suffix tree;
基于后缀树的Web论坛信息抽取
3.
Research of automatic wrapper generation method based on suffix tree;
一种基于后缀树的包装器自动生成方法研究
5) prefix compression
前缀压缩
6) generalized suffix tree
广义后缀树
1.
To improve the clustering efficiency,a simple but reasonable measure for base cluster selection is presented to exclude some generalized suffix tree nodes which contribute less to the clustering.
为了进一步提高聚类效率,给出了一种简单有效的用于基类选择的测度,用来排除一些无意义的广义后缀树节点。
补充资料：非想非非想处天
1.佛教语。即三界中无色界第四天。此天没有欲望与物质﹐仅有微妙的思想。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条