Главная
Study mode:
on
1
Intro
2
Definitions
3
Main properties
4
Graph matching
5
Graph edit distance - more formally
6
Minimum-cost edit path
7
Bipartite graph edit distance
8
Prototype-based graph embedding
9
Prototype set: example
10
Supervised prototype selection: example
11
Discriminative prototype selection
12
Discriminative center prototype selection
13
Discriminative border prototype selection
14
Discriminative repelling prototype selection
15
Discriminative spanning prototype selection
16
Discriminative targetsphere prototype selection
17
Targetsphere selection
18
Experiments
19
Datasets
20
Discriminative vs conventional (cnt'd)
21
Number of prototypes per class
22
Conclusion
Description:
Explore graph embedding techniques and prototype selection methods in this 54-minute guest presentation by Massimo Piccardi from the University of Central Florida. Delve into key concepts including graph matching, graph edit distance, and bipartite graph edit distance. Learn about prototype-based graph embedding and various discriminative prototype selection approaches, such as center, border, repelling, spanning, and targetsphere selections. Examine experimental results comparing discriminative and conventional methods across different datasets, and understand the impact of prototype numbers per class. Gain valuable insights into graph theory and its applications in machine learning and data analysis.

Discriminative Prototype Selection for Graph Embedding

University of Central Florida
Add to list
0:00 / 0:00