39 citations · 62 across the 8 of their papers we have counts for
5 papers · 1 filter
A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets
Pinghui Wang, Yiyan Qi, Yuanming Zhang +4
Estimating set similarity and detecting highly similar sets are fundamental problems in areas such as databases, machine learning, and information retrieval. MinHash is a well-know…
A Fast Sketch Method for Mining User Similarities over Fully Dynamic Graph Streams
Peng Jia, Pinghui Wang, Jing Tao +1
Many real-world networks such as Twitter and YouTube are given as fully dynamic graph streams represented as sequences of edge insertions and deletions. (e.g., users can subscribe…
REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel
Pinghui Wang, Peng Jia, Yiyan Qi +3
Recently, considerable efforts have been devoted to approximately computing the global and local (i.e., incident to each node) triangle counts of a large graph stream represented a…
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…