📄 894.txt
字号:
发信人: xlcy (all nothing), 信区: DataMining
标 题: 如何理解这些词汇
发信站: 南京大学小百合站 (Sun Mar 10 09:58:37 2002), 站内信件
In a technical paper, the author introduces a sequential ARM algorithm,SEAR,to
the reader.
"Andreas Mueller's Sequential Efficient Association Rules algorithm is
identical to Apriori, except that SEAR stores candidates in a prefix tree
~~~~~~~~~~~~~在数据
结构中,对应的名词是什么?
instead of a hash tree. In a prefix tree(also called trie), each edge is
labeled by items; common prefixes are represented by tree branches, and
the unique suffixes are stored at the leaves. Also,SEAR uses a pass-bundling
~~~~~~~~~~~如何
理解?
optimization, where it generates candidates for multiple passes if the
~~~~~~~~~~~~~~~~如何翻译?
candidates will fit in memory."
--
※ 来源:.南京大学小百合站 bbs.nju.edu.cn.[FROM: 211.71.70.1]
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -