85 citations · 219 across the 14 of their papers we have counts for
15 papers
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…
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…
ThunderRW: An In-Memory Graph Random Walk Engine (Complete Version)
Shixuan Sun, Yuhang Chen, Shengliang Lu +2
As random walk is a powerful tool in many graph processing, mining and learning applications, this paper proposes an efficient in-memory random walk engine named ThunderRW. Compare…
Cache-Efficient Fork-Processing Patterns on Large Graphs
Shengliang Lu, Shixuan Sun, Johns Paul +2
As large graph processing emerges, we observe a costly fork-processing pattern (FPP) that is common in many graph algorithms. The unique feature of the FPP is that it launches many…
DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version)
Qiuyi Lyu, Yuchen Li, Bingsheng He +1
Reachability query is a fundamental problem on graphs, which has been extensively studied in academia and industry. Since graphs are subject to frequent updates in many application…
Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)
Jingjing Wang, Yanhao Wang, Wenjun Jiang +2
A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of…
GRMR: Generalized Regret-Minimizing Representatives
Yanhao Wang, Michael Mathioudakis, Yuchen Li +1
Extracting a small subset of representative tuples from a large database is an important task in multi-criteria decision making. The regret-minimizing set (RMS) problem is recently…
A Fully Dynamic Algorithm for k-Regret Minimizing Sets
Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong +1
Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The -reg…
Discovering Hypernymy in Text-Rich Heterogeneous Information Network by Exploiting Context Granularity
Yu Shi, Jiaming Shen, Yuchen Li +7
Text-rich heterogeneous information networks (text-rich HINs) are ubiquitous in real-world applications. Hypernymy, also known as is-a relation or subclass-of relation, lays in the…
Coresets for Minimum Enclosing Balls over Sliding Windows
Yanhao Wang, Yuchen Li, Kian-Lee Tan
\emph{Coresets} are important tools to generate concise summaries of massive datasets for approximate analysis. A coreset is a small subset of points extracted from the original po…
Semantic and Influence aware k-Representative Queries over Social Streams
Yanhao Wang, Yuchen Li, Kian-Lee Tan
Massive volumes of data continuously generated on social platforms have become an important information source for users. A primary method to obtain fresh and valuable information…
Context-Sensitive Malicious Spelling Error Correction
Hongyu Gong, Yuchen Li, Suma Bhat +1
Misspelled words of the malicious kind work by changing specific keywords and are intended to thwart existing automated applications for cyber-environment control such as harassing…
Trajectory-driven Influential Billboard Placement
Ping Zhang, Zhifeng Bao, Yuchen Li +3
In this paper we propose and study the problem of trajectory-driven influential billboard placement: given a set of billboards (each with a location and a cost), a database of…
Efficient Representative Subset Selection over Sliding Windows
Yanhao Wang, Yuchen Li, Kian-Lee Tan
Representative subset selection (RSS) is an important tool for users to draw insights from massive datasets. Existing literature models RSS as the submodular maximization problem t…
Real-Time Influence Maximization on Dynamic Social Streams
Yanhao Wang, Qi Fan, Yuchen Li +1
Influence maximization (IM), which selects a set of users (called seeds) to maximize the influence spread over a social network, is a fundamental problem in a wide range of app…