| Web日志挖掘中事务识别的研究 |
| |
| 引用本文： | 刘邦桂.Web日志挖掘中事务识别的研究[J].广东广播电视大学学报,2009,18(3):109-112. |
| |
| 作者姓名： | 刘邦桂 |
| |
| 作者单位： | 广东广播电视大学,广东广州,510091 |
| |
| 摘 要： | 事务识别在Web日志挖掘步骤中至关重要，如果没有高效的识别算法，挖掘的效率将大打折扣。本文详细研究了事务识别的两种模型，介绍并改进了基于最大向前引用模型的识别方法MFP算法，同时对这两种方法进行了比较，结果表时，改进后的MFP算法具有更高的挖掘效率。
|
| 关 键 词： | Web日志挖掘 数据预处理 最大向前访问路径 |
On Transaction Identification of Web Log Mining |
| |
| LIU Bang-gui.On Transaction Identification of Web Log Mining[J].Journal of Guangdong Radio & Television University,2009,18(3):109-112. |
| |
| Authors: | LIU Bang-gui |
| |
| Institution: | LIU Bang-gui (Guangdong Radio ＆ TV University Guangzhou, Guangdong, China, 510091) |
| |
| Abstract: | Transaction identification plays a key role in the process of web log mining. Without efficient identification arithmetic, the efficiency of web log mining will be greatly reduced, This paper begins with a detailed analysis on transaction identification two models, and follow by the introduction of identification method based on the maximal forward path（MFP）, and concluded with an exploration of examples . |
| |
| Keywords: | web log mining data preprocessing maximal forward path |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
