Non-Graph Data Clustering via $\mathcal {O}(n)$ Bipartite Graph Convolution

作者：Hongyuan Zhang, Jiankun Shi, Rui Zhang, Xuelong Li · 发表于：IEEE Transactions on Pattern Analysis and Machine Intelligence · 年份：2022 · DOI：10.1109/tpami.2022.3231470 · 被引用次数：15 · 研究领域：Advanced Graph Neural Networks、Complex Network Analysis Techniques、Caching and Content Delivery

Since the representative capacity of graph-based clustering methods is usually limited by the graph constructed on the original features, it is attractive to find whether graph neural networks (GNNs), a strong extension of neural networks to graphs, can be applied to augment the capacity of graph-based clustering methods. The core problems mainly come from two aspects. On the one hand, the graph is unavailable in the most general clustering scenes so that how to construct graph on the non-graph data and the quality of graph is usually the most important part. On the other hand, given$n$samples, the graph-based clustering methods usually consume at least$\mathcal {O}(n^{2})$time to build graphs and the graph convolution requires nearly$\mathcal {O}(n^{2})$for a dense graph and$\mathcal {O}(|\mathcal {E}|)$for a sparse one with$|\mathcal {E}|$edges. Accordingly, both graph-based clustering and GNNs suffer from the severe inefficiency problem. To tackle these problems, we propose a novel clustering method,AnchorGAE, with the self-supervised estimation of graph and efficient graph convolution. We first show how to convert a non-graph dataset into a graph dataset, by introducing the generative graph model and anchors. A bipartite graph is built via generating anchors and estimating the connectivity distributions of original points and anchors. We then show that the constructed bipartite graph can reduce the computational complexity of graph convolution from$\mathcal {O}(n^{2})$and...