Shohei Kameda > Graph-Similarity > Graph::Similarity::CoupledNodeEdgeScoring

Download:
Graph-Similarity-v0.0.5.tar.gz

Dependencies

Annotate this POD

CPAN RT

Open  1
View/Report Bugs
Module Version: 0.02   Source  

NAME ^

Graph::Similarity::CoupledNodeEdgeScoring - Coupled Node-Edge Scoring implementation

VERSION ^

Version 0.02

SYNOPSIS ^

Please see Graph::Similarity

DESCRIPTION ^

This is the implementation of the below papers.

Vincent D. Blondel "A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching"

and

Laura Zager "Graph Similarity and Matching"

METHODS ^

calculate()

This calculates Coupled Node-Edge Scoring. The algorithm is mentioned in Page.655 in Blondel's paper. The convergence is not taken into account. Please set the number of iteration instead.

AUTHOR ^

Shohei Kameda, <shoheik at cpan.org>

LICENSE AND COPYRIGHT ^

Copyright 2012 Shohei Kameda.

This program is free software; you can redistribute it and/or modify it under the terms of either: the GNU General Public License as published by the Free Software Foundation; or the Artistic License.

See http://dev.perl.org/licenses/ for more information.

syntax highlighting: