An Approach of Community Search with Minimum Spanning Tree Based on Node Embedding
Community search is a query-oriented variant of community detection problem, and the goal is to retrieve a single community from a given set of nodes. Most of the existing community search methods adopt handcrafted features, so there are some limitations in applications. Our idea is motivated by the...
Saved in:
Main Authors: | Jinglian Liu, Daling Wang, Shi Feng, Yifei Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2021/6673444 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Polynomial Time Approximation Schemes for the Constrained Minimum
Spanning Tree Problem
by: Yen Hung Chen
Published: (2012-01-01) -
A Resting-State Brain Functional Network Study in MDD Based on Minimum Spanning Tree Analysis and the Hierarchical Clustering
by: Xiaowei Li, et al.
Published: (2017-01-01) -
On the Number of Spanning Trees of Graphs
by: Ş. Burcu Bozkurt, et al.
Published: (2014-01-01) -
Searching for Minimum in Dependence of Squared Speed-of-Sound on Collision Energy
by: Fu-Hu Liu, et al.
Published: (2016-01-01) -
Node and Edge Joint Embedding for Heterogeneous Information Network
by: Lei Chen, et al.
Published: (2024-09-01)