Sparse graph topologies (especially minimum spanning trees) match or exceed denser graphs for image classification on Fashion-MNIST when using a fixed three-layer GCN.
In: Proceedings of the Sixth Workshop on Irregular Applications: Archi- tectures and Algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Visual graphs for image classification: does the structure affect performance?
Sparse graph topologies (especially minimum spanning trees) match or exceed denser graphs for image classification on Fashion-MNIST when using a fixed three-layer GCN.