Affinity Learning on Graphs with Diffusion Processes
In the thesis, we propose machine learning algorithms utilising diffusion processes to learn the pairwise affinity between data samples. Diffusion processes propagates neighbour information on a node-edge graph, resulting in context-aware affinities that is smooth to the data manifold structure. Sim...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
Curtin University
2020
|
| Online Access: | http://hdl.handle.net/20.500.11937/80408 |