Learning feature representation for subgraphs
Graphs are a rich and versatile data structure. They are widely used in representing data like social networks, chemical compound, protein structures. Analytical tasks against graph data attracted great attention in many domains. Effective graph analytics provides users deep insights of the data. Ho...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/75535 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Graphs are a rich and versatile data structure. They are widely used in representing data like social networks, chemical compound, protein structures. Analytical tasks against graph data attracted great attention in many domains. Effective graph analytics provides users deep insights of the data. However, due to the structural characteristics of graphs, computation cost for graph analytics tasks on large graph data set can be very high. We discuss two recent frameworks inspired by the advancements in feature representation learning, neural networks and graph kernels, namely patchy-san and subgraph2vec. We conducted experiments with patchy-san and subgraph2vec frameworks for graph classification problems. With established benchmark datasets, we demonstrate that these two frameworks, despite taking different approaches, are efficient and competitive with state-of-the-art techniques. |
|---|