Skip to main content

2022 | OriginalPaper | Buchkapitel

4. Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates

verfasst von : Karell Bertet, Christophe Demko, Salah Boukhetta, Jérémy Richard, Cyril Faucher

Erschienen in: Complex Data Analytics with Formal Concept Analysis

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Barbut, M., Monjardet, B.: Ordres et classifications : Algèbre et combinatoire. Hachette, Paris (1970), 2 tomes Barbut, M., Monjardet, B.: Ordres et classifications : Algèbre et combinatoire. Hachette, Paris (1970), 2 tomes
3.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
4.
Zurück zum Zitat Birkhoff, G.: Lattice theory, vol. 25. American Mathematical Soc. (1940) Birkhoff, G.: Lattice theory, vol. 25. American Mathematical Soc. (1940)
5.
Zurück zum Zitat Bordat, J.P.: Calcul pratique du treillis de Galois d’une correspondance. Mathématiques et Sciences humaines 96, 31–47 (1986)MathSciNetMATH Bordat, J.P.: Calcul pratique du treillis de Galois d’une correspondance. Mathématiques et Sciences humaines 96, 31–47 (1986)MathSciNetMATH
6.
Zurück zum Zitat Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discrete and Computational Geometry 10(1), 377–409 (1993)MathSciNetCrossRef Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discrete and Computational Geometry 10(1), 377–409 (1993)MathSciNetCrossRef
7.
Zurück zum Zitat 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) 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)
8.
Zurück zum Zitat Ferré, S.: Reconciling Expressivity and Usability in Information Access - From Filesystems to the Semantic Web. Habilitation, University of Rennes 1, France (november 2014) Ferré, S.: Reconciling Expressivity and Usability in Information Access - From Filesystems to the Semantic Web. Habilitation, University of Rennes 1, France (november 2014)
9.
Zurück zum Zitat Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. vol. 1867, pp. 371–384 (Mar 2000) Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. vol. 1867, pp. 371–384 (Mar 2000)
10.
Zurück zum Zitat Ganter, B., Kuznetsov, S.: Pattern structures and their projections. In: LNCS of International Conference on Conceptual Structures (ICCS’01). pp. 129–142 (2001) Ganter, B., Kuznetsov, S.: Pattern structures and their projections. In: LNCS of International Conference on Conceptual Structures (ICCS’01). pp. 129–142 (2001)
11.
Zurück zum Zitat Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical foundations. Springer Verlag, Berlin (1999) Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical foundations. Springer Verlag, Berlin (1999)
12.
Zurück zum Zitat Kaytoue, M.: Contributions to Pattern Discovery. Habilitation, University of Lyon, France (february 2020) Kaytoue, M.: Contributions to Pattern Discovery. Habilitation, University of Lyon, France (february 2020)
13.
Zurück zum Zitat Linding, C.: Fast concept analysis. In: Working with Conceptual Structures-Contributions to ICC. pp. 235–248 (2002) Linding, C.: Fast concept analysis. In: Working with Conceptual Structures-Contributions to ICC. pp. 235–248 (2002)
14.
Zurück zum Zitat 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) 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)
15.
Zurück zum Zitat Prado, A., Jeudy, B., Fromont, E., Diot, F.: Mining Spatiotemporal Patterns in Dynamic Plane Graphs. Intelligent Data Analysis 17(1), 71–92 (2013)CrossRef Prado, A., Jeudy, B., Fromont, E., Diot, F.: Mining Spatiotemporal Patterns in Dynamic Plane Graphs. Intelligent Data Analysis 17(1), 71–92 (2013)CrossRef
16.
17.
Zurück zum Zitat Wille, R.: Restructuring lattice theory : an approach based on hierarchies of concepts. Ordered sets pp. 445–470 (1982), i. Rival (ed.), Dordrecht-Boston, Reidel. Wille, R.: Restructuring lattice theory : an approach based on hierarchies of concepts. Ordered sets pp. 445–470 (1982), i. Rival (ed.), Dordrecht-Boston, Reidel.
18.
Zurück zum Zitat 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) 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)
19.
Zurück zum Zitat 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) 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)
Metadaten
Titel
Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates
verfasst von
Karell Bertet
Christophe Demko
Salah Boukhetta
Jérémy Richard
Cyril Faucher
Copyright-Jahr
2022
DOI
https://doi.org/10.1007/978-3-030-93278-7_4