Along with the rapid technological and commercial innovation on the e-commerce platforms,
there are an increasing number of frauds that bring great harm to these platforms. Many …

Maximal clique enumeration is a fundamental operator in graph analysis. The model of
clique, however, is typically too restrictive for real-world applications as it requires an edge …

(α, β)-core is an important cohesive subgraph model for bipartite graphs. Given a bipartite
graph G, the problem of (α, β)-core decomposition is to compute non-empty (α, β)-cores for …

As an important cohesive subgraph model in bipartite graphs, the (α, β)-core (aka bi-core)
has found a wide spectrum of real-world applications, such as product recommendation …

Finding cohesive subgraphs from a bipartite graph is a fundamental operator in bipartite
graph analysis. In this paper, we focus on the problem of mining cohesive subgraphs from a …

Mining cohesive subgraphs from a graph is a fundamental problem in graph data analysis.
One notable cohesive structure is γ-quasi-clique (QC), where each vertex connects at least a …

Enumerating maximal k-biplexes (MBPs) of a bipartite graph has been used for applications
such as fraud detection. Nevertheless, there usually exists an exponential number of MBPs …

Along with the rapid technological and commercial innovation on e-commerce platforms, an
increasing number of frauds cause great harm to these platforms. Many frauds are …

Evolving graphs consisting of slices are large and constantly changing. For example, in
Alipay, the graph generates hundreds of millions of new transaction records every day …

With the prevalence of graphs for modeling complex relationships among objects, the topic
of graph mining has attracted a great deal of attention from both academic and industrial …