1 paper · 1 filter
Hiroyasu Usami, Masanori Tsukamoto, Kohei Hashiguchi
An invertible graph aggregation preserves the complete feature table, but can increase the size of a classifier that reads one node at a time. For every even N≥4, we construct…