一个新的图比较空间
A New Space for Comparing Graphs
摘要:
寻找一种新的图的数学表示,使不同的图结构之间可以直接进行比较,是一个开放的研究方向。具有这样的表示是各种机器学习算法(如分类、聚类等)的首要先决条件,在图形数据集上。本文提出了一个对称半正定矩阵作为邻接矩阵为$A$的图的表示,该矩阵的$(i,j)$ {th}元素等于归一化向量$A^ie$和$A^je$($e$为全1的向量)之间的协方差.我们表明,所提出的矩阵表示编码的频谱的基础邻接矩阵,它还包含有关的计数的小的子结构,如三角形和小路径的图形。此外,我们表明,这个矩阵是一个\emph{"graph invariant"}。所有这些性质使得所提出的矩阵表示图的一个合适的对象。该表示是固定维度量空间中的协方差阵,给出了图的数学嵌入。这自然会导致图对象的相似性度量。我们将两个给定图之间的相似性定义为它们相应的协方差阵表示之间的Bhattacharya相似性度量。正如我们对社交网络分类任务的实验研究所示,这种相似性度量优于其他广泛使用的最先进的方法。我们提出的方法也是计算效率。矩阵表示和相似度值的计算可以在边数线性的运算中执行。这使得我们的方法在实践中具有可扩展性。我们相信我们的理论和实证结果提供了证据,研究截断幂迭代,邻接矩阵,表征社交网络。
英文摘要:
Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine learning algorithms like classification, clustering, etc., over graph datasets. In this paper, we propose a symmetric positive semidefinite matrix with the $(i,j)$-{th} entry equal to the covariance between normalized vectors $A^ie$ and $A^je$ ($e$ being vector of all ones) as a representation for graph with adjacency matrix $A$. We show that the proposed matrix representation encodes the spectrum of the underlying adjacency matrix and it also contains information about the counts of small sub-structures present in the graph such as triangles and small paths. In addition, we show that this matrix is a \emph{"graph invariant"}. All these properties make the proposed matrix a suitable object for representing graphs. The representation, being a covariance matrix in a fixed dimensional metric space, gives a mathematical embedding for graphs. This naturally leads to a measure of similarity on graph objects. We define similarity between two given graphs as a Bhattacharya similarity measure between their corresponding covariance matrix representations. As shown in our experimental study on the task of social network classification, such a similarity measure outperforms other widely used state-of-the-art methodologies. Our proposed method is also computationally efficient. The computation of both the matrix representation and the similarity value can be performed in operations linear in the number of edges. This makes our method scalable in practice. We believe our theoretical and empirical results provide evidence for studying truncated power iterations, of the adjacency matrix, to characterize social networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。