The problem of network classification consists on assigning a finite set of labels to the nodes of the graphs; the underlying assumption is that nodes with the same label tend to be connected via ...

The problem of network classification consists on assigning a finite set of labels to the nodes of the graphs; the underlying assumption is that nodes with the same label tend to be connected via strong paths in the graph. This is similar to the assumptions made by semi-supervised learning algorithms based on graphs, which build an artificial graph from vectorial data. Such semi-supervised algorithms are based on label propagation principles and their accuracy heavily relies on the structure (presence of edges) in the graph.

In this talk I will discuss ideas of how to perform sampling in the network graph, thus sparsifying the structure in order to apply semi-supervised algorithms and compute efficiently the classification function on the network. I will show very preliminary experiments indicating that the sampling technique has an important effect on the final results and discuss open theoretical and practical questions that are to be solved yet.

### Statistics

### Views

- Total Views
- 1,458
- Views on SlideShare
- 731
- Embed Views

### Actions

- Likes
- 0
- Downloads
- 6
- Comments
- 0

http://recerca.upc.edu | 627 |

http://www.larca.cat | 82 |

https://recerca.upc.edu | 13 |

https://www.larca.cat | 3 |

http://translate.googleusercontent.com | 1 |

http://webcache.googleusercontent.com | 1 |

### Accessibility

### Categories

### Upload Details

Uploaded via SlideShare as Adobe PDF

### Usage Rights

© All Rights Reserved

Full NameComment goes here.