scientific article; zbMATH DE number 3907592
In this paper an attempt to characterise structured objects by methods of cluster analysis is introduced. A class of structured objects is represented by a graph where the vertex set corresponds to objects and the edge set corresponds to relations between the objects. The measure of dissimilarity for the graphs G, G' is defined by means of the sets of induced isomorphic subgraphs of G and G', respectively. The procedure of finding the dissimilarity between two graphs is transformed into the enumeration of induced subgraphs of the given graph with small degrees. In order to reduce the computational complexity the authors consider some class-stable graph transformations preserving interclass distances between the classes of graphs.
- Subobject classifier for algebraic structures
- Compatibility in a graph-theoretic setting
- Comparing large graphs efficiently by margins of feature vectors
- A comparative analysis of multidimensional features of objects resembling sets of graphs
- scientific article; zbMATH DE number 3888944 (Why is no real title available?)
- Structural similarity measure for binary data clustering
- scientific article; zbMATH DE number 3929036 (Why is no real title available?)
- scientific article; zbMATH DE number 3942812 (Why is no real title available?)
- scientific article; zbMATH DE number 1183248 (Why is no real title available?)
- scientific article; zbMATH DE number 568787 (Why is no real title available?)
- Some characterizations on clustering using equivalent graphs
- Equivalent and strong equivalent graphs with application in clustering
- scientific article; zbMATH DE number 2114003 (Why is no real title available?)
- Clones in graphs
- Some simple algorithms for structural comparison
- Topological mappings between graphs, trees and generalized trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685016)