Combinatorial Information Theoretical Measurement of the Semantic Significance of Semantic Graph Motifs
Given an arbitrary semantic graph data set, perhaps one lacking in explicit ontological information, we wish to first identify its significant semantic structures, and then measure the extent of their significance. Casting a semantic graph dataset as an edge-labeled, directed graph, this task can be built on the ability to mine frequent {\em labeled} subgraphs in edge-labeled, directed graphs. We begin by considering the fundamentals of the enumerative combinatorics of subgraph motif structures in edge-labeled directed graphs. We identify its frequent labeled, directed subgraph motif patterns, and measure the significance of the resulting motifs by the information gain relative to the expected value of the motif based on the empirical frequency distribution of the link types which compose them, assuming indpendence. We illustrate the method on a small test graph, and discuss results obtained for small linear motifs (link type bigrams and trigrams) in a larger graph structure.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1092695
- Report Number(s):
- PNNL-SA-80237; 400470000
- Resource Relation:
- Conference: Mining Data Semantics Workshop (MDS 2011) in conjunction with SIGKDD2011, August 21-24, 2011, San Diego, California
- Country of Publication:
- United States
- Language:
- English
Similar Records
Structure Discovery in Large Semantic Graphs Using Extant Ontological Scaling and Descriptive Statistics
Have Green – A Visual Analytics Framework for Large Semantic Graphs