Skip to main content

Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates

  • Chapter
  • First Online:
Complex Data Analytics with Formal Concept Analysis

Abstract

In this article, we recall the NextPriorityConcept algorithm we developed to study concept lattices using first-order monadic predicates. This new approach unifies and simplifies the pattern structure theory proposing to immerse context objects in a dedicated predicate space having the properties of an inference system. This way of managing objects and attributes (monadic predicates) joins the concepts developed in the theory of generalized convex structures, in particular that of half-spaces. We show how this paradigm can be used for boolean, categorized, numerical, character string and sequential data on well-known examples of literature in order to generate lattices whose size is controlled by the user’s choices.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://galactic.univ-lr.fr.

  2. 2.

    https://archive.ics.uci.edu.

  3. 3.

    https://archive.ics.uci.edu.

  4. 4.

    The Iris dataset scatterplot has been taken from https://commons.wikimedia.org/wiki/File:Iris_dataset_scatterplot.svg.

  5. 5.

    https://l3i.univ-larochelle.fr/.

  6. 6.

    https://www.laciteduvin.com/en.

References

  1. GALACTIC image credits. https://galactic.univ-lr.fr/credits.html

  2. Barbut, M., Monjardet, B.: Ordres et classifications : Algèbre et combinatoire. Hachette, Paris (1970), 2 tomes

    Google Scholar 

  3. Bertet, K., Demko, Ch., Viaud, J.F., Guérin, C.: Lattices, closures systems and implication bases: A survey of structural aspects and algorithms. Theoretical Computer Science 743, 93–109 (2018)

    Article  MathSciNet  Google Scholar 

  4. Birkhoff, G.: Lattice theory, vol. 25. American Mathematical Soc. (1940)

    Google Scholar 

  5. Bordat, J.P.: Calcul pratique du treillis de Galois d’une correspondance. Mathématiques et Sciences humaines 96, 31–47 (1986)

    MathSciNet  MATH  Google Scholar 

  6. Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discrete and Computational Geometry 10(1), 377–409 (1993)

    Article  MathSciNet  Google Scholar 

  7. Demko, Ch., Bertet, K., Faucher, C., Viaud, J.F., Kuznetsov, S.O.: NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data. Theoretical Computer Science (Accepted)

    Google Scholar 

  8. Ferré, S.: Reconciling Expressivity and Usability in Information Access - From Filesystems to the Semantic Web. Habilitation, University of Rennes 1, France (november 2014)

    Google Scholar 

  9. Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. vol. 1867, pp. 371–384 (Mar 2000)

    Google Scholar 

  10. Ganter, B., Kuznetsov, S.: Pattern structures and their projections. In: LNCS of International Conference on Conceptual Structures (ICCS’01). pp. 129–142 (2001)

    Google Scholar 

  11. Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical foundations. Springer Verlag, Berlin (1999)

    Google Scholar 

  12. Kaytoue, M.: Contributions to Pattern Discovery. Habilitation, University of Lyon, France (february 2020)

    Google Scholar 

  13. Linding, C.: Fast concept analysis. In: Working with Conceptual Structures-Contributions to ICC. pp. 235–248 (2002)

    Google Scholar 

  14. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: icccn. p. 0215. IEEE (2001)

    Google Scholar 

  15. Prado, A., Jeudy, B., Fromont, E., Diot, F.: Mining Spatiotemporal Patterns in Dynamic Plane Graphs. Intelligent Data Analysis 17(1), 71–92 (2013)

    Article  Google Scholar 

  16. Quine, W.V.O.: The problem of simplifying truth functions. The American Mathematical 59(8), 521–531 (1952)

    Article  MathSciNet  Google Scholar 

  17. Wille, R.: Restructuring lattice theory : an approach based on hierarchies of concepts. Ordered sets pp. 445–470 (1982), i. Rival (ed.), Dordrecht-Boston, Reidel.

    Google Scholar 

  18. Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002). pp. 721–724. IEEE Computer Society, Maebashi City, Japan (December 2002)

    Google Scholar 

  19. Yan, X., Han, J., Afshar, R.: Clospan: Mining: Closed sequential patterns in large datasets. In: Proceedings of the 2003 SIAM international conference on data mining. pp. 166–177. SIAM (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Karell Bertet .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bertet, K., Demko, C., Boukhetta, S., Richard, J., Faucher, C. (2022). Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates. In: Missaoui, R., Kwuida, L., Abdessalem, T. (eds) Complex Data Analytics with Formal Concept Analysis. Springer, Cham. https://doi.org/10.1007/978-3-030-93278-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-93278-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-93277-0

  • Online ISBN: 978-3-030-93278-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics