Information theoretic graph kernels
This thesis addresses the problems that arise in state-of-the-art structural learning methods for (hyper)graph classification or clustering, particularly focusing on developing novel information theoretic kernels for graphs. To this end, we commence in Chapter 3 by defining a family of Jensen-Shanno...
Main Author: | Bai, Lu |
---|---|
Other Authors: | Hancock, Edwin |
Published: |
University of York
2014
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.628577 |
Similar Items
-
Set- and graph-theoretic investigations in abstract argumentation
by: Spanring, C.
Published: (2017) -
Sparse and robust kernel methods
by: Naish-Guzman, Andrew Guillermo Peter
Published: (2008) -
Information theoretic refinement criteria for image synthesis
by: Rigau Vilalta, Jaume
Published: (2006) -
Instance directed tuning for sparse matrix kernels on reconfigurable accelerators
by: Grigoras, Paul
Published: (2018) -
Voting models on graphs
by: Rivera Aburto, Nicolas Andres
Published: (2018)