一种新的基于gep的多层关联规则挖掘算法

Hong-guo Cai, Chang-an Yuan, Jin-Guang Luo, Jin-de Huang
{"title":"一种新的基于gep的多层关联规则挖掘算法","authors":"Hong-guo Cai, Chang-an Yuan, Jin-Guang Luo, Jin-de Huang","doi":"10.1109/CIS.2010.22","DOIUrl":null,"url":null,"abstract":"To mine popular accessed Web pages items and find out their association rule from the Web server Log database for junior users providing recommendation service. A novel GEP-based algorithm for mining multiple-layers association rules was presented. Firstly, takes generalizing technology as a way to value fitness function in GEP (Gene Expression Programming). Then, relying on the significant self-search function of GEP, the most optional species was evolved. The frequent items and association rules in the next deeper layers can be mined by using traditional support-confidence method in sub-database. The algorithm improves on the frame of traditional association rule mining and uses a new evolutionary algorithm for mining association rules. Finally, the validity and efficiency of the method are presented by the application in the paper.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Novel GEP-Based Multiple-Layers Association Rule Mining Algorithm\",\"authors\":\"Hong-guo Cai, Chang-an Yuan, Jin-Guang Luo, Jin-de Huang\",\"doi\":\"10.1109/CIS.2010.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To mine popular accessed Web pages items and find out their association rule from the Web server Log database for junior users providing recommendation service. A novel GEP-based algorithm for mining multiple-layers association rules was presented. Firstly, takes generalizing technology as a way to value fitness function in GEP (Gene Expression Programming). Then, relying on the significant self-search function of GEP, the most optional species was evolved. The frequent items and association rules in the next deeper layers can be mined by using traditional support-confidence method in sub-database. The algorithm improves on the frame of traditional association rule mining and uses a new evolutionary algorithm for mining association rules. Finally, the validity and efficiency of the method are presented by the application in the paper.\",\"PeriodicalId\":420515,\"journal\":{\"name\":\"2010 International Conference on Computational Intelligence and Security\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2010.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2010.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

针对提供推荐服务的初级用户,从Web服务器日志数据库中挖掘访问过的热门网页项,找出其关联规则。提出了一种新的基于gep的多层关联规则挖掘算法。首先,将泛化技术作为GEP(基因表达式编程)中适应度函数的取值方法。然后,依靠GEP的显著自搜索功能,进化出最可选择的物种。在子数据库中使用传统的支持度置信度方法可以挖掘出下一层的频繁项和关联规则。该算法改进了传统的关联规则挖掘框架,采用了一种新的进化算法进行关联规则挖掘。最后通过实例验证了该方法的有效性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel GEP-Based Multiple-Layers Association Rule Mining Algorithm
To mine popular accessed Web pages items and find out their association rule from the Web server Log database for junior users providing recommendation service. A novel GEP-based algorithm for mining multiple-layers association rules was presented. Firstly, takes generalizing technology as a way to value fitness function in GEP (Gene Expression Programming). Then, relying on the significant self-search function of GEP, the most optional species was evolved. The frequent items and association rules in the next deeper layers can be mined by using traditional support-confidence method in sub-database. The algorithm improves on the frame of traditional association rule mining and uses a new evolutionary algorithm for mining association rules. Finally, the validity and efficiency of the method are presented by the application in the paper.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信