Research on User Access Sequence Mining Based on the Duration Time of Web Page

Changchun Yang, Jingya Sun, Ziyi Zhao
{"title":"Research on User Access Sequence Mining Based on the Duration Time of Web Page","authors":"Changchun Yang, Jingya Sun, Ziyi Zhao","doi":"10.1109/WISM.2010.13","DOIUrl":null,"url":null,"abstract":"By analysis of web user access sequence, we can find the factors of user's hobbies, interests, habits etc. and provide the necessary support of information for the upgrade and amendment of web sites. This article proposed a method of data mining MFASMDT (Maximal Frequent Access Sequence Mining of Duration Time). It can reduce the number of web pages of the session sequence and compress the size of frequent traversal sequence by taking the duration time of web page as a parameter. The experiment showed that the new algorithms can reduce the cost of mining and provide a useful reference for mining of web users’s commercial data.","PeriodicalId":119569,"journal":{"name":"2010 International Conference on Web Information Systems and Mining","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Web Information Systems and Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISM.2010.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

By analysis of web user access sequence, we can find the factors of user's hobbies, interests, habits etc. and provide the necessary support of information for the upgrade and amendment of web sites. This article proposed a method of data mining MFASMDT (Maximal Frequent Access Sequence Mining of Duration Time). It can reduce the number of web pages of the session sequence and compress the size of frequent traversal sequence by taking the duration time of web page as a parameter. The experiment showed that the new algorithms can reduce the cost of mining and provide a useful reference for mining of web users’s commercial data.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于网页持续时间的用户访问序列挖掘研究
通过对网站用户访问顺序的分析,可以发现用户的爱好、兴趣、习惯等因素,为网站的升级和修改提供必要的信息支持。提出了一种数据挖掘方法MFASMDT (maximum frequency Access Sequence mining of Duration Time)。以网页的持续时间作为参数,可以减少会话序列的网页数,压缩频繁遍历序列的大小。实验表明,新算法可以降低挖掘成本,为web用户商业数据的挖掘提供有益的参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Numerical Simulation of Micronized Re-burning (MCR) Organic Acid Salt Used as an Accelerator The Research of the Grouping Algorithm for Chinese Learners Based on Transitive Closure Research on Multi-colony Diploid Genetic Algorithm for Production Logistics Scheduling Optimization Application of Second Order Diagonal Recurrent Neural Network in Nonlinear System Identification Synchronization Research of Uncoupled Hyper-chaotic Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1