共被期刊论文引用了2次
您的检索式：您选中1篇文献正在查看引证文献汇总
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 基于大数据分析的移动互联网服务提供商流量挖掘与建模(英文)显示文摘Understanding the dynamic traffic and usage characteristics of data services in cellular networks is important for optimising network resources and improving user experience.Recent studies have illustrated traffic characteristics from specific perspectives,such as user behaviour,device type,and applications.In this paper,we present the results of our study from a different perspective,namely service providers,to reveal the traffic characteristics of cellular data networks.Our study is based on traffic data collected over a five-day period from a leading mobile operator's core network in China.We propose a Zipf-like model to characterise the distributions of the traffic volume,subscribers,and requests among service providers.Nine distinct diurnal traffic patterns of service providers are identified by formulating and solving a time series clustering problem.Our work differs from previous related works in that we perform measurements on a large quantity of data covering 2.2 billion traffic records,and we first explore the traffic patterns of thousands of service providers.Results of our study present mobile Internet participants with a better understanding of the traffic and usage characteristics of service providers,which play a critical role in the mobile Internet era. | 刘军 李婷婷 CHENG Gang 于华 雷振明 | 2013 | China Communications2013，10，12： | 3 |
| 2 | 流数据环境下基于k集合覆盖的分布式标签共现算法显示文摘通过分析集值属性的标签共现频率,可以挖掘频繁模式以及进行异常的检测。为了提高标签共现计算的性能,提出了一种流数据环境下基于k集合覆盖的分布式标签共现算法。采用多集合的容斥原理对标签共现问题进行了分析,并提出了一种分布式标签共现计算流程;通过引入信息检索中的倒排索引对标签及其出处进行索引,基于k集合覆盖的思想将整个倒排索引划分到多个分布式从节点上,并根据流数据的变化动态地更新每个从节点的局部索引,在对所有从节点的结果进行汇聚后得到最终结果。实验表明,提出的基于k集合覆盖的分布式标签共现算法与其他算法相比较,不仅具有较低的平均更新时间,而且使用更少的索引副本,因而更适用于大规模流数据的标签共现计算。 | 朱明 李跃新 | 2016 | 计算机应用研究2016，33，2： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员