An approach for approximate subgraph matching in fuzzy RDF graph
From MaRDI portal
Publication:2329097
Recommendations
- An approach for approximate subgraph matching in domain knowledge graph
- Subgraph transformations for the inexact matching of attributed relational graphs
- Ontology matching approach based on RDF graph
- Matching RDF graphs
- Comparing fuzzy data sets by means of graph matching technique
- RDF approximate queries based on semantic similarity
Cites work
- A survey of graph edit distance
- An Algorithm for Subgraph Isomorphism
- Efficient subgraph matching using topological node feature constraints
- Emergence of Scaling in Random Networks
- Fuzzy sets as a basis for a theory of possibility
- scientific article; zbMATH DE number 897462 (Why is no real title available?)
- Matching RDF graphs
- Ontology Matching
- RDF approximate queries based on semantic similarity
- The String-to-String Correction Problem
Cited in
(8)- Efficient pattern matching on big uncertain graphs
- Approximate knowledge graph query answering: from ranking to binary classification
- Fuzzy topological structures via fuzzy graphs and their applications
- Subgraph-indexed sequential subdivision for continuous subgraph matching on dynamic knowledge graph
- Distributed top-k subgraph matching
- An approach for approximate subgraph matching in domain knowledge graph
- Method for subgraph matching with inclusion degree
- Different negations and fuzziness in web resources and resource description and their mathematical foundation
This page was built for publication: An approach for approximate subgraph matching in fuzzy RDF graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329097)