An approach for approximate subgraph matching in fuzzy RDF graph
From MaRDI portal
Publication:2329097
DOI10.1016/j.fss.2019.02.021zbMath1423.05136OpenAlexW2918628708WikidataQ128286636 ScholiaQ128286636MaRDI QIDQ2329097
Li Yan, Guanfeng Li, Zongmin Ma
Publication date: 17 October 2019
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2019.02.021
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of graph edit distance
- Fuzzy sets as a basis for a theory of possibility
- Efficient subgraph matching using topological node feature constraints
- RDF approximate queries based on semantic similarity
- Emergence of Scaling in Random Networks
- Ontology Matching
- An Algorithm for Subgraph Isomorphism
- The String-to-String Correction Problem
This page was built for publication: An approach for approximate subgraph matching in fuzzy RDF graph