433 citations · 968 across the 48 of their papers we have counts for
50 papers
Efficient Non-Learning Similar Subtrajectory Search
Jiabao Jin, Peng Cheng, Lei Chen +2
Similar subtrajectory search is a finer-grained operator that can better capture the similarities between one query trajectory and a portion of a data trajectory than the tradition…
DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs
Qingshuai Feng, You Peng, Wenjie Zhang +2
The widespread use of graph data in various applications and the highly dynamic nature of today's networks have made it imperative to analyze structural trends in dynamic graphs on…
Towards Generating Hop-constrained s-t Simple Path Graphs
Yuzheng Cai, Siyuan Liu, Weiguo Zheng +1
Graphs have been widely used in real-world applications, in which investigating relations between vertices is an important task. In this paper, we study the problem of generating t…
Minimizing the Influence of Misinformation via Vertex Blocking
Jiadong Xie, Fan Zhang, Kai Wang +2
Information cascade in online social networks can be rather negative, e.g., the spread of rumors may trigger panic. To limit the influence of misinformation in an effective and eff…
HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs
Zhengyi Yang, Wenjie Zhang, Xuemin Lin +2
Hypergraphs are generalisation of graphs in which a hyperedge can connect any number of vertices. It can describe n-ary relationships and high-order information among entities comp…
Dynamic Private Task Assignment under Differential Privacy
Leilei Du, Peng Cheng, Libin Zheng +4
Data collection is indispensable for spatial crowdsourcing services, such as resource allocation, policymaking, and scientific explorations. However, privacy issues make it challen…
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs
You Peng, Zhuo Ma, Wenjie Zhang +3
The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are…
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs
You Peng, Xuemin Lin, Michael Yu +2
The Feedback vertex set with the minimum size is one of Karp's 21 NP-complete problems targeted at breaking all the cycles in a graph. This problem is applicable to a broad variety…
Towards Higher-order Topological Consistency for Unsupervised Network Alignment
Qingqiang Sun, Xuemin Lin, Ying Zhang +2
Network alignment task, which aims to identify corresponding nodes in different networks, is of great significance for many subsequent applications. Without the need for labeled an…
Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach
Qingshuai Feng, You Peng, Wenjie Zhang +2
With the ever-increasing prevalence of graph data in a wide spectrum of applications, it becomes essential to analyze structural trends in dynamic graphs on a continual basis. The…
Balanced Clique Computation in Signed Networks: Concepts and Algorithms
Zi Chen, Long Yuan, Xuemin Lin +2
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks. However, in real world, ma…
Efficient k-clique Listing with Set Intersection Speedup [Technical Report]
Zhirong Yuan, You Peng, Peng Cheng +4
Listing all k-cliques is a fundamental problem in graph mining, with applications in finance, biology, and social network analysis. However, owing to the exponential growth of the…
GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models [Technical Report]
Jiabao Jin, Peng Cheng, Lei Chen +2
With the development of traffic prediction technology, spatiotemporal prediction models have attracted more and more attention from academia communities and industry. However, most…
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching
Hanchen Wang, Ying Zhang, Lu Qin +3
Subgraph matching is a fundamental problem in various fields that use graph structured data. Subgraph matching algorithms enumerate all isomorphic embeddings of a query graph q in…
Towards User Engagement Dynamics in Social Networks
Qingyuan Linghu, Fan Zhang, Xuemin Lin +2
The engagement of each user in a social network is an essential indicator for maintaining a sustainable service. Existing studies use the of a user to well estimate its…
Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server
Maocheng Li, Jiachuan Wang, Libin Zheng +4
In this paper, we study the privacy-preserving task assignment in spatial crowdsourcing, where the locations of both workers and tasks, prior to their release to the server, are pe…
HUGE: An Efficient and Scalable Subgraph Enumeration System
Zhengyi Yang, Longbin Lai, Xuemin Lin +2
Subgraph enumeration is a fundamental problem in graph analytics, which aims to find all instances of a given query graph on a large data graph. In this paper, we propose a system…
Higher-Order Neighborhood Truss Decomposition
Zi Chen, Long Yuan, Li Han +1
-truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the -truss model only considers the direct common neighbors…
FAST: FPGA-based Subgraph Matching on Massive Graphs
Xin Jin, Zhengyi Yang, Xuemin Lin +3
Subgraph matching is a basic operation widely used in many applications. However, due to its NP-hardness and the explosive growth of graph data, it is challenging to compute subgra…
PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA
Zhengmin Lai, You Peng, Shiyu Yang +2
Graph plays a vital role in representing entities and their relationships in a variety of fields, such as e-commerce networks, social networks and biological networks. Given two ve…
Efficient and Effective Community Search on Large-scale Bipartite Graphs
Kai Wang, Wenjie Zhang, Xuemin Lin +3
Bipartite graphs are widely used to model relationships between two types of entities. Community search retrieves densely connected subgraphs containing a query vertex, which has b…
A Framework to Quantify Approximate Simulation on Graph Data
Xiaoshuang Chen, Longbin Lai, Lu Qin +2
Simulation and its variants (e.g., bisimulation and degree-preserving simulation) are useful in a wide spectrum of applications. However, all simulation variants are coarse "yes-or…
Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs
Yizhang He, Kai Wang, Wenjie Zhang +2
We propose a novel cohesive subgraph model called -strengthened -core (denoted as -core), which is the first to consider both tie strength and vertex engagement…
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
Michael Yu, Lu Qin, Ying Zhang +2
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orient…