Weights of the hierarchy that defines a Weisfeiler-Lehman optimal assignment kernel can be learned with multiple kernel learning, yielding a deep assignment kernel with sparse weights.
Kriege, Pierre-Louis Giscard, and Richard Wilso n
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Deep Weisfeiler-Lehman Assignment Kernels via Multiple Kernel Learning
Weights of the hierarchy that defines a Weisfeiler-Lehman optimal assignment kernel can be learned with multiple kernel learning, yielding a deep assignment kernel with sparse weights.