利用WAP树矿进行有效的web日志挖掘

A. Venkatasubramaniam, S. Dinakar, C. Marikkani, D. Karthikeswaran
{"title":"利用WAP树矿进行有效的web日志挖掘","authors":"A. Venkatasubramaniam, S. Dinakar, C. Marikkani, D. Karthikeswaran","doi":"10.1109/INTERACT.2010.5706197","DOIUrl":null,"url":null,"abstract":"World Wide Web is a huge data repository and is growing with the explosive rate of about 1 million pages a day, web log records each access of the web page and number of entries in the web logs is increasing rapidly. These web logs, when mined properly can provide useful information for decision-making. Sequential pattern mining discovers frequent user access patterns from web logs. Since Apriori-like sequential pattern mining techniques requires expensive multiple scans of database. But, recently a novel data structure, known as Web Access Pattern Tree (or WAP-tree), was developed. This proposed method an efficient WAP-tree mining algorithm, known as DLT-mine (Doubly Linked Tree algorithm). Proposed recursive algorithm uses this doubly Linked tree to efficiently find all access patterns that satisfy user specified criteria. This mining algorithm is faster than the other Apriori-based mining algorithms.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"69 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Effective web log mining using WAP tree-mine\",\"authors\":\"A. Venkatasubramaniam, S. Dinakar, C. Marikkani, D. Karthikeswaran\",\"doi\":\"10.1109/INTERACT.2010.5706197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"World Wide Web is a huge data repository and is growing with the explosive rate of about 1 million pages a day, web log records each access of the web page and number of entries in the web logs is increasing rapidly. These web logs, when mined properly can provide useful information for decision-making. Sequential pattern mining discovers frequent user access patterns from web logs. Since Apriori-like sequential pattern mining techniques requires expensive multiple scans of database. But, recently a novel data structure, known as Web Access Pattern Tree (or WAP-tree), was developed. This proposed method an efficient WAP-tree mining algorithm, known as DLT-mine (Doubly Linked Tree algorithm). Proposed recursive algorithm uses this doubly Linked tree to efficiently find all access patterns that satisfy user specified criteria. This mining algorithm is faster than the other Apriori-based mining algorithms.\",\"PeriodicalId\":201931,\"journal\":{\"name\":\"INTERACT-2010\",\"volume\":\"69 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"INTERACT-2010\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INTERACT.2010.5706197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"INTERACT-2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTERACT.2010.5706197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

万维网是一个巨大的数据存储库,并以每天约100万页的爆炸式速度增长,网络日志记录了对网页的每次访问,网络日志中的条目数量正在迅速增加。如果挖掘得当,这些网络日志可以为决策提供有用的信息。顺序模式挖掘从web日志中发现频繁的用户访问模式。由于类似apriori的顺序模式挖掘技术需要对数据库进行昂贵的多次扫描。但是,最近开发了一种新的数据结构,称为Web访问模式树(Web Access Pattern Tree, WAP-tree)。提出了一种高效的wap树挖掘算法,即DLT-mine(双链接树算法)。提出的递归算法利用这种双链接树有效地找到满足用户指定条件的所有访问模式。该算法比其他基于apriori的挖掘算法更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Effective web log mining using WAP tree-mine
World Wide Web is a huge data repository and is growing with the explosive rate of about 1 million pages a day, web log records each access of the web page and number of entries in the web logs is increasing rapidly. These web logs, when mined properly can provide useful information for decision-making. Sequential pattern mining discovers frequent user access patterns from web logs. Since Apriori-like sequential pattern mining techniques requires expensive multiple scans of database. But, recently a novel data structure, known as Web Access Pattern Tree (or WAP-tree), was developed. This proposed method an efficient WAP-tree mining algorithm, known as DLT-mine (Doubly Linked Tree algorithm). Proposed recursive algorithm uses this doubly Linked tree to efficiently find all access patterns that satisfy user specified criteria. This mining algorithm is faster than the other Apriori-based mining algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信