test.log
来自「关联规则中转换树算法在VC下的实现」· LOG 代码 · 共 31 行
LOG
31 行
Input data file: D:\Data\Bin_WinStyle\TEST.BDT
Mining algorithm: CFPmine for mining FI.
Minimal support threshold: 20.00
Minimal confidence threshold: 80.00
Start time: Tue May 18 20:21:05.486 2004
First scan end time: Tue May 18 20:21:05.536 2004
First scan cost: 0.050 seconds
Total transactions: 9
Absolute support threshold: 2
Size of frequent 1-itemset: 5 .
Second scan (construct CFP-tree) end time: Tue May 18 20:21:05.536 2004
Second scan cost: 0.000 seconds
Maximal FI number in a transaction is: 4 .
There are 11 nodes in the tree.
total number of frequent itemsets: 13
Mining end time: Tue May 18 20:21:05.536 2004
Mining cost: 0.000 seconds
Total cost: 0.050 seconds
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?