Mining and Predicting Duplication over Peer-to-Peer Query Streams

S. Meng, Yifeng Shao, Congcong Shi, Dingyi Han, Yong Yu
{"title":"Mining and Predicting Duplication over Peer-to-Peer Query Streams","authors":"S. Meng, Yifeng Shao, Congcong Shi, Dingyi Han, Yong Yu","doi":"10.1109/ICDMW.2006.109","DOIUrl":null,"url":null,"abstract":"Many previous works of data mining user queries in peer-to-peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models (Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"278 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW.2006.109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Many previous works of data mining user queries in peer-to-peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models (Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction
点对点查询流的重复挖掘和预测
以前的许多点对点系统中用户查询的数据挖掘工作都集中在查询内容的分布上。然而,对于更好地理解这些查询的时间序列分布(这对系统性能至关重要),很少有人做过这样的工作。为了纠正这种情况,本文通过使用自动时间序列分析来挖掘查询流,以评估不同的线性模型(Box-Jenkins模型和一些简单的窗均值模型)来预测未来10分钟到2小时内重复查询的数量。这些模型的预测能力和计算成本都是在3个月内收集的318,942,450个真实Gnutella查询中进行评估的。我们发现重复查询的数量始终是可预测的。像AR这样简单实用的模型在预测方面表现良好
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书