Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

PAMI

2010

2010

—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distribution on the (usually inﬁnite) countable set of paths through the graph is deﬁned by minimizing the total expected cost between all pairs of nodes while ﬁxing the total relative entropy spread in the graph. This results in a Boltzmann distribution on the set of paths such that long (high-cost) paths occur with a low probability while short (low-cost) paths occur with a high probability. The sum-over-paths (SoP) covariance measure between nodes is then deﬁned according to this probability distribution: two nodes are considered as highly correlated if they often co-occur together on the same – preferably short – paths. The resulting covariance matrix between nodes (say n nodes in total) is a Gram matrix and therefore deﬁnes a valid kernel on the graph. It is obtained by inverting a n × n matrix depe...

Added |
29 Jan 2011 |

Updated |
29 Jan 2011 |

Type |
Journal |

Year |
2010 |

Where |
PAMI |

Authors |
Amin Mantrach, Luh Yen, Jérôme Callut, Kevin Françoisse, Masashi Shimbo, Marco Saerens |

Comments (0)