首页 | 官方网站   微博 | 高级检索  
     

TRDFA:一种用于事务识别的DFA
引用本文:李文骏,黄金晶.TRDFA:一种用于事务识别的DFA[J].计算机工程与应用,2011,47(34):161-163.
作者姓名:李文骏  黄金晶
作者单位:1. 苏州大学图书馆,江苏苏州,215006
2. 苏州工业职业技术学院信息工程系,江苏苏州,215104
摘    要:在Web使用挖掘的预处理中,会话识别结束后需要经过路径补充将那些由于缓存而遗漏的页面补全,而后进行事务识别。构造了一个TRDFA,能从未经路径补充的会话中直接提取事务,并考虑了多窗口方式打开页面的情形。该方法对于只关心最终事务的用户而言,节省了整个预处理的时间,提高了效率。

关 键 词:会话识别  路径补充  事务识别
修稿时间: 

TRDFA:transaction recognition based on Deterministic Finite Automata
LI Wenjun,HUANG Jinjing.TRDFA:transaction recognition based on Deterministic Finite Automata[J].Computer Engineering and Applications,2011,47(34):161-163.
Authors:LI Wenjun  HUANG Jinjing
Affiliation:LI Wenjun1,HUANG Jinjing21.Library of Soochow University,Suzhou,Jiangsu 215006,China2.Department of Information and Engineering,Suzhou Institute of Industrial Technology,Jiangsu 215104,China
Abstract:In the preprocessing of Web usage mining,it is necessary to do path supplement for those missing pages after session recognition because of cache.After path supplement,transaction recognition should be done.This paper constructs a Deterministic Finite Automata(DFA) called TRDFA,which can reconstruct transactions directly from sessions without doing path supplement.At the same time,TRDFA considers this situation that some pages are opened from the new window.For those users who just concern on transactions,t...
Keywords:session recognition  path supplement  transaction recognition
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号