Skip to content

Shortest-Path Kernel analysis with LLE and Isomap manifold algorithms application

Notifications You must be signed in to change notification settings

BrunoFrancesco97/ManifoldLearning-GraphKernel

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Manifold Learning and Graph Kernels

Third assignment solved in "Artificial Intelligence: Knowledge Representation and planning" course at Ca'Foscari University, check the report for a project explanation.

Description of the project

Read this article presenting a way to improve the disciminative power of graph kernels.

Choose one graph kernel among

  • Shortest-path Kernel
  • Graphlet Kernel
  • Random Walk Kernel
  • Weisfeiler-Lehman Kernel

Choose one manifold learning technique among

  • Isomap
  • Diffusion Maps
  • Laplacian Eigenmaps
  • Local Linear Embedding

Compare the performance of an SVM trained on the given kernel, with or without the manifold learning step, on the following datasets:

The zip files contain csv files representing the adjacecy matrices of the graphs and of the lavels. the files graphxxx.csv contain the adjaccency matrices, one per file, while the file labels.csv contains all the labels

About

Shortest-Path Kernel analysis with LLE and Isomap manifold algorithms application

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages