75 citations · 473 across the 72 of their papers we have counts for
4 papers · 1 filter
Utilizing Dynamic Properties of Sharing Bits and Registers to Estimate User Cardinalities over Time
Pinghui Wang, Peng Jia, Xiangliang Zhang +3
Online monitoring user cardinalities (or degrees) in graph streams is fundamental for many applications. For example in a bipartite graph representing user-website visiting activit…
Submodular Optimization Over Streams with Inhomogeneous Decays
Junzhou Zhao, Shuo Shang, Pinghui Wang +2
Cardinality constrained submodular function maximization, which aims to select a subset of size at most to maximize a monotone submodular utility function, is the key in many d…
Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks
Junzhou Zhao, Shuo Shang, Pinghui Wang +2
Identifying influential nodes that can jointly trigger the maximum influence spread in networks is a fundamental problem in many applications such as viral marketing, online advert…
GESF: A Universal Discriminative Mapping Mechanism for Graph Representation Learning
Shupeng Gui, Xiangliang Zhang, Shuang Qiu +3
Graph embedding is a central problem in social network analysis and many other applications, aiming to learn the vector representation for each node. While most existing approaches…