A parallel data generator for efficiently generating "realistic" social streams

被引:1
|
作者
Yu, Chengcheng [1 ]
Xia, Fan [2 ]
Qian, Weining [2 ]
Zhou, Aoying [2 ]
机构
[1] Shanghai Polytech Univ, Coll Comp & Informat Engn, Shanghai 201209, Peoples R China
[2] East China Normal Univ, Sch Data Sci & Engn, Shanghai 200062, Peoples R China
关键词
social stream; data generator; SSG; parallel generation; POWER LAWS; HEAVY TAILS; INTERNET; NETWORKS; MODEL; TOPOLOGIES; GRAPHS; ORIGIN;
D O I
10.1007/s11704-018-8022-z
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A social stream refers to the data stream that records a series of social entities and the dynamic interactions between two entities. It can be employed to model the changes of entity states in numerous applications. The social streams, the combination of graph and streaming data, pose great challenge to efficient analytical query processing, and are key to better understanding users' behavior. Considering of privacy and other related issues, a social stream generator is of great significance. A framework of synthetic social stream generator (SSG) is proposed in this paper. The generated social streams using SSG can be tuned to capture several kinds of fundamental social stream properties, including patterns about users' behavior and graph patterns. Extensive empirical studies with several real-life social stream data sets show that SSG can produce data that better fit to real data. It is also confirmed that SSG can generate social stream data continuously with stable throughput and memory consumption. Furthermore, we propose a parallel implementation of SSG with the help of asynchronized parallel processing model and delayed update strategy. Our experiments verify that the throughput of the parallel implementation can increase linearly by increasing nodes.
引用
收藏
页码:1072 / 1101
页数:30
相关论文
共 13 条
  • [1] A parallel data generator for efficiently generating “realistic” social streams
    Chengcheng Yu
    Fan Xia
    Weining Qian
    Aoying Zhou
    Frontiers of Computer Science, 2019, 13 : 1072 - 1101
  • [2] HIDS: A Multifunctional Generator of Hierarchical Data Streams
    Wang, Xiaoyu
    Liu, Hongyan
    Er, Daoxin
    DATA BASE FOR ADVANCES IN INFORMATION SYSTEMS, 2009, 40 (02): : 29 - 36
  • [3] Human-Driven Dynamic Community Influence Maximization in Social Media Data Streams
    Ge, Jun
    Shi, Lei-Lei
    Wu, Yan
    Liu, Jie
    IEEE ACCESS, 2020, 8 : 162238 - 162251
  • [4] causalAssembly: Generating Realistic Production Data for Benchmarking Causal Discovery
    Goebler, Konstantin
    Windisch, Tobias
    Drton, Mathias
    Pychynski, Tim
    Sonntag, Steffen
    Roth, Martin
    CAUSAL LEARNING AND REASONING, VOL 236, 2024, 236 : 609 - 642
  • [5] Semantic Analysis of Social Data Streams
    Amato, Flora
    Cozzolino, Giovanni
    Moscato, Francesco
    Xhafa, Fatos
    ADVANCES IN INTELLIGENT NETWORKING AND COLLABORATIVE SYSTEMS, 2019, 23 : 59 - 70
  • [6] Proactive Policy for Efficiently Updating Join Views on Continuous Queries Over Data Streams and Linked Data
    Chun, Sejin
    Jung, Jooik
    Lee, Kyong-Ho
    IEEE ACCESS, 2019, 7 : 86226 - 86241
  • [7] Generating realistic training images from synthetic data for excavator pose estimation
    Pham, Hieu T. T. L.
    Han, Sanguk
    AUTOMATION IN CONSTRUCTION, 2024, 167
  • [8] A Survey on Event Tracking in Social Media Data Streams
    Han, Zixuan
    Shi, Leilei
    Liu, Lu
    Jiang, Liang
    Fang, Jiawei
    Lin, Fanyuan
    Zhang, Jinjuan
    Panneerselvam, John
    Antonopoulos, Nick
    BIG DATA MINING AND ANALYTICS, 2024, 7 (01): : 217 - 243
  • [9] Metaheuristic enabled hot event detection and product recommendation in social media data streams
    Thomas, Manu G.
    Senthil, S.
    INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS, 2023, 29 (06) : 573 - 597
  • [10] Generating Situational Awareness of Pedestrian and Vehicular Movement in Urban Areas Using IoT Data Streams
    Mills, Nishan
    de Silva, Daswin
    Alahakoon, Damminda
    IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (05) : 4395 - 4402