Graph-FCA in Practice

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9717)

Abstract

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.

Keywords

Formal Concept Analysis Knowledge graph Semantic Web Graph pattern 

References

  1. 1.
    Chein, M., Mugnier, M.L.: Graph-Based Knowledge Representation: Computational Foundations of Conceptual Graphs. Advanced Information and Knowledge Processing. Springer, London (2008)MATHGoogle Scholar
  2. 2.
    Chekol, M.W., Euzenat, J., Genevès, P., Layaïda, N.: SPARQL query containment under RDFS entailment regime. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol. 7364, pp. 134–148. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  3. 3.
    Ferré, S.: A proposal for extending formal concept analysis to knowledge graphs. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds.) ICFCA 2015. LNCS, vol. 9113, pp. 271–286. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  4. 4.
    Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 371–384. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 129–142. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)CrossRefMATHGoogle Scholar
  7. 7.
    Hahn, G., Tardif, C.: Graph homomorphisms: structure and symmetry. In: Hahn, G., Sabidussi, G. (eds.) Graph Symmetry, pp. 107–166. Springer, Dordrecht (1997)CrossRefGoogle Scholar
  8. 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
  9. 9.
    Kuznetsov, S.O., Samokhin, M.V.: Learning closed sets of labeled graphs for chemical applications. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 190–208. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Muggleton, S., Raedt, L.D.: Inductive logic programming: theory and methods. J. Logic Program. 19(20), 629–679 (1994)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Rouane-Hacene, M., Huchard, M., Napoli, A., Valtchev, P.: Relational concept analysis: mining concept lattices from multi-relational data. Ann. Math. Artif. Intell. 67(1), 81–108 (2013)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Schmid, H.: Probabilistic part-of-speech tagging using decision trees. In: International Conference on New Methods in Language Processing (1994)Google Scholar
  13. 13.
    Sowa, J.: Conceptual Structures: Information Processing in Man and Machine. Addison-Wesley, Reading (1984)MATHGoogle Scholar
  14. 14.
    Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Explor. Newsl. 5(1), 59–68 (2003). http://doi.acm.org/10.1145/959242.959249 CrossRefGoogle Scholar
  15. 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

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.IRISA/Université de Rennes 1Rennes CedexFrance
  2. 2.IRISA/INSA RennesRennes CedexFrance

Personalised recommendations