arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1811.04461cs.SI
收藏

潜在网络摘要:桥接网络嵌入和摘要

Latent Network Summarization: Bridging Network Embedding and Summarization

Di Jin, Ryan Rossi, Danai Koutra, Eunyee Koh, Sungchul Kim, Anup Rao

摘要:

受密集嵌入带来的计算和存储挑战的启发,我们引入了潜在网络摘要的问题,其目的是学习具有独立于输入图大小的维度的图结构的紧凑的潜在表示(即,#nodes和#edges),同时保留动态导出节点表示的能力。我们提出了Multi-LENS,这是一种归纳的多层次潜在网络摘要方法,它利用一组关系运算符和关系函数(运算符的组合)来分别捕获egonet和高阶子图的结构。结构存储在低秩、大小无关的结构特征矩阵中,这些矩阵与关系函数一起构成了我们的潜在网络摘要。Multi-LENS是通用的,并且自然地支持具有或不具有方向性、权重、属性或标签的同构和异构图。在真实图上进行的大量实验表明,链接预测的AUC提高了3.5 - 34.3%,同时在大型数据集上需要比基线嵌入方法少80 - 2152倍的输出存储空间。作为应用领域,我们展示了多透镜在检测安然电子邮件通信图和Twitter共同提及图中的异常和事件方面的有效性。

英文摘要:

Motivated by the computational and storage challenges that dense embeddings pose, we introduce the problem of latent network summarization that aims to learn a compact, latent representation of the graph structure with dimensionality that is independent of the input graph size (i.e., #nodes and #edges), while retaining the ability to derive node representations on the fly. We propose Multi-LENS, an inductive multi-level latent network summarization approach that leverages a set of relational operators and relational functions (compositions of operators) to capture the structure of egonets and higher-order subgraphs, respectively. The structure is stored in low-rank, size-independent structural feature matrices, which along with the relational functions comprise our latent network summary. Multi-LENS is general and naturally supports both homogeneous and heterogeneous graphs with or without directionality, weights, attributes or labels. Extensive experiments on real graphs show 3.5 - 34.3% improvement in AUC for link prediction, while requiring 80 - 2152x less output storage space than baseline embedding methods on large datasets. As application areas, we show the effectiveness of Multi-LENS in detecting anomalies and events in the Enron email communication graph and Twitter co-mention graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑