51 citations · 90 across the 6 of their papers we have counts for
6 papers
QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
Yiyan Qi, Rundong Li, Pinghui Wang +2
Estimating cardinality, i.e., the number of distinct elements, of a data stream is a fundamental problem in areas like databases, computer networks, and information retrieval. This…
Fast Gumbel-Max Sketch and its Applications
Yuanming Zhang, Pinghui Wang, Yiyan Qi +4
The well-known Gumbel-Max Trick for sampling elements from a categorical distribution (or more generally a non-negative vector) and its variants have been widely used in areas such…
Multi-Task Fusion via Reinforcement Learning for Long-Term User Satisfaction in Recommender Systems
Qihua Zhang, Junning Liu, Yuzhuo Dai +5
Recommender System (RS) is an important online application that affects billions of users every day. The mainstream RS ranking framework is composed of two parts: a Multi-Task Lear…
Fast Generating A Large Number of Gumbel-Max Variables
Yiyan Qi, Pinghui Wang, Yuanming Zhang +3
The well-known Gumbel-Max Trick for sampling elements from a categorical distribution (or more generally a nonnegative vector) and its variants have been widely used in areas such…
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…
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…