Clustering as graph problem
Make a graph of a structure:
- The nodes being the elements
- Node labels being the properties
- The edges are labeled by the relations
- Edges between nodes where the relation satisfies some constraints
Find subgraphs with maximum ”similarity” (isomorphy)
- Corresponding nodes must be compatible
- Corresponding edges must be sufficient similar