An approach for approximate subgraph matching in fuzzy RDF graph (Q2329097): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ontology Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of graph edit distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient subgraph matching using topological node feature constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: RDF approximate queries based on semantic similarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets as a basis for a theory of possibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884710 / rank
 
Normal rank

Revision as of 16:39, 20 July 2024

scientific article
Language Label Description Also known as
English
An approach for approximate subgraph matching in fuzzy RDF graph
scientific article

    Statements

    An approach for approximate subgraph matching in fuzzy RDF graph (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2019
    0 references
    fuzzy RDF graph
    0 references
    subgraph matching
    0 references
    path alignment
    0 references
    0 references
    0 references
    0 references

    Identifiers