Graph Vertex Embeddings: Distance, Regularization and Community Detection
원문 초록
Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space, enabling the use of efficient methods that employ the metric structure in the embedding space as a proxy for the topological structure of the data. In this paper, we explore several aspects that affect the quality of a vertex embedding of graph-structured data. To this effect, we first present a family of flexible distance functions that faithfully capture the topological distance between different vertices. Secondly, we analyze vertex embeddings as resulting from a fitted transformation of the distance matrix rather than as a direct result of optimization. Finally, we evaluate the effectiveness of our proposed embedding constructions by performing community detection on a host of benchmark datasets. The reported results are competitive with classical algorithms that operate on the entire graph while benefitting from a substantially reduced computational complexity due to the reduced dimensionality of the representations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning to Collaborate Over Graphs: A Selective Federated Multi-Task Learning Approach
Breaking the Batch Barrier (B3) of Contrastive Learning via Smart Batch Mining
Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion
Community and hyperedge inference in multiple hypergraphs
Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation
Robust Markov stability for community detection at a scale learned based on the structure
토론
이 논문과 연결된 포럼 글이 아직 없습니다.