|
|||||
|
|
| 会话流中Top-k闭序列模式的挖掘 | |
| 引用本文： | 彭慧丽,张啸剑.会话流中Top-k闭序列模式的挖掘[J].计算机工程,2009,35(19):86-87,9. |
| 作者姓名： | 彭慧丽 张啸剑 |
| 作者单位： | 1. 河南省直广播电视大学教务科,郑州,450008 2. 河南财经学院计算机系,郑州,450002 |
| 基金项目： | 河南省科技厅基金资助项目"非线性降维技术在商业智能中的应用" |
| 摘 要： | 在会话流中挖掘Top—k闭序列模式，存在因相关比率P的大小而导致的内存消耗和挖掘精度之间的冲突。基于False—Negative方法，提出Tstream算法，制定2种约束策略限制ρ。基于该策略设计加权调和计数函数，渐进计算每个模式的支持度。实验结果证明了该算法的有效性。 |
| 关 键 词： | Top—k闭序列模式 加权调和平均数 调节因子 |
| 修稿时间： | |
Top-k Closed Sequential Pattern Mining in Session Streams |
|
| PENG Hui-li,ZHANG Xiao-jian.Top-k Closed Sequential Pattern Mining in Session Streams[J].Computer Engineering,2009,35(19):86-87,9. | |
| Authors: | PENG Hui-li ZHANG Xiao-jian |
| Affiliation: | (1. Department of Education, Henan Radio & Television University, Zhengzhou 450008; 2. Department of Computer Science, Henan University of Finance & Economics, Zhengzhou 450002) |
| Abstract: | The current methods in session streams for mining Top-k Closed Sequential Pattern(Topk_CSP) may lead to a conflict between output precision and memory consumption because of using ρ. This paper proposes TStream algorithm, which is based on False-Negative approach. TStream utilizes two constraint strategies to restrict ρ, and employs a weighted harmonic count function to calculate the support of each pattern progressively. Experimental results show that the algorithm is efficient. |
| Keywords: | Top-k Closed Sequential Pattern(Topk_CSP) Weighted Harmonic Average(WHA) regulatory factor |
| 本文献已被 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程》浏览原始摘要信息 | |
| 点击此处可从《计算机工程》下载全文 | |
