A comparative analysis of multidimensional features of objects resembling sets of graphs

DOI10.1016/J.AMC.2007.05.058MaRDI QIDQ2474878zbMATH OpenOpenAlexFDO

Authors Matthias Dehmer, Frank Emmert-Streib, Tanja Gesell

Publication date 6 March 2008

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2007.05.058

zbMATH Keywords

classificationstructural similaritysimilaritystructured objectsobject comparison

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 3907592
• Comparing large graphs efficiently by margins of feature vectors
• scientific article; zbMATH DE number 4039703
• A new dissimilarity measure for comparing labeled graphs
• scientific article; zbMATH DE number 1691467

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 1691467 (Why is no real title available?)
• scientific article; zbMATH DE number 3828118 (Why is no real title available?)
• scientific article; zbMATH DE number 3907592 (Why is no real title available?)
• scientific article; zbMATH DE number 4039703 (Why is no real title available?)
• scientific article; zbMATH DE number 4089609 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3781232 (Why is no real title available?)
• scientific article; zbMATH DE number 3781233 (Why is no real title available?)
• scientific article; zbMATH DE number 42695 (Why is no real title available?)
• scientific article; zbMATH DE number 3001791 (Why is no real title available?)
• A new method of measuring similarity for a special class of directed graphs
• A note on two problems in connexion with graphs
• A similarity measure for graphs with low computational complexity
• An Algorithm for Subgraph Isomorphism
• Comparing large graphs efficiently by margins of feature vectors
• Conceptual structures: Logical, linguistic, and computational issues. 8th international conference, ICCS 2000, Darmstadt, Germany, August 14--18, 2000. Proceedings
• Graph-Theoretic Techniques for Web Content Mining
• Inexact graph matching for structural pattern recognition
• Matching graphs with unique node labels
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• On a certain distance between isomorphism classes of graphs
• Parallel concepts in graph theory
• Prediction and Entropy of Printed English
• The Tree-to-Tree Correction Problem

Cited in

(2)

• Large-scale analysis of structural branching measures
• CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES

Describes a project that uses

Uses Software

• Seq-Gen

This page was built for publication: A comparative analysis of multidimensional features of objects resembling sets of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474878)