Edit costs for graphs contain in CMU dataset. More...

#include <cmu.hpp>

Inheritance diagram for ged::CMU< UserNodeLabel, UserEdgeLabel >:

Public Member Functions
	CMU (double node_ins_del_cost=100000, double alpha=0.5)
	Constructor. More...

virtual double	node_ins_cost_fun (const UserNodeLabel &node_label) const final
	Node insertions cost function. More...

virtual double	node_del_cost_fun (const UserNodeLabel &node_label) const final
	Node deletion cost function. More...

virtual double	node_rel_cost_fun (const UserNodeLabel &node_label_1, const UserNodeLabel &node_label_2) const final
	Node relabeling cost function. More...

virtual void	vectorize_node_label (const UserNodeLabel &node_label, std::vector< double > &vector_representation) const final
	Computes a node label's representation as a real-valued vector. More...

virtual double	edge_ins_cost_fun (const UserEdgeLabel &edge_label) const final
	Edge insertion cost function. More...

virtual double	edge_del_cost_fun (const UserEdgeLabel &edge_label) const final
	Edge deletion cost function. More...

virtual double	edge_rel_cost_fun (const UserEdgeLabel &edge_label_1, const UserEdgeLabel &edge_label_2) const final
	Edge relabeling cost function. More...

Public Member Functions inherited from ged::EditCosts< UserNodeLabel, UserEdgeLabel >
virtual	~EditCosts ()=0
	Virtual destructor. More...

	EditCosts ()
	Constructor.

virtual void	vectorize_edge_label (const UserEdgeLabel &edge_label, std::vector< double > &vector_representation) const
	Computes an edge label's representation as a real-valued vector. More...

Detailed Description

template<class UserNodeLabel, class UserEdgeLabel>
class ged::CMU< UserNodeLabel, UserEdgeLabel >

Edit costs for graphs contain in CMU dataset.

The graphs contained in the CMU dataset represent images of houses from different viewpoints. Each graph has 30 nodes that are attributed with Euclidian coordinates (named "x" and "y"). An edge e is attributed with the integer-valued Euclidean distance d(e) between the attributes of its endpoints (named "dist"). The CMU dataset is part of the graph data repository for graph edit distance which can be downloaded from http://www.rfai.li.univ-tours.fr/PublicData/GDR4GED/home.html:

Z. Abu-Aisheh, R. Raveaux, J.-Y. Ramel: “A graph database repository and performance evaluation metrics for graph edit distance”, https://doi.org/10.1007/978-3-319-18224-7_14

Implements the edit costs suggested in:

Z. Abu-Aisheh, B. Gaüzère, S. Bougleux, J.-Y. Ramel, L. Brun, R. Raveaux, P. Héroux, and S. Adam. “Graph edit distance contest 2016: Results and future challenges”, https://doi.org/10.1016/j.patrec.2017.10.007
Z. Abu-Aisheh, R. Raveaux, J.-Y. Ramel: “A graph database repository and performance evaluation metrics for graph edit distance”, https://doi.org/10.1007/978-3-319-18224-7_14

Definition at line 53 of file cmu.hpp.

Constructor & Destructor Documentation

◆ CMU()

template<class UserNodeLabel , class UserEdgeLabel >

ged::CMU< UserNodeLabel, UserEdgeLabel >::CMU	(	double	node_ins_del_cost = `100000`,
		double	alpha = `0.5`
	)

Constructor.

Parameters

[in]	node_ins_del_cost	Cost for deleting or inserting nodes.
[in]	alpha	Importance of node edit operations vs. importance of edge edit operations.

Note: Calling the constructor with the default arguments constructs the edit costs suggested in https://doi.org/10.1016/j.patrec.2017.10.007 and https://doi.org/10.1007/978-3-319-18224-7_14.

Member Function Documentation

◆ edge_del_cost_fun()

template<class UserNodeLabel , class UserEdgeLabel >

virtual double ged::CMU< UserNodeLabel, UserEdgeLabel >::edge_del_cost_fun ( const UserEdgeLabel & edge_label ) const

finalvirtual

Edge deletion cost function.

Parameters

[in] edge_label An edge label.

Returns: The cost of deleting an edge with label edge_label.

Note: Must be implemented by derived classes of ged::EditCosts.

Reimplemented from ged::EditCosts< UserNodeLabel, UserEdgeLabel >.

◆ edge_ins_cost_fun()

template<class UserNodeLabel , class UserEdgeLabel >

virtual double ged::CMU< UserNodeLabel, UserEdgeLabel >::edge_ins_cost_fun ( const UserEdgeLabel & edge_label ) const

finalvirtual

Edge insertion cost function.

Parameters

[in] edge_label An edge label.

Returns: The cost of inserting an edge with label edge_label.

Note: Must be implemented by derived classes of ged::EditCosts.

Reimplemented from ged::EditCosts< UserNodeLabel, UserEdgeLabel >.

◆ edge_rel_cost_fun()

template<class UserNodeLabel , class UserEdgeLabel >

virtual double ged::CMU< UserNodeLabel, UserEdgeLabel >::edge_rel_cost_fun	(	const UserEdgeLabel &	edge_label_1,
		const UserEdgeLabel &	edge_label_2
	)		const

finalvirtual

Edge relabeling cost function.

Parameters

[in]	edge_label_1	An edge label.
[in]	edge_label_2	An edge label.

Returns: The cost of changing an edge's label from edge_label_1 to edge_label_2.

Note: Must be implemented by derived classes of ged::EditCosts.

Reimplemented from ged::EditCosts< UserNodeLabel, UserEdgeLabel >.

◆ node_del_cost_fun()

template<class UserNodeLabel , class UserEdgeLabel >

virtual double ged::CMU< UserNodeLabel, UserEdgeLabel >::node_del_cost_fun ( const UserNodeLabel & node_label ) const

finalvirtual

Node deletion cost function.

Parameters

[in] node_label A node label.

Returns: The cost of deleting a node with label node_label.

Note: Must be implemented by derived classes of ged::EditCosts.

Reimplemented from ged::EditCosts< UserNodeLabel, UserEdgeLabel >.

◆ node_ins_cost_fun()

template<class UserNodeLabel , class UserEdgeLabel >

virtual double ged::CMU< UserNodeLabel, UserEdgeLabel >::node_ins_cost_fun ( const UserNodeLabel & node_label ) const

finalvirtual

Node insertions cost function.

Parameters

[in] node_label A node label.

Returns: The cost of inserting a node with label node_label.

Note: Must be implemented by derived classes of ged::EditCosts.

Reimplemented from ged::EditCosts< UserNodeLabel, UserEdgeLabel >.

◆ node_rel_cost_fun()

template<class UserNodeLabel , class UserEdgeLabel >

virtual double ged::CMU< UserNodeLabel, UserEdgeLabel >::node_rel_cost_fun	(	const UserNodeLabel &	node_label_1,
		const UserNodeLabel &	node_label_2
	)		const

finalvirtual

Node relabeling cost function.

Parameters

[in]	node_label_1	A node label.
[in]	node_label_2	A node label.

Returns: The cost of changing a node's label from node_label_1 to node_label_2.

Note: Must be implemented by derived classes of ged::EditCosts.

Reimplemented from ged::EditCosts< UserNodeLabel, UserEdgeLabel >.

◆ vectorize_node_label()

template<class UserNodeLabel , class UserEdgeLabel >

virtual void ged::CMU< UserNodeLabel, UserEdgeLabel >::vectorize_node_label	(	const UserNodeLabel &	node_label,
		std::vector< double > &	vector_representation
	)		const

finalvirtual

Computes a node label's representation as a real-valued vector.

Parameters

[in]	node_label	A node label.
[out]	vector_representation	The node label's vector representation.

Note: May be implemented by derived classes of ged::EditCosts.

Reimplemented from ged::EditCosts< UserNodeLabel, UserEdgeLabel >.

The documentation for this class was generated from the following file:

src/edit_costs/cmu.hpp

Public Member Functions

Detailed Description

template<class UserNodeLabel, class UserEdgeLabel> class ged::CMU< UserNodeLabel, UserEdgeLabel >

Constructor & Destructor Documentation

◆ CMU()

Member Function Documentation

◆ edge_del_cost_fun()

◆ edge_ins_cost_fun()

◆ edge_rel_cost_fun()

◆ node_del_cost_fun()

◆ node_ins_cost_fun()

◆ node_rel_cost_fun()

◆ vectorize_node_label()

template<class UserNodeLabel, class UserEdgeLabel>
class ged::CMU< UserNodeLabel, UserEdgeLabel >