分布式多数据流频繁伴随模式挖掘
作者:
作者单位:

作者简介:

于自强(1984-),男,山东青岛人,博士,讲师,CCF专业会员,主要研究领域为时空数据分布式查询,流数据分布式计算;董吉文(1984-),男,博士,教授,CCF高级会员,主要研究领域为数字图像处理;禹晓辉(1977-),男,博士,教授,博士生导师,CCF专业会员,主要研究领域为海量数据管理与分析;王琳(1984-),男,博士,副教授,CCF专业会员,主要研究领域为机器学习,数据反向建模.

通讯作者:

王琳,E-mail:ise_wanglin@ujn.edu.cn

中图分类号:

基金项目:

国家自然科学基金(61702217,61771230,61772231,61873324);山东省重点研发计划(2017GGX10144,2018GGX101048,2017CXGC0701,2016ZDJS01A12);山东省自然科学基金(ZR2017MF025);济南大学科技发展计划(XKY1737,XKY1734)


Distributed Mining of Frequent Co-occurrence Patterns across Multiple Data Streams
Author:
Affiliation:

Fund Project:

National Natural Science Foundation of China (61702217, 61771230, 61772231, 61873324); Key Research and Development Program of Shandong Province (2017GGX10144, 2018GGX101048, 2017CXGC0701, 2016ZDJS01A12); Natural Science Foundation of Shandong Province of China (ZR2017MF025); Scientific and Technologic Development Program (XKY1737, XKY1734)

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    多数据流频繁伴随模式是指一组对象较短时间内在同一个数据流上伴随出现,并在之后一段时间以同样方式出现在其他多个数据流上.现实生活中,城市交通监控系统中的伴随车辆发现、基于签到数据的伴随人群发现、基于社交网络数据中的高频伴随词组发现热点事件等应用都可以归结为多数据流频繁伴随模式发现问题.由于数据流规模巨大且到达速度快,基于单机的集中式挖掘算法受到硬件资源的限制难以及时发现海量数据流中出现的频繁伴随模式.为此,提出面向大规模数据流频繁伴随模式发现的分布式挖掘算法.该算法首先将每个数据流划分成若干个segment片段,然后构建适合部署在分布式计算平台上的多层挖掘模型,并利用多计算节点以并行方式对大规模数据流进行处理,从而实时发现频繁伴随模式.最后,在真实数据集上进行充分实验以验证算法性能.

    Abstract:

    A frequent co-occurrence pattern across multiple data streams refers to a set of objects occurring in one data stream within a short time span and this set of objects appear in multiple data streams in the same fashion within another user-specified time span. Some real applications, such as discovering groups of cars that travel together using the city surveillance system, finding the people that are hanging out together based on their check-in data, and mining the hot topics by discovering groups of frequent co-occurrence keywords from social network data, can be abstracted as this problem. Due to data streams always own tremendous volumes and high arrival rates, the existing algorithms being designed for a centralized setting cannot handle mining frequent co-occurrence patterns from the large scale of streaming data with the limited computing resources. To address this problem, FCP-DM, a distributed algorithm to mine frequent co-occurrence patterns from a large number of data streams, is proposed. This algorithm first divides the data streams into segments, and then constructs a multilevel mining model in the distributed environment. This model utilizes multiple computing nodes for detecting massive volumes of data streams in a parallel pattern to discover frequent co-occurrence patterns in real-time. Finally, extensive experiments are conducted to fully evaluate the performance of the proposal.

    参考文献
    相似文献
    引证文献
引用本文

于自强,禹晓辉,董吉文,王琳.分布式多数据流频繁伴随模式挖掘.软件学报,2019,30(4):1078-1093

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2017-04-11
  • 最后修改日期:2017-06-09
  • 录用日期:
  • 在线发布日期: 2019-04-01
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号