从Web数据流中挖掘间接关联的中介利用方法

Wen-Yang Lin, Yi-Ching Chen
{"title":"从Web数据流中挖掘间接关联的中介利用方法","authors":"Wen-Yang Lin, Yi-Ching Chen","doi":"10.1109/IBICA.2011.50","DOIUrl":null,"url":null,"abstract":"Recently, the concept of indirect associations, a new type of infrequent patterns that indirectly connect two rarely co-occurred items via a frequent item set called ¡§mediator¡¨, has been shown its power in capturing interesting information over web usage data. Most contemporary indirect association mining algorithms are developed for static dataset. Our previous work has proposed an algorithm, MIA-LM, tailored to streaming data. In this paper, we propose a new efficient algorithm, namely EMIA-LM, for mining indirect associations over web data streams. EMIA-LM employs a mediator-exploiting search strategy, which reduce the search space as well as computation cost for generating indirect associations. Besides, EMIA-LM adopts a compact data structure, alleviating unnecessary data transforming processes and consuming far less memory storage. Preliminary experiments conducted on real Web streaming datasets show that EMIA-LM is superior to the leading HI-mine* algorithm for static data and MIA-LM both in computation speed and memory consumption.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Mediator Exploiting Approach for Mining Indirect Associations from Web Data Streams\",\"authors\":\"Wen-Yang Lin, Yi-Ching Chen\",\"doi\":\"10.1109/IBICA.2011.50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, the concept of indirect associations, a new type of infrequent patterns that indirectly connect two rarely co-occurred items via a frequent item set called ¡§mediator¡¨, has been shown its power in capturing interesting information over web usage data. Most contemporary indirect association mining algorithms are developed for static dataset. Our previous work has proposed an algorithm, MIA-LM, tailored to streaming data. In this paper, we propose a new efficient algorithm, namely EMIA-LM, for mining indirect associations over web data streams. EMIA-LM employs a mediator-exploiting search strategy, which reduce the search space as well as computation cost for generating indirect associations. Besides, EMIA-LM adopts a compact data structure, alleviating unnecessary data transforming processes and consuming far less memory storage. Preliminary experiments conducted on real Web streaming datasets show that EMIA-LM is superior to the leading HI-mine* algorithm for static data and MIA-LM both in computation speed and memory consumption.\",\"PeriodicalId\":158080,\"journal\":{\"name\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IBICA.2011.50\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IBICA.2011.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

最近,间接关联的概念(一种新的不频繁模式,通过称为“中介”的频繁项集间接连接两个很少同时出现的项)在捕获web使用数据中的有趣信息方面显示出了其强大的功能。当前大多数间接关联挖掘算法都是针对静态数据集开发的。我们之前的工作提出了一种针对流数据定制的算法MIA-LM。在本文中,我们提出了一个新的高效算法,即EMIA-LM,用于挖掘web数据流上的间接关联。EMIA-LM采用利用中介的搜索策略,减少了生成间接关联的搜索空间和计算成本。此外,EMIA-LM采用了紧凑的数据结构,减少了不必要的数据转换过程,大大减少了内存存储的消耗。在真实的Web流数据集上进行的初步实验表明,MIA-LM在静态数据和MIA-LM的计算速度和内存消耗方面都优于目前领先的HI-mine*算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Mediator Exploiting Approach for Mining Indirect Associations from Web Data Streams
Recently, the concept of indirect associations, a new type of infrequent patterns that indirectly connect two rarely co-occurred items via a frequent item set called ¡§mediator¡¨, has been shown its power in capturing interesting information over web usage data. Most contemporary indirect association mining algorithms are developed for static dataset. Our previous work has proposed an algorithm, MIA-LM, tailored to streaming data. In this paper, we propose a new efficient algorithm, namely EMIA-LM, for mining indirect associations over web data streams. EMIA-LM employs a mediator-exploiting search strategy, which reduce the search space as well as computation cost for generating indirect associations. Besides, EMIA-LM adopts a compact data structure, alleviating unnecessary data transforming processes and consuming far less memory storage. Preliminary experiments conducted on real Web streaming datasets show that EMIA-LM is superior to the leading HI-mine* algorithm for static data and MIA-LM both in computation speed and memory consumption.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信