CCSS: Towards conductance-based community search with size constraints
Size-constrained community search, retrieving a size-bounded high-quality subgraph
containing user-specified query vertices, has been extensively studied in graph analysis …
containing user-specified query vertices, has been extensively studied in graph analysis …
QTCS: Efficient Query-Centered Temporal Community Search
Temporal community search is an important task in graph analysis, which has been widely
used in many practical applications. However, existing methods suffer from two major …
used in many practical applications. However, existing methods suffer from two major …
A Survey on Recent Random Walk-based Methods for Embedding Knowledge Graphs
Machine learning, deep learning, and NLP methods on knowledge graphs are present in
different fields and have important roles in various domains from self-driving cars to friend …
different fields and have important roles in various domains from self-driving cars to friend …
[PDF][PDF] Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach
The global community search problem is a fundamental network analysis task, which aims at
uncovering all communities with strong internal cohesiveness [10, 18, 32, 38, 41]. A notable …
uncovering all communities with strong internal cohesiveness [10, 18, 32, 38, 41]. A notable …