Column Networks for Collective Classification
Abstract
Relational learning deals with data that are characterized by relational structures. An important task is collective classification, which is to jointly classify networked objects. While it holds a great promise to produce a better accuracy than non-collective classifiers, collective classification is computationally challenging and has not leveraged on the recent breakthroughs of deep learning. We present Column Network ($CLN$), a novel deep learning model for collective classification in multi-relational domains. $CLN$ has many desirable theoretical properties: (i) it encodes multi-relations between any two instances; (ii) it is deep and compact, allowing complex functions to be approximated at the network level with a small set of free parameters; (iii) local and relational features are learned simultaneously; (iv) long-range, higher-order dependencies between instances are supported naturally; and (v) crucially, learning and inference are efficient with linear complexity in the size of the network and the number of relations. We evaluate $CLN$ on multiple real-world applications: (a) delay prediction in software projects, (b) PubMed Diabetes publication classification and (c) film genre classification. In all of these applications, $CLN$ demonstrates a higher accuracy than state-of-the-art rivals.
Benchmark Results
Tested on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
Other Graph Benchmarks
| # | Model | Micro-F1 ↑ | Paper |
|---|---|---|---|
| 1 | CLN-HWN-mini | 0.5750 | This paper |
| 2 | CLN-HWN-full | 0.5740 | This paper |
| 3 | CLN-FNN | 0.5430 | This paper |
| 4 | SL-LR | 0.5340 | This paper |
| 5 | HWN-noRel | 0.5080 | This paper |
| 6 | nbC-IC | 0.4660 | This paper |
| 7 | nbC-RL | 0.4350 | This paper |
