Name
Abstract | ||
|---|---|---|
When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif counts are expensive to compute and difficult to work with theoretically. Via graphon theory, we give an explicit quantitative bound for the ability of motif homomorphisms to distinguish large networks under both generative and sampling noise. Furthermore, we give similar bounds for the graph spectrum and connect it to homomorphism densities of cycles. This results in an easily computable classifier on graph data with theoretical performance guarantee. Our method yields competitive results on classification tasks for the autoimmune disease Lupus Erythematosus. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Learning | Discrete mathematics,Graph,Large networks,Feature vector,Performance guarantee,Sampling (statistics),Homomorphism,Artificial intelligence,Generative grammar,Classifier (linguistics),Machine learning,Mathematics |
DocType | Volume | Citations |
Journal | abs/1710.08878 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Haupt | 1 | 0 | 0.34 |
| Mohammad Khatami | 2 | 0 | 0.34 |
| Thomas Schultz | 3 | 72 | 7.51 |
| Ngoc Mai Tran | 4 | 0 | 1.01 |