Name
Abstract | ||
|---|---|---|
The paper addresses the graph classification problem and introduces a modification of the lazy associative classification method to efficiently handle intersections of graphs. Graph intersections are approximated with all common subgraphs up to a fixed size similarly to what is done with graphlet kernels. We explain the idea of the algorithm with a toy example and describe our experiments with a predictive toxicology dataset. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Discrete mathematics,Graph,Combinatorics,Associative property,Graph classification,Mathematics |
DocType | Volume | Citations |
Journal | abs/1504.05457 | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yury Kashnitsky | 1 | 1 | 3.44 |
| Sergei O. Kuznetsov | 2 | 1630 | 121.46 |