Association rule mining for web usage data to improve websites

Avadh Kishor Singh, Ajeet Kumar, A. Maurya
{"title":"Association rule mining for web usage data to improve websites","authors":"Avadh Kishor Singh, Ajeet Kumar, A. Maurya","doi":"10.1109/ICAETR.2014.7012882","DOIUrl":null,"url":null,"abstract":"Association rule mining along with frequent items has been comprehensively research in data mining. In this paper, we proposed a model for association rules to mine the generated frequent k-itemset. We take this process as extraction of rules which expressed most useful information. Therefore, transactional knowledge of using websites is considered to solve the purpose. In this paper we use interestingness measure that plays an important role in invalid rules thereby reducing the size of rule data sets. The performance analysis attempted with Apriori, most frequent rule mining algorithm and interestingness measure to compare the efficiency of websites. The proposed work reduces large number of immaterial rules and produces new set of rules with interesting measure. Our extensive experiments will use relevant rule mining to enhance websites and data accuracy.","PeriodicalId":196504,"journal":{"name":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR - 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAETR.2014.7012882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Association rule mining along with frequent items has been comprehensively research in data mining. In this paper, we proposed a model for association rules to mine the generated frequent k-itemset. We take this process as extraction of rules which expressed most useful information. Therefore, transactional knowledge of using websites is considered to solve the purpose. In this paper we use interestingness measure that plays an important role in invalid rules thereby reducing the size of rule data sets. The performance analysis attempted with Apriori, most frequent rule mining algorithm and interestingness measure to compare the efficiency of websites. The proposed work reduces large number of immaterial rules and produces new set of rules with interesting measure. Our extensive experiments will use relevant rule mining to enhance websites and data accuracy.
关联规则挖掘web使用数据,改进网站
关联规则挖掘和频繁项挖掘在数据挖掘中得到了广泛的研究。在本文中,我们提出了一种关联规则模型来挖掘生成的频繁k项集。我们把这个过程看作是对表达最有用信息的规则的提取。因此,使用网站的交易知识被认为是解决问题的目的。在本文中,我们使用了在无效规则中起重要作用的有趣度度量,从而减少了规则数据集的大小。性能分析尝试使用Apriori、最常用的规则挖掘算法和兴趣度度量来比较网站的效率。该方法减少了大量的非物质规则,并产生了一套具有有趣度量的新规则。我们广泛的实验将使用相关的规则挖掘来提高网站和数据的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信