Skip to content

Code and materials for network pruning by weakest edge elimination in each triangle of the network. Edge elimination might be absolute (eliminates the weakest edge) or threshold dependent (eliminate an edge below or above a threshold). This is an implementation of the DPI pruning (MI) methods for infered networks applyied to real networks.

License

Notifications You must be signed in to change notification settings

jmsiqueiros/Triangle-pruning

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Triangle-pruning

Code and materials for network pruning by weakest edge elimination in each triangle of the network. Edge elimination might be absolute (eliminates the weakest edge) or threshold dependent (eliminate an edge below or above a threshold). This is an implementation of the DPI pruning (MI) methods for infered networks applyied to real networks.

To-do list:

  1. Terminar algoritmo (para eliminacion absoluta o dado un umbral).

  2. Aplicar algoritmo a red completa de cancer de mama y la de Drosophila melanogaster.

  3. Comparar con redes reportadas por Enrique.

About

Code and materials for network pruning by weakest edge elimination in each triangle of the network. Edge elimination might be absolute (eliminates the weakest edge) or threshold dependent (eliminate an edge below or above a threshold). This is an implementation of the DPI pruning (MI) methods for infered networks applyied to real networks.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages