An Iterative Algorithm for Approximate Median Graph Computation

Recently, the median graph has been shown to be a good choice to obtain a representative of a given set of graphs. It has been successfully applied to graph-based classification and clustering. In this paper we exploit a theoretical property of the median, which has not yet been utilized in the past...

Full description

Saved in:

Bibliographic Details
Published in:	2010 20th International Conference on Pattern Recognition pp. 1562 - 1565
Main Authors:	Ferrer, Miquel, Bunke, Horst
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.08.2010
Subjects:	Approximation algorithms Approximation methods Clustering algorithms Iterative methods Labeling Pattern recognition
ISBN:	1424475422, 9781424475421
ISSN:	1051-4651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!