Name
Abstract | ||
|---|---|---|
We propose a network-filtering method, the Triangulated Maximally Filtered Graph (TMFG), that provides an approximate solution to the Weighted Maximal Planar Graph problem. The underlying idea of TMFG consists in building a triangulation that maximizes a score function associated with the amount of information retained by the network. TMFG uses as weights any arbitrary similarity measure to arrang... |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1093/comnet/cnw015 | Journal of Complex Networks |
Keywords | Field | DocType |
TMFG,big data,network filtering,PMFG,planarization algorithms,correlation network,Markov random fields,Weighted Maximal Planar Graph (WMPG) | Discrete mathematics,Combinatorics,Similarity measure,Filter (signal processing),Triangulation,Triangulation (social science),Cluster analysis,Big data,Planar graph,Mathematics,Scalability | Journal |
Volume | Issue | ISSN |
5 | 2 | 2051-1310 |
Citations | PageRank | References |
1 | 0.48 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| guido previde massara | 1 | 1 | 0.48 |
| T. Di Matteo | 2 | 5 | 1.34 |
| Tomaso Aste | 3 | 57 | 11.62 |