Similar subtrajectory search is a finer-grained operator that can better...
The widespread use of graph data in various applications and the highly
...
Outlier detection (OD) has received continuous research interests due to...
Graphs have been widely used in real-world applications, in which
invest...
Information cascade in online social networks can be rather negative, e....
Data collection is indispensable for spatial crowdsourcing services, suc...
The shortest-path distance is a fundamental concept in graph analytics a...
A large number of studies on Graph Outlier Detection (GOD) have emerged ...
The Feedback vertex set with the minimum size is one of Karp's 21 NP-com...
Network alignment task, which aims to identify corresponding nodes in
di...
Clique is one of the most fundamental models for cohesive subgraph minin...
Listing all k-cliques is a fundamental problem in graph mining, with
app...
Subgraph matching is a fundamental problem in various fields that use gr...
With the development of traffic prediction technology, spatiotemporal
pr...
The engagement of each user in a social network is an essential indicato...
In this paper, we study the privacy-preserving task assignment in spatia...
With the rapid development of smart mobile devices, the car-hailing plat...
k-truss model is a typical cohesive subgraph model and has been received...
Entity alignment (EA) is the task of identifying the entities that refer...
Graph plays a vital role in representing entities and their relationship...
Bipartite graphs are widely used to model relationships between two type...
Simulation and its variants (e.g., bisimulation and degree-preserving
si...
We propose a novel cohesive subgraph model called τ-strengthened
(α,β)-c...
Matrix Factorization (MF) has been widely applied in machine learning an...
Triangle listing is an important topic significant in many practical
app...
Entity interaction prediction is essential in many important application...
Graph database has enjoyed a boom in the last decade, and graph queries
...
Recently, there have been some breakthroughs in graph analysis by applyi...
By allowing users to obscure their transactions via including "mixins" (...
Graph is a ubiquitous structure in many domains. The rapidly increasing ...
Cohesive subgraph mining in bipartite graphs becomes a popular research ...
Entity alignment (EA) identifies entities that refer to the same real-wo...
In a social network, the strength of relationships between users can
sig...
Recently there emerge many distributed algorithms that aim at solving
su...
A popular model to measure the stability of a network is k-core - the ma...
Densest subgraph discovery (DSD) is a fundamental problem in graph minin...
With the rapid development of information technologies, various big grap...
Driven by many real applications, we study the problem of seeded graph
m...
Community search over large graphs is a fundamental problem in graph
ana...
In this article, we study the efficient dynamical computation of all-pai...
Graph edit distance (GED) is an important similarity measure adopted in ...
Given a query photo issued by a user (q-user), the landmark retrieval is...
Multi-view spectral clustering, which aims at yielding an agreement or
c...