A connectivity rating for vertices in networks
We compute the influence of a vertex on the connectivity structure of a directed network by using Shapley value theory. In general, the computation of such ratings is highly inefficient. We show how the computation can be managed for many practically interesting instances by a decomposition of large...
Guardado en:
| Autores principales: | Abraham, Marco, Krumnack, Antje, Wanke, Egon, Kötter, Rolf |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/24422 |
| Aporte de: |
Ejemplares similares
-
Multilevel + Neural Network Heuristic for the Graph Bisection Problem on Geometrically Connected Graphs
por: Hernandez, G., et al.
Publicado: (2010) -
Random forest-like strategies for neural networks ensembles contruction
por: Namías, Rafael, et al.
Publicado: (2007) -
Improving network generalization through selection of examples
por: Cannas, Sergio A., et al.
Publicado: (1998) -
A parallel approach for backpropagation learning of neural networks
por: Crespo, María Liz, et al.
Publicado: (1999) -
Neural networks applied to wireless communications
por: Stegmayer Machado, Georgina S., et al.
Publicado: (2006)