返回
A streaming sampling algorithm for social activity networks using fixed structure learning automata
DOI:10.1007/s10489-017-1005-1.png)
摘要
En 中文
Social activity networks are formed from activities among users (such as wall posts, tweets, emails, and etc.), where any activity between two users results in an addition of an edge to the network graph. These networks are streaming and include massive volume of edges. A streaming graph is considered to be a stream of edges that continuously evolves over time. This paper proposes a sampling algorithm for social activity networks, implemented in a streaming fashion. The proposed algorithm utilizes a set of fixed structure learning automata. Each node of the original activity graph is equipped with a learning automaton which decides whether its corresponding node should be added to the sample set or not. The proposed algorithm is compared with the best streaming sampling algorithm reported so far in terms of Kolmogorov-Smirnov (KS) test and normalized L-1 and L-2 distances over real-world activity networks and synthetic networks presented as a sequence of edges. The experimental results show the superiority of the proposed algorithm.
Keyword:
Social networks
Activity networks
Network sampling
Streaming sampling
Learning automata
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Effects of CuO Sintering Aids on Microstructure and Electric Properties for (Na0.48K0.473Li0.04Sr0.007) (Nb0.883Ta0.05Sb0.06Ti0.007)O3 Ceramics
Crystals
IF0
The Palmitoylation Machinery Is a Spatially Organizing System for Peripheral Membrane Proteins
Cell
IF0

