Graphs and matching techniques are a well-studied topic. In this paper, we individuate a sub-class of graphs, which we call semantic graphs, characterized by labels whose meaning is independent from their occurrence in graph. We show how this changes the meaning of graph nodes and, consequently, the matching problem. Finally, we propose an algorithm for matching semantic graph
Thesis (Ph.D.)--University of Washington, 2012Lexical semantics studies the meaning of words, which ...
Both the amount of data available and the rate at which it is acquired increases rapidly. The underl...
Abstract. Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologie...
We think of Match as an operator which takes two graph-like structures and produces a mapping betwee...
We think of Match as an operator which takes two graph-like structures and produces a mapping betwee...
We think of match as an operator that takes two graph-like structures (e.g., database schemas or ont...
We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies)...
The task of matching patterns in graph-structured data has applications in such diverse areas as com...
Ontology matching is an important task to achieve inter-operation between semantic web applications ...
Ontology matching is an important task to achieve interoperation between semantic web applications u...
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schema...
Abstract. Research on semantic search has become heated these years. In this paper we propose an app...
Abstract. Research on semantic search has become heated these years. In this paper we propose an app...
Abstract — In semantic computing, Match is an operator that takes as an input two graph-like structu...
We think of Match as an operator which takes two graph-like structures and produces a mapping betwee...
Thesis (Ph.D.)--University of Washington, 2012Lexical semantics studies the meaning of words, which ...
Both the amount of data available and the rate at which it is acquired increases rapidly. The underl...
Abstract. Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologie...
We think of Match as an operator which takes two graph-like structures and produces a mapping betwee...
We think of Match as an operator which takes two graph-like structures and produces a mapping betwee...
We think of match as an operator that takes two graph-like structures (e.g., database schemas or ont...
We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies)...
The task of matching patterns in graph-structured data has applications in such diverse areas as com...
Ontology matching is an important task to achieve inter-operation between semantic web applications ...
Ontology matching is an important task to achieve interoperation between semantic web applications u...
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schema...
Abstract. Research on semantic search has become heated these years. In this paper we propose an app...
Abstract. Research on semantic search has become heated these years. In this paper we propose an app...
Abstract — In semantic computing, Match is an operator that takes as an input two graph-like structu...
We think of Match as an operator which takes two graph-like structures and produces a mapping betwee...
Thesis (Ph.D.)--University of Washington, 2012Lexical semantics studies the meaning of words, which ...
Both the amount of data available and the rate at which it is acquired increases rapidly. The underl...
Abstract. Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologie...
Add to ORKG