Graph-FCA in Practice
With the rise of the Semantic Web, more and more relational data are made available in the form of knowledge graphs (e.g., RDF, conceptual graphs). A challenge is to discover conceptual structures in those graphs, in the same way as Formal Concept Analysis (FCA) discovers conceptual structures in tables. Graph-FCA has been introduced in a previous work as an extension of FCA for such knowledge graphs. In this paper, algorithmic aspects and use cases are explored in order to study the feasibility and usefulness of G-FCA. We consider two use cases. The first one extracts linguistic structures from parse trees, comparing two graph models. The second one extracts workflow patterns from cooking recipes, highlighting the benefits of n-ary relationships and concepts.
KeywordsFormal Concept Analysis Knowledge graph Semantic Web Graph pattern
- 8.Huchard, M.: Analyzing inheritance hierarchies through formal concept analysis: a 22-years walk in a landscape of conceptual structures. In: MechAnisms on SPEcialization, Generalization and inHerItance (MASPEGHI), pp. 8–13. ACM (2007)Google Scholar
- 12.Schmid, H.: Probabilistic part-of-speech tagging using decision trees. In: International Conference on New Methods in Language Processing (1994)Google Scholar
- 15.Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 286–295. ACM (2003)Google Scholar