期刊
2022 30TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2022)
卷 -, 期 -, 页码 692-696出版社
IEEE
关键词
graph partitioning; spectral clustering; generalized eigenvalue problem; dynamic graphs
类别
资金
- TU Delft
- CONACYT
- TU Delft AI Labs programme
In this study, we focus on partitioning dynamic graphs with two types of nodes, and propose solutions based on the generalized eigenvalue problem for static partition problems. We also introduce an eigenvector update-based method for adaptive partition. Numerical experiments demonstrate the effectiveness of the proposed approaches.
In this work, we focus on partitioning dynamic graphs with two types of nodes (bi-colored), though not necessarily bipartite graphs. They commonly appear in communication network applications, e.g., one color being base stations, the other users, and the dynamic process being the varying connection status between base stations and moving users. We introduce a partition cost function that incorporates the coloring of the graph and propose solutions based on the generalized eigenvalue problem (GEVP) for the static two-way partition problem. The static multi-way partition problem is then handled by a heuristic based on the two-way partition problem. Regarding the adaptive partition, an eigenvector update-based method is proposed. Numerical experiments demonstrate the performance of the devised approaches.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据