1) prefix tree
前缀树
1.
Those item sets are stored in a new data structure of prefix tree callcd DSFP-SW-tree.
以前缀树(DSFP-SW-tree) 来存储每个基本窗口的临界频繁项集,结合剪枝算法,快速挖掘滑动窗口中所有频繁模式。
2.
In order to manage these clutered services, the prefix tree-based semantic web service discovery mechanism is proposed.
为有效管理分簇的Web服务,文中继而给出了基于前缀树的语义Web服务发现系统。
3.
In view of that the boolean association rules can not express the association of fuzzy data, this paper gives a series of definitions of fuzzy association rules and proposes a mining algorithm based on prefix tree for fuzzy association rules.
针对布尔型关联规则不能表达挖掘对象中模糊信息的关联性,给出一系列有关模糊关联规则的定义,并提出一种基于前缀树的模糊关联规则挖掘算法。
2) proper-prefix tree
真前缀树
3) K-Prefix Tree
K-前缀树
1.
As to resolve this problem,this paper describes an full-text search method called K-Prefix Tree full-text search method.
当前应用广泛的后缀树和后缀数组全文搜索方法在搜索速度和计算空间方面各有特点和局限,本文正是针对此问题提出了K-前缀树全文搜索方法。
4) Prefix-Cuboidtree
前缀小方树
5) 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算法存在动态维护复杂、在挖掘过程中需要递归地创建大量的条件频繁模式树,导致时空效率不高等不足,本算法在压缩前缀树的基础上,通过调整树中节点信息和节点链,采用深度优先的策略挖掘频繁模式,无需任何附加的数据结构,极大地减少了系统资源的消耗,减少树的规模和遍历次数,挖掘效率大大提高。
6) prefix projected accumulated tree
前缀映射累加树
补充资料：前缀
1.加在词根前面的构词成分﹐如"老鼠"﹑"老虎"里的"老"﹐"阿姨"里的"阿"。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条