Skip to main content

2022 | OriginalPaper | Buchkapitel

8. Scalable Visual Analytics in FCA

verfasst von : Tim Pattison, Manuel Enciso, Ángel Mora, Pablo Cordero, Derek Weber, Michael Broughton

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

We adopt a visual analytic approach to FCA by combining computational analysis with interactive visualisation. Scaling FCA to the interactive analysis of large data sets poses four fundamental challenges: the time required to enumerate the vertices, arcs and labels of the lattice digraph; the difficulty of responsive presentation of, and meaningful user interaction with, a large digraph; the time required to enumerate (a basis for) all valid implications; and the discovery of insightful implications. This chapter briefly surveys potential solutions to these scalability challenges posed by big data volumes, and describes software prototypes and coordinated visualisations which explore some of them.

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!

Fußnoten
1
Square brackets are used throughout this chapter to indicate that a sentence is true both when read without the bracketed terms and when read with each bracketed term substituted for the term which precedes it.
 
2
We are indebted to Professor B. Ganter for drawing our attention to the terminology and literature of seriation.
 
3
User-guided construction of the lattice digraph is addressed in Sect.8.5.2.
 
4
 
5
As we previously mentioned, we use the extraction method included in arulesViz, but any other method can be used instead.
 
6
In this section we are visualising the set of rules of the Adults dataset in the UCI Repository (http://​archive.​ics.​uci.​edu/​ml/​datasets/​adult) where the threshold support is set to 0.3 and the confidence to 0.55. This set has 563 rules.
 
Literatur
1.
2.
Zurück zum Zitat Alam M, Le TNN, Napoli A (2016) LatViz: A new practical tool for performing interactive exploration over concept lattices. In: Huchard M, Kuznetsov S (eds) Proc. 13th Intl. Conf. CLA, CEUR-WS.org, vol 1624, pp 9–20 Alam M, Le TNN, Napoli A (2016) LatViz: A new practical tool for performing interactive exploration over concept lattices. In: Huchard M, Kuznetsov S (eds) Proc. 13th Intl. Conf. CLA, CEUR-WS.org, vol 1624, pp 9–20
3.
Zurück zum Zitat Andrews S (2009) In-Close, a fast algorithm for computing formal concepts. In: Rudolph S, Dau F, Kuznetsov S (eds) Supplementary Proc. 17th Intl. Conf. Conceptual Structures, CEUR-WS.org, vol 483 Andrews S (2009) In-Close, a fast algorithm for computing formal concepts. In: Rudolph S, Dau F, Kuznetsov S (eds) Supplementary Proc. 17th Intl. Conf. Conceptual Structures, CEUR-WS.org, vol 483
4.
Zurück zum Zitat Andrews S, Hirsch L (2016) A tool for creating and visualising formal concept trees. In: Andrews S, Polovina S (eds) Proc. 5th Conceptual Structures Tools & Interoperability Workshop (CSTIW 2016) held at the 22nd Intl. Conf. Conceptual Structures (ICCS 2016), CEUR-WS.org, vol 1637, pp 1–9 Andrews S, Hirsch L (2016) A tool for creating and visualising formal concept trees. In: Andrews S, Polovina S (eds) Proc. 5th Conceptual Structures Tools & Interoperability Workshop (CSTIW 2016) held at the 22nd Intl. Conf. Conceptual Structures (ICCS 2016), CEUR-WS.org, vol 1637, pp 1–9
5.
Zurück zum Zitat Archambault D, Munzner T, Auber D (2008) Grouseflocks: Steerable exploration of graph hierarchy space. IEEE Transactions on Visualization and Computer Graphics 14(4):900–913CrossRef Archambault D, Munzner T, Auber D (2008) Grouseflocks: Steerable exploration of graph hierarchy space. IEEE Transactions on Visualization and Computer Graphics 14(4):900–913CrossRef
6.
Zurück zum Zitat Armstrong WW (1974) Dependency structures of database relationships. Information Processing 74:580–583 Armstrong WW (1974) Dependency structures of database relationships. Information Processing 74:580–583
7.
Zurück zum Zitat Baklouti F, Lévy G, Emilion R (2005) A fast and general algorithm for Galois lattices building. Journal of Symbolic Data Analysis 2:19–31 Baklouti F, Lévy G, Emilion R (2005) A fast and general algorithm for Galois lattices building. Journal of Symbolic Data Analysis 2:19–31
9.
Zurück zum Zitat Bělohlávek R, Vychodil V (2005) What is a fuzzy concept lattice? In: [8], pp 34–45 Bělohlávek R, Vychodil V (2005) What is a fuzzy concept lattice? In: [8], pp 34–45
11.
Zurück zum Zitat Berry A, Pogorelcnik R, Sigayret A (2011) Vertical decomposition of a lattice using clique separators. In: Napoli A, Vychodil V (eds) Proc. 2011 Intl. Conf. CLA, CEUR-WS.org, vol 959, pp 15–29 Berry A, Pogorelcnik R, Sigayret A (2011) Vertical decomposition of a lattice using clique separators. In: Napoli A, Vychodil V (eds) Proc. 2011 Intl. Conf. CLA, CEUR-WS.org, vol 959, pp 15–29
12.
Zurück zum Zitat Berry A, Gutierrez A, Huchard M, Napoli A, Sigayret A (2014) Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation. Annals of Mathematics and Artificial Intelligence 72(1):45–71MathSciNetMATHCrossRef Berry A, Gutierrez A, Huchard M, Napoli A, Sigayret A (2014) Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation. Annals of Mathematics and Artificial Intelligence 72(1):45–71MathSciNetMATHCrossRef
13.
Zurück zum Zitat Bhatti MU, Anquetil N, Huchard M, Ducasse S (2012) A catalog of patterns for concept lattice interpretation in software reengineering. In: Proc. 24th Intl. Conf. Software Eng. & Knowledge Eng. (SEKE’2012), Knowledge Systems Institute Graduate School, pp 118–124 Bhatti MU, Anquetil N, Huchard M, Ducasse S (2012) A catalog of patterns for concept lattice interpretation in software reengineering. In: Proc. 24th Intl. Conf. Software Eng. & Knowledge Eng. (SEKE’2012), Knowledge Systems Institute Graduate School, pp 118–124
14.
Zurück zum Zitat Boukhelifa N, Roberts JC, Rodgers P (2003) A coordination model for exploratory multiview visualization. In: Proc. Intl. Conf. Coordinated and Multiple Views in Exploratory Visualization (CMV 2003), IEEE, pp 76–85 Boukhelifa N, Roberts JC, Rodgers P (2003) A coordination model for exploratory multiview visualization. In: Proc. Intl. Conf. Coordinated and Multiple Views in Exploratory Visualization (CMV 2003), IEEE, pp 76–85
15.
Zurück zum Zitat Card S, Mackinlay J, Shneiderman B (1999) Readings in information visualization: Using vision to think. Morgan Kaufmann Card S, Mackinlay J, Shneiderman B (1999) Readings in information visualization: Using vision to think. Morgan Kaufmann
17.
Zurück zum Zitat Chen CP, Zhang CY (2014) Data-intensive applications, challenges, techniques and technologies: A survey on big data. Inf Sci 275:314–347CrossRef Chen CP, Zhang CY (2014) Data-intensive applications, challenges, techniques and technologies: A survey on big data. Inf Sci 275:314–347CrossRef
18.
Zurück zum Zitat Choi V, Huang Y (2006) Faster algorithms for constructing a Galois lattice, enumerating all maximal bipartite cliques and closed frequent sets. Presented at SIAM Conf. Discrete Mathematics Choi V, Huang Y (2006) Faster algorithms for constructing a Galois lattice, enumerating all maximal bipartite cliques and closed frequent sets. Presented at SIAM Conf. Discrete Mathematics
19.
Zurück zum Zitat Clémençon S, Arazoza HD, Rossi F, Tran VC (2011) Hierarchical clustering for graph visualization. In: Proc. XIXth European Symposium on Artificial Neural Networks (ESANN 2011), i6doc.com, pp 227–232 Clémençon S, Arazoza HD, Rossi F, Tran VC (2011) Hierarchical clustering for graph visualization. In: Proc. XIXth European Symposium on Artificial Neural Networks (ESANN 2011), i6doc.com, pp 227–232
21.
Zurück zum Zitat Cordero P, Enciso M, Mora Á, Ojeda-Aciego M (2012) Computing minimal generators from implications: a logic-guided approach. In: Proc. 2012 Intl. Conf. CLA, CEUR-WS.org, vol 972, pp 187–198 Cordero P, Enciso M, Mora Á, Ojeda-Aciego M (2012) Computing minimal generators from implications: a logic-guided approach. In: Proc. 2012 Intl. Conf. CLA, CEUR-WS.org, vol 972, pp 187–198
22.
Zurück zum Zitat Davey BA, Priestley HA (2002) Introduction to Lattices and Order, 2nd edn. Cambridge University Press, EnglandMATHCrossRef Davey BA, Priestley HA (2002) Introduction to Lattices and Order, 2nd edn. Cambridge University Press, EnglandMATHCrossRef
23.
Zurück zum Zitat Di Battista G, Eades P, Tamassia R, Tollis I (1999) Graph Drawing: Algorithms for the visualization of graphs. Prentice Hall, NJ, USA Di Battista G, Eades P, Tamassia R, Tollis I (1999) Graph Drawing: Algorithms for the visualization of graphs. Prentice Hall, NJ, USA
24.
Zurück zum Zitat Ducrou J, Eklund P (2006) Browsing and searching MPEG-7 images using Formal Concept Analysis. In: Proc. 24th IASTED Intl. Conf. Artificial Intelligence and Applications (AIA’06), Innsbruck, Austria, pp 317–322 Ducrou J, Eklund P (2006) Browsing and searching MPEG-7 images using Formal Concept Analysis. In: Proc. 24th IASTED Intl. Conf. Artificial Intelligence and Applications (AIA’06), Innsbruck, Austria, pp 317–322
27.
Zurück zum Zitat Eklund PW, Ducrou J, Brawn P (2004) Concept lattices for information visualization: Can novices read line diagrams? In: [25], pp 57–73 Eklund PW, Ducrou J, Brawn P (2004) Concept lattices for information visualization: Can novices read line diagrams? In: [25], pp 57–73
28.
Zurück zum Zitat Few S (2012) Show Me the Numbers: Designing Tables and Graphs to Enlighten, 2nd edn. Analytics Press Few S (2012) Show Me the Numbers: Designing Tables and Graphs to Enlighten, 2nd edn. Analytics Press
29.
Zurück zum Zitat Freese R (2004) Automated lattice drawing. In: [25], pp 112–123 Freese R (2004) Automated lattice drawing. In: [25], pp 112–123
31.
Zurück zum Zitat Ganter B, Obiedkov S (2016) Attribute exploration, Springer, chap 4, pp 125–185MATH Ganter B, Obiedkov S (2016) Attribute exploration, Springer, chap 4, pp 125–185MATH
32.
33.
Zurück zum Zitat Gaume B, Navarro E, Prade H (2010) A parallel between extended Formal Concept Analysis and bipartite graphs analysis. In: Proc. IPMU’10, Berlin, Heidelberg, LNCS, vol 6178, pp 270–280 Gaume B, Navarro E, Prade H (2010) A parallel between extended Formal Concept Analysis and bipartite graphs analysis. In: Proc. IPMU’10, Berlin, Heidelberg, LNCS, vol 6178, pp 270–280
34.
Zurück zum Zitat Godin R, Saunders E, Jescei J (1986) Lattice model of browsable data spaces. Information Sciences 40(2):89–116MATHCrossRef Godin R, Saunders E, Jescei J (1986) Lattice model of browsable data spaces. Information Sciences 40(2):89–116MATHCrossRef
36.
Zurück zum Zitat Guigues Jl, Duquenne V (1986) Familles minimales d’implications informatives d’un tableau de données binaires. Mathématiques et Sciences Humaines 95:5–18 Guigues Jl, Duquenne V (1986) Familles minimales d’implications informatives d’un tableau de données binaires. Mathématiques et Sciences Humaines 95:5–18
37.
Zurück zum Zitat Hahsler M (2017) arulesViz: Interactive visualization of association rules with R. The R Journal 9(2):163–175CrossRef Hahsler M (2017) arulesViz: Interactive visualization of association rules with R. The R Journal 9(2):163–175CrossRef
38.
Zurück zum Zitat Hahsler M, Karpienko R (2017) Visualizing association rules in hierarchical groups. J Bus Econ 87:317–335 Hahsler M, Karpienko R (2017) Visualizing association rules in hierarchical groups. J Bus Econ 87:317–335
39.
Zurück zum Zitat Hahsler M, Grun B, Hornik K (2005) arules - a computational environment for mining association rules and frequent item sets. J Stat Software 14:1–25CrossRef Hahsler M, Grun B, Hornik K (2005) arules - a computational environment for mining association rules and frequent item sets. J Stat Software 14:1–25CrossRef
40.
Zurück zum Zitat Hannan T, Pogel A (2006) Spring-based lattice drawing highlighting conceptual similarity. In: Proc. 4th Intl. Conf. FCA, LNCS, vol 3874, pp 264–279MATH Hannan T, Pogel A (2006) Spring-based lattice drawing highlighting conceptual similarity. In: Proc. 4th Intl. Conf. FCA, LNCS, vol 3874, pp 264–279MATH
41.
Zurück zum Zitat Herman I, Melançon G, Marshall MS (2000) Graph visualization and navigation in information visualization: a survey. IEEE Transactions on Visualization and Computer Graphics 6:24–43CrossRef Herman I, Melançon G, Marshall MS (2000) Graph visualization and navigation in information visualization: a survey. IEEE Transactions on Visualization and Computer Graphics 6:24–43CrossRef
42.
Zurück zum Zitat Ignatov DI, Nourine L (eds) (2018) Proc. 2018 Intl. Conf. CLA, vol 2123, CEUR-WS.org Ignatov DI, Nourine L (eds) (2018) Proc. 2018 Intl. Conf. CLA, vol 2123, CEUR-WS.org
43.
Zurück zum Zitat Kriegel F (2013) Visualization of conceptual data with methods of Formal Concept Analysis. PhD thesis, Technische Universitat Dresden Kriegel F (2013) Visualization of conceptual data with methods of Formal Concept Analysis. PhD thesis, Technische Universitat Dresden
44.
Zurück zum Zitat Kuznetsov SO, Obiedkov SA (2001) Algorithms for the construction of concept lattices and their diagram graphs. In: [70], pp 289–300 Kuznetsov SO, Obiedkov SA (2001) Algorithms for the construction of concept lattices and their diagram graphs. In: [70], pp 289–300
45.
Zurück zum Zitat Lamping J, Rao R, Pirolli P (1995) A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In: Proc. SIGCHI Conf. Human Factors in Computing Systems, New York, NY, USA, pp 401–408 Lamping J, Rao R, Pirolli P (1995) A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In: Proc. SIGCHI Conf. Human Factors in Computing Systems, New York, NY, USA, pp 401–408
46.
Zurück zum Zitat Landauer T, McNamara D, Dennis S, Kintsch W (eds) (2013) Handbook of Latent Semantic Analysis. Taylor & Francis Landauer T, McNamara D, Dennis S, Kintsch W (eds) (2013) Handbook of Latent Semantic Analysis. Taylor & Francis
47.
Zurück zum Zitat Leung KS, Leung CKS, P Irani P, L Carmichael C (2008) WiFIsViz: Effective visualization of frequent itemsets. IEEE Intl Conf Data Mining pp 875–880 Leung KS, Leung CKS, P Irani P, L Carmichael C (2008) WiFIsViz: Effective visualization of frequent itemsets. IEEE Intl Conf Data Mining pp 875–880
48.
Zurück zum Zitat Liiv I (2008) Pattern discovery using seriation and matrix reordering: A unified view, extensions and an application to inventory management. PhD thesis, Tallinn University Of Technology Liiv I (2008) Pattern discovery using seriation and matrix reordering: A unified view, extensions and an application to inventory management. PhD thesis, Tallinn University Of Technology
49.
Zurück zum Zitat Lindig C (2000) Fast concept analysis. In: Working With Conceptual Structures - Contributions to ICCS 2000, pp 152–161 Lindig C (2000) Fast concept analysis. In: Working With Conceptual Structures - Contributions to ICCS 2000, pp 152–161
50.
Zurück zum Zitat Maddouri M, Gammoudi J (2007) On semantic properties of interestingness measures for extracting rules from data. In: Adaptive and Natural Computing Algorithms, Springer, LNCS, vol 4431, pp 148–158CrossRef Maddouri M, Gammoudi J (2007) On semantic properties of interestingness measures for extracting rules from data. In: Adaptive and Natural Computing Algorithms, Springer, LNCS, vol 4431, pp 148–158CrossRef
51.
Zurück zum Zitat Melo C, Le-Grand B, Aufaure MA, Bezerianos A (2011) Extracting and visualising tree-like structures from concept lattices. In: Proc. 15th Intl. Conf. Information Visualisation, IEEE Computer Society, Washington, DC, USA, pp 261–266. https://doi.org/10.1109/IV.2011.46 Melo C, Le-Grand B, Aufaure MA, Bezerianos A (2011) Extracting and visualising tree-like structures from concept lattices. In: Proc. 15th Intl. Conf. Information Visualisation, IEEE Computer Society, Washington, DC, USA, pp 261–266. https://​doi.​org/​10.​1109/​IV.​2011.​46
52.
Zurück zum Zitat Melo C, Mikheev A, Le-Grand B, Aufaure M (2012) Cubix: A visual analytics tool for conceptual and semantic data. In: Vreeken J, Ling C, Zaki MJ, Siebes A, Yu JX, Goethals B, Webb G, Wu X (eds) 12th International Conference on Data Mining Workshops, IEEE, pp 894–897. https://doi.org/10.1109/ICDMW30884.2012.41 Melo C, Mikheev A, Le-Grand B, Aufaure M (2012) Cubix: A visual analytics tool for conceptual and semantic data. In: Vreeken J, Ling C, Zaki MJ, Siebes A, Yu JX, Goethals B, Webb G, Wu X (eds) 12th International Conference on Data Mining Workshops, IEEE, pp 894–897. https://​doi.​org/​10.​1109/​ICDMW30884.​2012.​41
53.
Zurück zum Zitat Mora Á, Cordero P, Enciso M, Fortes I, Aguilera G (2012) Closure via functional dependence simplification. Int J Comput Math 89(4):510–526MathSciNetMATHCrossRef Mora Á, Cordero P, Enciso M, Fortes I, Aguilera G (2012) Closure via functional dependence simplification. Int J Comput Math 89(4):510–526MathSciNetMATHCrossRef
54.
Zurück zum Zitat Nauer E, Toussaint Y (2009) CreChainDo: An iterative and interactive web information retrieval system based on lattices. Intl J General Systems 38(4):363–378MATHCrossRef Nauer E, Toussaint Y (2009) CreChainDo: An iterative and interactive web information retrieval system based on lattices. Intl J General Systems 38(4):363–378MATHCrossRef
55.
Zurück zum Zitat Outrata J, Vychodil V (2012) Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Information Sciences 185(1):114–127MathSciNetMATHCrossRef Outrata J, Vychodil V (2012) Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Information Sciences 185(1):114–127MathSciNetMATHCrossRef
56.
Zurück zum Zitat Owais S, Gajdoš P, Snášel V (2005) Usage of genetic algorithm for lattice drawing. In: [8], pp 82–91 Owais S, Gajdoš P, Snášel V (2005) Usage of genetic algorithm for lattice drawing. In: [8], pp 82–91
57.
Zurück zum Zitat Papoulis A (1984) Probability, Random Variables, and Stochastic Processes, 2nd edn. McGraw-Hill Series in Electr. Eng., McGraw-HillMATH Papoulis A (1984) Probability, Random Variables, and Stochastic Processes, 2nd edn. McGraw-Hill Series in Electr. Eng., McGraw-HillMATH
58.
Zurück zum Zitat Pattison T (2014) Interactive visualisation of formal concept lattices. In: Burton J, Stapleton G, Klein K (eds) Joint Proc. 4th Intl. Workshop Euler Diagrams and 1st Intl. Workshop Graph Visualization in Practice, CEUR-WS.org, vol 1244, pp 78–79 Pattison T (2014) Interactive visualisation of formal concept lattices. In: Burton J, Stapleton G, Klein K (eds) Joint Proc. 4th Intl. Workshop Euler Diagrams and 1st Intl. Workshop Graph Visualization in Practice, CEUR-WS.org, vol 1244, pp 78–79
59.
Zurück zum Zitat Pattison T (2018) Interactive query refinement using Formal Concept Analysis. In: [42], pp 207–218 Pattison T (2018) Interactive query refinement using Formal Concept Analysis. In: [42], pp 207–218
60.
Zurück zum Zitat Pattison T, Ceglar A (2014) Interaction challenges for the dynamic construction of partially-ordered sets. In: Proc. 2014 Intl. Conf. CLA, CEUR-WS.org, vol 1252, pp 23–34 Pattison T, Ceglar A (2014) Interaction challenges for the dynamic construction of partially-ordered sets. In: Proc. 2014 Intl. Conf. CLA, CEUR-WS.org, vol 1252, pp 23–34
61.
Zurück zum Zitat Pattison T, Ceglar A (2019) Simultaneous, polynomial-time layout of context bigraph and lattice digraph. In: Proc. 15th Intl. Conf. FCA, pp 223–240 Pattison T, Ceglar A (2019) Simultaneous, polynomial-time layout of context bigraph and lattice digraph. In: Proc. 15th Intl. Conf. FCA, pp 223–240
62.
Zurück zum Zitat Pattison T, Ceglar A (2021) Towards interactive transition from AOC poset to concept lattice. In: 2021 Intl. Conf. FCA, to be submitted Pattison T, Ceglar A (2021) Towards interactive transition from AOC poset to concept lattice. In: 2021 Intl. Conf. FCA, to be submitted
63.
Zurück zum Zitat Pattison T, Phillips M (2001) View coordination architecture for information visualisation. In: Eades P, Pattison T (eds) Proc. Australian Symposium on Information Visualisation, ACS Pattison T, Phillips M (2001) View coordination architecture for information visualisation. In: Eades P, Pattison T (eds) Proc. Australian Symposium on Information Visualisation, ACS
64.
Zurück zum Zitat Pattison T, Weber D, Ceglar A (2014) Enhancing layout and interaction in Formal Concept Analysis. In: IEEE Pacific Visualization Symposium (PacificVis), pp 248–252 Pattison T, Weber D, Ceglar A (2014) Enhancing layout and interaction in Formal Concept Analysis. In: IEEE Pacific Visualization Symposium (PacificVis), pp 248–252
65.
Zurück zum Zitat Pattison T, Ceglar A, Weber D (2018) Efficient Formal Concept Analysis through recursive context partitioning. In: [42], pp 219–230 Pattison T, Ceglar A, Weber D (2018) Efficient Formal Concept Analysis through recursive context partitioning. In: [42], pp 219–230
66.
Zurück zum Zitat Poelmans J, Elzinga P, Viaene S, Dedene G (2010) Formal Concept Analysis in knowledge discovery: A survey. In: Conceptual Structures: From Information to Intelligence, LNCS, vol 6208, Springer, pp 139–153 Poelmans J, Elzinga P, Viaene S, Dedene G (2010) Formal Concept Analysis in knowledge discovery: A survey. In: Conceptual Structures: From Information to Intelligence, LNCS, vol 6208, Springer, pp 139–153
68.
Zurück zum Zitat Priss U (2006) Formal Concept Analysis in Information Science. Annual Review of Information Science and Technology 40:521–543CrossRef Priss U (2006) Formal Concept Analysis in Information Science. Annual Review of Information Science and Technology 40:521–543CrossRef
71.
Zurück zum Zitat Rival I (1993) Reading, drawing, and order. In: Rosenberg IG, Sabidussi G (eds) Algebras and Orders, Springer, Dordrecht, Netherlands, pp 359–404MATHCrossRef Rival I (1993) Reading, drawing, and order. In: Rosenberg IG, Sabidussi G (eds) Algebras and Orders, Springer, Dordrecht, Netherlands, pp 359–404MATHCrossRef
72.
Zurück zum Zitat Roberts JC (2007) State of the art: Coordinated and multiple views in exploratory visualization. In: Proc. 5th Intl. Conf. Coordinated and Multiple Views in Exploratory Visualization (CMV2007), IEEE, pp 61–71 Roberts JC (2007) State of the art: Coordinated and multiple views in exploratory visualization. In: Proc. 5th Intl. Conf. Coordinated and Multiple Views in Exploratory Visualization (CMV2007), IEEE, pp 61–71
73.
Zurück zum Zitat Rodríguez-Lorenzo E, Adaricheva K, Cordero P, Enciso M, Mora Á (2017) Formation of the d-basis from implicational systems using simplification logic. Intl J General Systems 46(5):547–568MathSciNetCrossRef Rodríguez-Lorenzo E, Adaricheva K, Cordero P, Enciso M, Mora Á (2017) Formation of the d-basis from implicational systems using simplification logic. Intl J General Systems 46(5):547–568MathSciNetCrossRef
74.
Zurück zum Zitat Rodríguez-Lorenzo E, Bertet K, Cordero P, Enciso M, Mora Á (2018) Direct-optimal basis computation by means of the fusion of simplification rules. Discrete Applied Math 249:106–119MathSciNetMATHCrossRef Rodríguez-Lorenzo E, Bertet K, Cordero P, Enciso M, Mora Á (2018) Direct-optimal basis computation by means of the fusion of simplification rules. Discrete Applied Math 249:106–119MathSciNetMATHCrossRef
75.
Zurück zum Zitat Sertkaya B (2010) A survey on how description logic ontologies benefit from FCA. In: Proc. 2010 Intl. Conf. CLA, CEUR-WS.org, vol 672, pp 2–21 Sertkaya B (2010) A survey on how description logic ontologies benefit from FCA. In: Proc. 2010 Intl. Conf. CLA, CEUR-WS.org, vol 672, pp 2–21
76.
Zurück zum Zitat Shaaban E, Helmy Y, Khedr A, Nasr M (2012) Business intelligence maturity models: Toward new integrated model. In: Proc. Intl. Arab Conf. Information Technology, pp 276–284 Shaaban E, Helmy Y, Khedr A, Nasr M (2012) Business intelligence maturity models: Toward new integrated model. In: Proc. Intl. Arab Conf. Information Technology, pp 276–284
77.
Zurück zum Zitat Shields C (ed) (2012) The Oxford Handbook of Aristotle. Oxford Univ. Press Shields C (ed) (2012) The Oxford Handbook of Aristotle. Oxford Univ. Press
78.
Zurück zum Zitat Shneiderman B (1992) Tree visualization with treemaps: a 2-D space-filling approach. ACM Transactions on Graphics 11(1):92–99MATHCrossRef Shneiderman B (1992) Tree visualization with treemaps: a 2-D space-filling approach. ACM Transactions on Graphics 11(1):92–99MATHCrossRef
79.
Zurück zum Zitat Simon P (2014) The Visual Organization: Data Visualization, Big Data, and the Quest for Better Decisions. Harvard Business Review Simon P (2014) The Visual Organization: Data Visualization, Big Data, and the Quest for Better Decisions. Harvard Business Review
80.
Zurück zum Zitat Stewart I (2004) Galois theory, 3rd edn. Chapman & Hall/CRC Mathematics Stewart I (2004) Galois theory, 3rd edn. Chapman & Hall/CRC Mathematics
81.
Zurück zum Zitat Stumme G, Taouil R, Bastide Y, Pasquier N, Lakhal L (2002) Computing Iceberg concept lattices with Titanic. Data & Knowledge Eng 42(2):189–222MATHCrossRef Stumme G, Taouil R, Bastide Y, Pasquier N, Lakhal L (2002) Computing Iceberg concept lattices with Titanic. Data & Knowledge Eng 42(2):189–222MATHCrossRef
82.
Zurück zum Zitat Sucharitha V, Subash SR, Prakash P (2014) Visualization of big data: Its tools and challenges. Intl J Applied Eng Res 9(18):5277–5290 Sucharitha V, Subash SR, Prakash P (2014) Visualization of big data: Its tools and challenges. Intl J Applied Eng Res 9(18):5277–5290
83.
Zurück zum Zitat Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical system structures. IEEE Trans Systems, Man and Cybernetics 11(2):109–125MathSciNetCrossRef Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical system structures. IEEE Trans Systems, Man and Cybernetics 11(2):109–125MathSciNetCrossRef
84.
Zurück zum Zitat Techapichetvanich K, Datta A (2008) VisAR: A new technique for visualizing mined association rules. In: Proc. 1st Intl. Conf. Advanced Data Mining and Applications, Springer, LNAI, vol 3584, pp 88–95CrossRef Techapichetvanich K, Datta A (2008) VisAR: A new technique for visualizing mined association rules. In: Proc. 1st Intl. Conf. Advanced Data Mining and Applications, Springer, LNAI, vol 3584, pp 88–95CrossRef
85.
Zurück zum Zitat Thomas JJ, Cook KA (eds) (2005) Illuminating the Path: The Research and Development Agenda for Visual Analytics. IEEE Press Thomas JJ, Cook KA (eds) (2005) Illuminating the Path: The Research and Development Agenda for Visual Analytics. IEEE Press
86.
Zurück zum Zitat Unwin A, Hofmann H, Bernt K (2001) The TwoKey plot for multiple association rules control. In: [70], pp 472–483 Unwin A, Hofmann H, Bernt K (2001) The TwoKey plot for multiple association rules control. In: [70], pp 472–483
88.
Zurück zum Zitat Wille R (1982) Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets, Reidel Publishing, Dordrecht–Boston, pp 445–470CrossRef Wille R (1982) Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets, Reidel Publishing, Dordrecht–Boston, pp 445–470CrossRef
89.
Zurück zum Zitat Wray T, Eklund P (2011) Exploring the information space of cultural collections. In: Valtchev P, Jäschke R (eds) Proc. 9th Intl. Conf. FCA, Springer Wray T, Eklund P (2011) Exploring the information space of cultural collections. In: Valtchev P, Jäschke R (eds) Proc. 9th Intl. Conf. FCA, Springer
90.
Zurück zum Zitat Yevtushenko SA (2000) Concept Explorer: a system for data analysis. In: Proc. 7th National Conference on Artificial Intelligence KII-2000, Russia, pp 127–134, in Russian Yevtushenko SA (2000) Concept Explorer: a system for data analysis. In: Proc. 7th National Conference on Artificial Intelligence KII-2000, Russia, pp 127–134, in Russian
91.
Zurück zum Zitat Yevtushenko SA (2004) Computing and visualizing concept lattices. PhD thesis, Technischen Universität Darmstadt Yevtushenko SA (2004) Computing and visualizing concept lattices. PhD thesis, Technischen Universität Darmstadt
92.
Zurück zum Zitat Zschalig C (2007) An FDP-algorithm for drawing lattices. In: Proc. 2007 Intl. Conf. CLA, CEUR-WS.org, vol 331, pp 58–71 Zschalig C (2007) An FDP-algorithm for drawing lattices. In: Proc. 2007 Intl. Conf. CLA, CEUR-WS.org, vol 331, pp 58–71
Metadaten
Titel
Scalable Visual Analytics in FCA
verfasst von
Tim Pattison
Manuel Enciso
Ángel Mora
Pablo Cordero
Derek Weber
Michael Broughton
Copyright-Jahr
2022
DOI
https://doi.org/10.1007/978-3-030-93278-7_8