基于马尔可夫链的WEB页面访问序列特征挖掘算法研究

Gang Liu, Han-wun Guo
{"title":"基于马尔可夫链的WEB页面访问序列特征挖掘算法研究","authors":"Gang Liu, Han-wun Guo","doi":"10.1109/ITA.2013.57","DOIUrl":null,"url":null,"abstract":"Web access to sequence data mining to help improve the quality of Web access, the sequence is a difficult problem in data mining, the prevalence of classic sequential algorithm and storage space overhead is too large defects. Web access sequence mining algorithm based on Markov chain can be found through less computation requests a web page. And for the design of the site, and achieved good results. Recognize that the most likely path through the site through the Web click-stream in order to predict the users will want to browse web pages, and accordingly to improve the design and construction of the site. Less computation to find the requested page, optimization of the hyperlink structure of the Web site.","PeriodicalId":285687,"journal":{"name":"2013 International Conference on Information Technology and Applications","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research of a Mining Algorithm Based on Markov Chain on WEB Page Access Sequence Features\",\"authors\":\"Gang Liu, Han-wun Guo\",\"doi\":\"10.1109/ITA.2013.57\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Web access to sequence data mining to help improve the quality of Web access, the sequence is a difficult problem in data mining, the prevalence of classic sequential algorithm and storage space overhead is too large defects. Web access sequence mining algorithm based on Markov chain can be found through less computation requests a web page. And for the design of the site, and achieved good results. Recognize that the most likely path through the site through the Web click-stream in order to predict the users will want to browse web pages, and accordingly to improve the design and construction of the site. Less computation to find the requested page, optimization of the hyperlink structure of the Web site.\",\"PeriodicalId\":285687,\"journal\":{\"name\":\"2013 International Conference on Information Technology and Applications\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Information Technology and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2013.57\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2013.57","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

对Web访问进行序列数据挖掘有助于提高Web访问质量,序列问题是数据挖掘中的一个难题,存在经典序列算法盛行且存储空间开销过大的缺陷。基于马尔可夫链的Web访问序列挖掘算法可以通过较少的计算请求找到一个Web页面。并对网站进行了设计,取得了良好的效果。认识到通过网站点击流最有可能通过网站的路径,从而预测用户会想要浏览的网页,并据此改进网站的设计和建设。减少了查找请求页面的计算,优化了网站的超链接结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research of a Mining Algorithm Based on Markov Chain on WEB Page Access Sequence Features
Web access to sequence data mining to help improve the quality of Web access, the sequence is a difficult problem in data mining, the prevalence of classic sequential algorithm and storage space overhead is too large defects. Web access sequence mining algorithm based on Markov chain can be found through less computation requests a web page. And for the design of the site, and achieved good results. Recognize that the most likely path through the site through the Web click-stream in order to predict the users will want to browse web pages, and accordingly to improve the design and construction of the site. Less computation to find the requested page, optimization of the hyperlink structure of the Web site.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信