Learning Features of Network Structures Using Graphlets
Networks are fundamental to the study of complex systems, ranging from social contacts, message transactions, to biological regulations and economical networks. In many realistic applications, these networks may vary over time. Modeling and analyzing such temporal properties is of additional interest as it can provide a richer characterization of relations between nodes in networks. In this paper, we explore the role of \emph{graphlets} in network classification for both static and temporal networks. Graphlets are small non-isomorphic induced subgraphs representing connected patterns in a network and their frequency can be used to assess network structures. We show that graphlet features, which are not captured by state-of-the-art methods, play a significant role in enhancing the performance of network classification. To that end, we propose two novel graphlet-based techniques, \emph{gl2vec} for network embedding, and \emph{gl-DCNN} for diffusion-convolutional neural networks. We demonstrate the efficacy and usability of \emph{gl2vec} and \emph{gl-DCNN} through extensive experiments using several real-world static and temporal networks. We find that features learned from graphlets can bring notable performance increases to state-of-the-art methods in network analysis.
Code (0)
등록된 구현이 없습니다.
Tasks
General ClassificationLearning Network RepresentationsNetwork EmbeddingSimilar Papers 제목 키워드 기반
Network-based protein structural classification
Experimental determination of protein function is resource-consuming. As an alternative, computational prediction of protein function has received attention. In this context, protein structural classification (PSC) can h…
ClassificationGeneral ClassificationLearning Attributed Graphlets: Predictive Graph Mining by Graphlets with Trainable Attribute
The graph classification problem has been widely studied; however, achieving an interpretable model with high predictive performance remains a challenging issue. This paper proposes an interpretable classification algori…
AttributeGraph ClassificationGraph MiningHeterogeneous Graphlets
In this paper, we introduce a generalization of graphlets to heterogeneous networks called typed graphlets. Informally, typed graphlets are small typed induced subgraphs. Typed graphlets generalize graphlets to rich hete…
From Node Embedding to Graph Embedding: Scalable Global Graph Kernel via Random Features
Graph kernels are one of the most important methods for graph data analysis and have been successfully applied in diverse applications. We can generally categorize existing graph kernels into two groups: kernels based on…
Graph EmbeddingGraphlet Decomposition: Framework, Algorithms, and Applications
From social science to biology, numerous applications often rely on graphlets for intuitive and meaningful characterization of networks at both the global macro-level as well as the local micro-level. While graphlets hav…