85 citations · 225 across the 16 of their papers we have counts for
7 papers · 1 filter
SAH: Shifting-aware Asymmetric Hashing for Reverse -Maximum Inner Product Search
Qiang Huang, Yanhao Wang, Anthony K. H. Tung
This paper investigates a new yet challenging problem called Reverse -Maximum Inner Product Search (RMIPS). Given a query (item) vector, a set of item vectors, and a set of u…
Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams
Jingjing Wang, Yanhao Wang, Wenjun Jiang +2
A great variety of complex systems, from user interactions in communication networks to transactions in financial markets, can be modeled as temporal graphs consisting of a set of…
Graph Summarization via Node Grouping: A Spectral Algorithm
Arpit Merchant, Michael Mathioudakis, Yanhao Wang
Graph summarization via node grouping is a popular method to build concise graph representations by grouping nodes from the original graph into supernodes and encoding edges into s…
Balancing Utility and Fairness in Submodular Maximization (Technical Report)
Yanhao Wang, Yuchen Li, Francesco Bonchi +1
Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recomm…
Happiness Maximizing Sets under Group Fairness Constraints (Technical Report)
Jiping Zheng, Yuan Ma, Wei Ma +2
Finding a happiness maximizing set (HMS) from a database, i.e., selecting a small subset of tuples that preserves the best score with respect to any nonnegative linear utility func…
Streaming Algorithms for Diversity Maximization with Fairness Constraints
Yanhao Wang, Francesco Fabbri, Michael Mathioudakis
Diversity maximization is a fundamental problem with wide applications in data summarization, web search, and recommender systems. Given a set of elements, it asks to selec…