用于web用户挖掘的软最大关联规则

I. R. Yanto, Arif Rahman, Youes Saaadi
{"title":"用于web用户挖掘的软最大关联规则","authors":"I. R. Yanto, Arif Rahman, Youes Saaadi","doi":"10.1109/ICSITECH.2016.7852659","DOIUrl":null,"url":null,"abstract":"Association rule mining of the web user transaction is one of important techniques for extracting information from web data, including its content, link, and user information using data mining tool. This technique finds a pattern and causal relation between items on given databases. The Maximal Association Rule is a data mining tools to determine the association rule the rough set theory based. Accordingly, the rough set can be defined in a form of soft set. This paper presents an implementation of Soft Maximal Association Rule which is the soft set theory based for web mining. The experiment shows that the computation of the proposed technique outperforms comparing to the baseline technique.","PeriodicalId":447090,"journal":{"name":"2016 2nd International Conference on Science in Information Technology (ICSITech)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Soft Maximal Association Rule for web user mining\",\"authors\":\"I. R. Yanto, Arif Rahman, Youes Saaadi\",\"doi\":\"10.1109/ICSITECH.2016.7852659\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Association rule mining of the web user transaction is one of important techniques for extracting information from web data, including its content, link, and user information using data mining tool. This technique finds a pattern and causal relation between items on given databases. The Maximal Association Rule is a data mining tools to determine the association rule the rough set theory based. Accordingly, the rough set can be defined in a form of soft set. This paper presents an implementation of Soft Maximal Association Rule which is the soft set theory based for web mining. The experiment shows that the computation of the proposed technique outperforms comparing to the baseline technique.\",\"PeriodicalId\":447090,\"journal\":{\"name\":\"2016 2nd International Conference on Science in Information Technology (ICSITech)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 2nd International Conference on Science in Information Technology (ICSITech)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSITECH.2016.7852659\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Science in Information Technology (ICSITech)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSITECH.2016.7852659","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

web用户事务关联规则挖掘是利用数据挖掘工具从web数据中提取信息的重要技术之一,包括web数据的内容、链接和用户信息。该技术在给定数据库上查找项目之间的模式和因果关系。最大关联规则是一种基于粗糙集理论确定关联规则的数据挖掘工具。因此,粗糙集可以定义为软集的形式。本文提出了一种基于软集理论的web挖掘软最大关联规则的实现方法。实验表明,该算法的计算性能优于基线算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Soft Maximal Association Rule for web user mining
Association rule mining of the web user transaction is one of important techniques for extracting information from web data, including its content, link, and user information using data mining tool. This technique finds a pattern and causal relation between items on given databases. The Maximal Association Rule is a data mining tools to determine the association rule the rough set theory based. Accordingly, the rough set can be defined in a form of soft set. This paper presents an implementation of Soft Maximal Association Rule which is the soft set theory based for web mining. The experiment shows that the computation of the proposed technique outperforms comparing to the baseline technique.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Web based fuzzy expert system for lung cancer diagnosis An empirical evaluation of ERP values using RBV approach in Indonesia A survey on data-driven approaches in educational games Enhancing e-learning system to support learning style based personalization Certificate policy and Certification Practice Statement for root CA Indonesia
×
引用
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