analyze.similarity: Analyzing graph similarity.

Description Usage Arguments Value See Also Examples

Description

analyze.similarity calculates a measure of graph similarity between two concept maps.

Usage

1
analyze.similarity(map1, map2)

Arguments

map1

A conceptmap object.

map2

A conceptmap object.

Value

A value between 0 and 1 that indicated the structural similariy of the underlying graphs. The graphs need not share the same set of nodes.

See Also

The structural similarity that is calculated is described in: Goldsmith, Timothy E.; Davenport, Daniel M. (1990): Assessing Structural Similarity of Graphs. In: Roger W. Schvaneveldt (Hg.): Pathfinder associative networks. Studies in knowledge organizations. Norwood, N.J: Ablex Pub. Corp., S. 74-87.

Examples

1
2
3
4
require("igraph")
g1 = set.vertex.attribute(erdos.renyi.game(15, 0.7, type="gnp"), "name", value=1:15)
g2 = set.vertex.attribute(erdos.renyi.game(15, 0.7, type="gnp"), "name", value=1:15)
analyze.similarity(conceptmap(g1), conceptmap(g2))

comato documentation built on May 2, 2019, 6:52 a.m.