research
∙
07/19/2023
Efficient Non-Learning Similar Subtrajectory Search
Similar subtrajectory search is a finer-grained operator that can better...
share
research
∙
07/12/2023
DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs
The widespread use of graph data in various applications and the highly ...
research
∙
05/26/2023
Unleashing the Potential of Unsupervised Deep Outlier Detection through Automated Training Stopping
Outlier detection (OD) has received continuous research interests due to...
research
∙
04/25/2023
Towards Generating Hop-constrained s-t Simple Path Graphs
Graphs have been widely used in real-world applications, in which invest...
research
∙
02/27/2023
Minimizing the Influence of Misinformation via Vertex Blocking
Information cascade in online social networks can be rather negative, e....
research
∙
02/19/2023
Dynamic Private Task Assignment under Differential Privacy
Data collection is indispensable for spatial crowdsourcing services, suc...
research
∙
11/16/2022
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs
The shortest-path distance is a fundamental concept in graph analytics a...
research
∙
10/24/2022
Are we really making much progress in unsupervised graph outlier detection? Revisiting the problem with new insight and superior method
A large number of studies on Graph Outlier Detection (GOD) have emerged ...
research
∙
09/13/2022
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs
The Feedback vertex set with the minimum size is one of Karp's 21 NP-com...
research
∙
08/26/2022
Towards Higher-order Topological Consistency for Unsupervised Network Alignment
Network alignment task, which aims to identify corresponding nodes in di...
research
∙
04/01/2022
Balanced Clique Computation in Signed Networks: Concepts and Algorithms
Clique is one of the most fundamental models for cohesive subgraph minin...
research
∙
03/25/2022
Efficient k-clique Listing with Set Intersection Speedup [Technical Report]
Listing all k-cliques is a fundamental problem in graph mining, with app...
research
∙
01/25/2022
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching
Subgraph matching is a fundamental problem in various fields that use gr...
research
∙
01/10/2022
GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models [Technical Report]
With the development of traffic prediction technology, spatiotemporal pr...
research
∙
10/23/2021
Towards User Engagement Dynamics in Social Networks
The engagement of each user in a social network is an essential indicato...
research
∙
08/20/2021
Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server
In this paper, we study the privacy-preserving task assignment in spatia...
research
∙
07/19/2021
A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing [technical report]
With the rapid development of smart mobile devices, the car-hailing plat...
research
∙
03/30/2021
Higher-Order Neighborhood Truss Decomposition
k-truss model is a typical cohesive subgraph model and has been received...
research
∙
01/05/2021
Reinforcement Learning based Collective Entity Alignment with Adaptive Features
Entity alignment (EA) is the task of identifying the entities that refer...
research
∙
12/21/2020
PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA
Graph plays a vital role in representing entities and their relationship...
research
∙
11/17/2020
Efficient and Effective Community Search on Large-scale Bipartite Graphs
Bipartite graphs are widely used to model relationships between two type...
research
∙
10/18/2020
A Framework to Quantify Approximate Simulation on Graph Data
Simulation and its variants (e.g., bisimulation and degree-preserving si...
research
∙
08/05/2020
Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs
We propose a novel cohesive subgraph model called τ-strengthened (α,β)-c...
research
∙
06/24/2020
Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems
Matrix Factorization (MF) has been widely applied in machine learning an...
research
∙
06/20/2020
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
Triangle listing is an important topic significant in many practical app...
research
∙
05/12/2020
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions
Entity interaction prediction is essential in many important application...
research
∙
04/20/2020
Taming the Expressiveness and Programmability of Graph Analytical Queries
Graph database has enjoyed a boom in the last decade, and graph queries ...
research
∙
04/19/2020
Binarized Graph Neural Network
Recently, there have been some breakthroughs in graph analysis by applyi...
research
∙
03/15/2020
CoinMagic: A Differential Privacy Framework for Ring Signature Schemes
By allowing users to obscure their transactions via including "mixins" (...
research
∙
03/02/2020
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System
Graph is a ubiquitous structure in many domains. The rapidly increasing ...
research
∙
01/16/2020
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
Cohesive subgraph mining in bipartite graphs becomes a popular research ...
research
∙
12/18/2019
Collective Embedding-based Entity Alignment via Adaptive Features
Entity alignment (EA) identifies entities that refer to the same real-wo...
research
∙
06/27/2019
Critical Edge Identification: A K-Truss Based Model
In a social network, the strength of relationships between users can sig...
research
∙
06/27/2019
A Survey and Experimental Analysis of Distributed Subgraph Matching
Recently there emerge many distributed algorithms that aim at solving su...
research
∙
06/27/2019
K-Core Maximization through Edge Additions
A popular model to measure the stability of a network is k-core - the ma...
research
∙
06/02/2019
Efficient Algorithms for Densest Subgraph Discovery
Densest subgraph discovery (DSD) is a fundamental problem in graph minin...
research
∙
04/29/2019
A Survey of Community Search Over Big Graphs
With the rapid development of information technologies, various big grap...
research
∙
10/26/2018
Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information
Driven by many real applications, we study the problem of seeded graph m...
research
∙
11/16/2017
An Optimal and Progressive Approach to Online Search of Top-k Influential Communities
Community search over large graphs is a fundamental problem in graph ana...
research
∙
10/31/2017
Dynamical SimRank Search on Time-Varying Networks
In this article, we study the efficient dynamical computation of all-pai...
research
∙
09/20/2017
Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation
Graph edit distance (GED) is an important similarity measure adopted in ...
research
∙
01/18/2017
Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval
Given a query photo issued by a user (q-user), the landmark retrieval is...
research
∙
08/19/2016
