{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:35:20Z","timestamp":1758274520142,"version":"3.40.3"},"publisher-location":"Cham","reference-count":92,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030932770"},{"type":"electronic","value":"9783030932787"}],"license":[{"start":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T00:00:00Z","timestamp":1638921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T00:00:00Z","timestamp":1638921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93278-7_8","type":"book-chapter","created":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T14:06:47Z","timestamp":1656511607000},"page":"167-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scalable Visual Analytics in FCA"],"prefix":"10.1007","author":[{"given":"Tim","family":"Pattison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Enciso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1ngel","family":"Mora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Cordero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derek","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Broughton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,8]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A Aho","year":"1972","unstructured":"Aho A, Garey M, Ullman J (1972) The transitive reduction of a directed graph. SIAM Journal on Computing 1(2):131\u2013137","journal-title":"SIAM Journal on Computing"},{"key":"8_CR2","unstructured":"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\u201320"},{"key":"8_CR3","unstructured":"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"},{"key":"8_CR4","unstructured":"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\u20139"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1109\/TVCG.2008.34","volume":"14","author":"D Archambault","year":"2008","unstructured":"Archambault D, Munzner T, Auber D (2008) Grouseflocks: Steerable exploration of graph hierarchy space. IEEE Transactions on Visualization and Computer Graphics 14(4):900\u2013913","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"8_CR6","first-page":"580","volume":"74","author":"WW Armstrong","year":"1974","unstructured":"Armstrong WW (1974) Dependency structures of database relationships. Information Processing 74:580\u2013583","journal-title":"Information Processing"},{"key":"8_CR7","first-page":"19","volume":"2","author":"F Baklouti","year":"2005","unstructured":"Baklouti F, L\u00e9vy G, Emilion R (2005) A fast and general algorithm for Galois lattices building. Journal of Symbolic Data Analysis 2:19\u201331","journal-title":"Journal of Symbolic Data Analysis"},{"key":"8_CR8","unstructured":"Belohl\u00e1vek R, Snasel V (eds) (2005) Proc. 2005 Intl. Workshop CLA, vol 162, CEUR-WS.org, http:\/\/ceur-ws.org\/Vol-162\/"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"B\u011blohl\u00e1vek R, Vychodil V (2005) What is a fuzzy concept lattice? In: [8], pp 34\u201345","DOI":"10.1007\/978-3-030-93278-7"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1007\/s11227-018-2453-z","volume":"75","author":"F Benito-Picazo","year":"2019","unstructured":"Benito-Picazo F, Cordero P, Enciso M, Mora \u00c1 (2019) Minimal generators, an affordable approach by means of massive computation. J Supercomput 75(3):1350\u20131367. https:\/\/doi.org\/10.1007\/s11227-018-2453-z","journal-title":"J Supercomput"},{"key":"8_CR11","unstructured":"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\u201329"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10472-014-9418-6","volume":"72","author":"A Berry","year":"2014","unstructured":"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\u201371","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"8_CR13","unstructured":"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\u20192012), Knowledge Systems Institute Graduate School, pp 118\u2013124"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"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\u201385","DOI":"10.1109\/CMV.2003.1215005"},{"key":"8_CR15","volume-title":"Readings in information visualization: Using vision to think","author":"S Card","year":"1999","unstructured":"Card S, Mackinlay J, Shneiderman B (1999) Readings in information visualization: Using vision to think. Morgan Kaufmann"},{"issue":"8","key":"8_CR16","doi-asserted-by":"publisher","first-page":"985","DOI":"10.3217\/jucs-010-08","volume":"10","author":"C Carpineto","year":"2004","unstructured":"Carpineto C, Romano G (2004) Exploiting the potential of concept lattices for information retrieval with CREDO. J Univers Comput Sci 10(8):985\u20131013. https:\/\/doi.org\/10.3217\/jucs-010-08","journal-title":"J Univers Comput Sci"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ins.2014.01.015","volume":"275","author":"CP Chen","year":"2014","unstructured":"Chen CP, Zhang CY (2014) Data-intensive applications, challenges, techniques and technologies: A survey on big data. Inf Sci 275:314\u2013347","journal-title":"Inf Sci"},{"key":"8_CR18","unstructured":"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"},{"key":"8_CR19","unstructured":"Cl\u00e9men\u00e7on 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\u2013232"},{"key":"8_CR20","first-page":"141","volume":"2002","author":"P Cordero","year":"2002","unstructured":"Cordero P, Enciso M, Mora \u00c1, de Guzm\u00e1n IP (2002) SLFD logic: Elimination of data redundancy in knowledge representation. In: Advances in Artificial Intelligence \u2013 IBERAMIA 2002, pp 141\u2013150. https:\/\/doi.org\/10.1007\/3-540-36131-6","journal-title":"Advances in Artificial Intelligence \u2013 IBERAMIA"},{"key":"8_CR21","unstructured":"Cordero P, Enciso M, Mora \u00c1, 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\u2013198"},{"key":"8_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey BA, Priestley HA (2002) Introduction to Lattices and Order, 2nd edn. Cambridge University Press, England","edition":"2"},{"key":"8_CR23","unstructured":"Di Battista G, Eades P, Tamassia R, Tollis I (1999) Graph Drawing: Algorithms for the visualization of graphs. Prentice Hall, NJ, USA"},{"key":"8_CR24","unstructured":"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\u201906), Innsbruck, Austria, pp 317\u2013322"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Eklund P (ed) (2004) Proc. 2nd Intl. Conf. FCA, LNCS, vol 2961, Springer. https:\/\/doi.org\/10.1007\/b95548","DOI":"10.1007\/b95548"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Eklund P, Villerd J (2010) A survey of hybrid representations of concept lattices in conceptual knowledge processing. In: Kwuida L, Sertkaya B (eds) Proc. 2010 Intl. Conf. FCA, pp 296\u2013311. https:\/\/doi.org\/10.1007\/978-3-642-11928-6","DOI":"10.1007\/978-3-642-11928-6_21"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Eklund PW, Ducrou J, Brawn P (2004) Concept lattices for information visualization: Can novices read line diagrams? In: [25], pp 57\u201373","DOI":"10.1007\/978-3-540-24651-0_7"},{"key":"8_CR28","volume-title":"Show Me the Numbers: Designing Tables and Graphs to Enlighten","author":"S Few","year":"2012","unstructured":"Few S (2012) Show Me the Numbers: Designing Tables and Graphs to Enlighten, 2nd edn. Analytics Press","edition":"2"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Freese R (2004) Automated lattice drawing. In: [25], pp 112\u2013123","DOI":"10.1007\/978-3-030-93278-7"},{"issue":"8","key":"8_CR30","doi-asserted-by":"publisher","first-page":"955","DOI":"10.3217\/jucs-010-08","volume":"10","author":"B Ganter","year":"2004","unstructured":"Ganter B (2004) Conflict avoidance in additive order diagrams. J Univers Comput Sci 10(8):955\u2013966. https:\/\/doi.org\/10.3217\/jucs-010-08","journal-title":"J Univers Comput Sci"},{"key":"8_CR31","first-page":"125","volume":"4","author":"B Ganter","year":"2016","unstructured":"Ganter B, Obiedkov S (2016) Attribute exploration, Springer, chap 4, pp 125\u2013185","journal-title":"Springer, chap"},{"key":"8_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter B, Wille R (1999) Formal Concept Analysis: Mathematical Foundations. Springer"},{"key":"8_CR33","first-page":"270","volume":"6178","author":"B Gaume","year":"2010","unstructured":"Gaume B, Navarro E, Prade H (2010) A parallel between extended Formal Concept Analysis and bipartite graphs analysis. In: Proc. IPMU\u201910, Berlin, Heidelberg, LNCS, vol 6178, pp 270\u2013280","journal-title":"Berlin, Heidelberg, LNCS, vol"},{"issue":"2","key":"8_CR34","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0020-0255(86)90001-0","volume":"40","author":"R Godin","year":"1986","unstructured":"Godin R, Saunders E, Jescei J (1986) Lattice model of browsable data spaces. Information Sciences 40(2):89\u2013116","journal-title":"Information Sciences"},{"issue":"1","key":"8_CR35","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ijinfomgt.2017.08.005","volume":"38","author":"RL Grossman","year":"2018","unstructured":"Grossman RL (2018) A framework for evaluating the analytic maturity of an organization. Intl J Information Management 38(1):45\u201351. https:\/\/doi.org\/10.1016\/j.ijinfomgt.2017.08.005","journal-title":"Intl J Information Management"},{"key":"8_CR36","first-page":"5","volume":"95","author":"Guigues Jl","year":"1986","unstructured":"Guigues Jl, Duquenne V (1986) Familles minimales d\u2019implications informatives d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines 95:5\u201318","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"issue":"2","key":"8_CR37","doi-asserted-by":"publisher","first-page":"163","DOI":"10.32614\/RJ-2017-047","volume":"9","author":"M Hahsler","year":"2017","unstructured":"Hahsler M (2017) arulesViz: Interactive visualization of association rules with R. The R Journal 9(2):163\u2013175","journal-title":"The R Journal"},{"key":"8_CR38","first-page":"317","volume":"87","author":"M Hahsler","year":"2017","unstructured":"Hahsler M, Karpienko R (2017) Visualizing association rules in hierarchical groups. J Bus Econ 87:317\u2013335","journal-title":"J Bus Econ"},{"key":"8_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v014.i15","volume":"14","author":"M Hahsler","year":"2005","unstructured":"Hahsler M, Grun B, Hornik K (2005) arules - a computational environment for mining association rules and frequent item sets. J Stat Software 14:1\u201325","journal-title":"J Stat Software"},{"key":"8_CR40","first-page":"264","volume":"3874","author":"T Hannan","year":"2006","unstructured":"Hannan T, Pogel A (2006) Spring-based lattice drawing highlighting conceptual similarity. In: Proc. 4th Intl. Conf. FCA, LNCS, vol 3874, pp 264\u2013279","journal-title":"FCA, LNCS, vol"},{"key":"8_CR41","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/2945.841119","volume":"6","author":"I Herman","year":"2000","unstructured":"Herman I, Melan\u00e7on G, Marshall MS (2000) Graph visualization and navigation in information visualization: a survey. IEEE Transactions on Visualization and Computer Graphics 6:24\u201343","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"8_CR42","unstructured":"Ignatov DI, Nourine L (eds) (2018) Proc. 2018 Intl. Conf. CLA, vol 2123, CEUR-WS.org"},{"key":"8_CR43","unstructured":"Kriegel F (2013) Visualization of conceptual data with methods of Formal Concept Analysis. PhD thesis, Technische Universitat Dresden"},{"key":"8_CR44","doi-asserted-by":"crossref","unstructured":"Kuznetsov SO, Obiedkov SA (2001) Algorithms for the construction of concept lattices and their diagram graphs. In: [70], pp 289\u2013300","DOI":"10.1007\/3-540-44794-6_24"},{"key":"8_CR45","doi-asserted-by":"crossref","unstructured":"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\u2013408","DOI":"10.1145\/223904.223956"},{"volume-title":"Handbook of Latent Semantic Analysis","year":"2013","key":"8_CR46","unstructured":"Landauer T, McNamara D, Dennis S, Kintsch W (eds) (2013) Handbook of Latent Semantic Analysis. Taylor & Francis"},{"key":"8_CR47","doi-asserted-by":"crossref","unstructured":"Leung KS, Leung CKS, P Irani P, L Carmichael C (2008) WiFIsViz: Effective visualization of frequent itemsets. IEEE Intl Conf Data Mining pp 875\u2013880","DOI":"10.1109\/ICDM.2008.93"},{"key":"8_CR48","unstructured":"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"},{"key":"8_CR49","first-page":"152","volume":"2000","author":"C Lindig","year":"2000","unstructured":"Lindig C (2000) Fast concept analysis. In: Working With Conceptual Structures - Contributions to ICCS 2000, pp 152\u2013161","journal-title":"Working With Conceptual Structures - Contributions to ICCS"},{"key":"8_CR50","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-71618-1_17","volume":"4431","author":"M Maddouri","year":"2007","unstructured":"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\u2013158","journal-title":"Adaptive and Natural Computing Algorithms, Springer, LNCS, vol"},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"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\u2013266. https:\/\/doi.org\/10.1109\/IV.2011.46","DOI":"10.1109\/IV.2011.46"},{"key":"8_CR52","doi-asserted-by":"publisher","unstructured":"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\u2013897. https:\/\/doi.org\/10.1109\/ICDMW30884.2012.41","DOI":"10.1109\/ICDMW30884.2012.41"},{"issue":"4","key":"8_CR53","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1080\/00207160.2011.644275","volume":"89","author":"\u00c1 Mora","year":"2012","unstructured":"Mora \u00c1, Cordero P, Enciso M, Fortes I, Aguilera G (2012) Closure via functional dependence simplification. Int J Comput Math 89(4):510\u2013526","journal-title":"Int J Comput Math"},{"issue":"4","key":"8_CR54","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1080\/03081070902857613","volume":"38","author":"E Nauer","year":"2009","unstructured":"Nauer E, Toussaint Y (2009) CreChainDo: An iterative and interactive web information retrieval system based on lattices. Intl J General Systems 38(4):363\u2013378","journal-title":"Intl J General Systems"},{"issue":"1","key":"8_CR55","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","volume":"185","author":"J Outrata","year":"2012","unstructured":"Outrata J, Vychodil V (2012) Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Information Sciences 185(1):114\u2013127","journal-title":"Information Sciences"},{"key":"8_CR56","unstructured":"Owais S, Gajdo\u0161 P, Sn\u00e1\u0161el V (2005) Usage of genetic algorithm for lattice drawing. In: [8], pp 82\u201391"},{"key":"8_CR57","volume-title":"Probability, Random Variables, and Stochastic Processes","author":"A Papoulis","year":"1984","unstructured":"Papoulis A (1984) Probability, Random Variables, and Stochastic Processes, 2nd edn. McGraw-Hill Series in Electr. Eng., McGraw-Hill","edition":"2"},{"key":"8_CR58","unstructured":"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\u201379"},{"key":"8_CR59","doi-asserted-by":"publisher","unstructured":"Pattison T (2018) Interactive query refinement using Formal Concept Analysis. In: [42], pp 207\u2013218","DOI":"10.1007\/978-3-030-93278-7"},{"key":"8_CR60","unstructured":"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\u201334"},{"key":"8_CR61","doi-asserted-by":"crossref","unstructured":"Pattison T, Ceglar A (2019) Simultaneous, polynomial-time layout of context bigraph and lattice digraph. In: Proc. 15th Intl. Conf. FCA, pp 223\u2013240","DOI":"10.1007\/978-3-030-21462-3_15"},{"key":"8_CR62","doi-asserted-by":"crossref","unstructured":"Pattison T, Ceglar A (2021) Towards interactive transition from AOC poset to concept lattice. In: 2021 Intl. Conf. FCA, to be submitted","DOI":"10.1007\/978-3-030-77867-5_12"},{"key":"8_CR63","unstructured":"Pattison T, Phillips M (2001) View coordination architecture for information visualisation. In: Eades P, Pattison T (eds) Proc. Australian Symposium on Information Visualisation, ACS"},{"key":"8_CR64","doi-asserted-by":"crossref","unstructured":"Pattison T, Weber D, Ceglar A (2014) Enhancing layout and interaction in Formal Concept Analysis. In: IEEE Pacific Visualization Symposium (PacificVis), pp 248\u2013252","DOI":"10.1109\/PacificVis.2014.21"},{"key":"8_CR65","doi-asserted-by":"publisher","unstructured":"Pattison T, Ceglar A, Weber D (2018) Efficient Formal Concept Analysis through recursive context partitioning. In: [42], pp 219\u2013230","DOI":"10.1007\/978-3-030-93278-7"},{"key":"8_CR66","doi-asserted-by":"crossref","unstructured":"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\u2013153","DOI":"10.1007\/978-3-642-14197-3_15"},{"key":"8_CR67","doi-asserted-by":"publisher","first-page":"6601","DOI":"10.1016\/j.eswa.2013.05.007","volume":"40","author":"J Poelmans","year":"2013","unstructured":"Poelmans J, Kuznetsov SO, Ignatov DI, Dedene G (2013) Formal Concept Analysis in knowledge processing: a survey on models and techniques. Expert Systems with Applications 40:6601\u20136623. https:\/\/doi.org\/10.1016\/j.eswa.2013.05.007","journal-title":"Expert Systems with Applications"},{"key":"8_CR68","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/aris.1440400120","volume":"40","author":"U Priss","year":"2006","unstructured":"Priss U (2006) Formal Concept Analysis in Information Science. Annual Review of Information Science and Technology 40:521\u2013543","journal-title":"Annual Review of Information Science and Technology"},{"key":"8_CR69","doi-asserted-by":"publisher","unstructured":"Pulo K, Eades P, Takatsuko M (2003) Smooth structural zooming of h-v inclusion tree layouts. In: Proc. Intl. Conf. Coordinated & Multiple Views in Exploratory Visualization, pp 14\u201325. https:\/\/doi.org\/10.1109\/CMV.2003.1214999","DOI":"10.1109\/CMV.2003.1214999"},{"key":"8_CR70","doi-asserted-by":"crossref","unstructured":"Raedt LD, Siebes A (eds) (2001) PKDD \u201901: Proc. 5th European Conf. Principles of Data Mining and Knowledge Discovery, Springer. https:\/\/doi.org\/10.1007\/3-540-44794-6","DOI":"10.1007\/3-540-44794-6"},{"key":"8_CR71","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-94-017-0697-1_9","volume-title":"Algebras and Orders","author":"I Rival","year":"1993","unstructured":"Rival I (1993) Reading, drawing, and order. In: Rosenberg IG, Sabidussi G (eds) Algebras and Orders, Springer, Dordrecht, Netherlands, pp 359\u2013404"},{"key":"8_CR72","doi-asserted-by":"crossref","unstructured":"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\u201371","DOI":"10.1109\/CMV.2007.20"},{"issue":"5","key":"8_CR73","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/03081079.2017.1349632","volume":"46","author":"E Rodr\u00edguez-Lorenzo","year":"2017","unstructured":"Rodr\u00edguez-Lorenzo E, Adaricheva K, Cordero P, Enciso M, Mora \u00c1 (2017) Formation of the d-basis from implicational systems using simplification logic. Intl J General Systems 46(5):547\u2013568","journal-title":"Intl J General Systems"},{"key":"8_CR74","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2017.12.031","volume":"249","author":"E Rodr\u00edguez-Lorenzo","year":"2018","unstructured":"Rodr\u00edguez-Lorenzo E, Bertet K, Cordero P, Enciso M, Mora \u00c1 (2018) Direct-optimal basis computation by means of the fusion of simplification rules. Discrete Applied Math 249:106\u2013119","journal-title":"Discrete Applied Math"},{"key":"8_CR75","unstructured":"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\u201321"},{"key":"8_CR76","unstructured":"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\u2013284"},{"volume-title":"The Oxford Handbook of Aristotle","year":"2012","key":"8_CR77","unstructured":"Shields C (ed) (2012) The Oxford Handbook of Aristotle. Oxford Univ. Press"},{"issue":"1","key":"8_CR78","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/102377.115768","volume":"11","author":"B Shneiderman","year":"1992","unstructured":"Shneiderman B (1992) Tree visualization with treemaps: a 2-D space-filling approach. ACM Transactions on Graphics 11(1):92\u201399","journal-title":"ACM Transactions on Graphics"},{"key":"8_CR79","unstructured":"Simon P (2014) The Visual Organization: Data Visualization, Big Data, and the Quest for Better Decisions. Harvard Business Review"},{"key":"8_CR80","unstructured":"Stewart I (2004) Galois theory, 3rd edn. Chapman & Hall\/CRC Mathematics"},{"issue":"2","key":"8_CR81","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G Stumme","year":"2002","unstructured":"Stumme G, Taouil R, Bastide Y, Pasquier N, Lakhal L (2002) Computing Iceberg concept lattices with Titanic. Data & Knowledge Eng 42(2):189\u2013222","journal-title":"Data & Knowledge Eng"},{"issue":"18","key":"8_CR82","first-page":"5277","volume":"9","author":"V Sucharitha","year":"2014","unstructured":"Sucharitha V, Subash SR, Prakash P (2014) Visualization of big data: Its tools and challenges. Intl J Applied Eng Res 9(18):5277\u20135290","journal-title":"Intl J Applied Eng Res"},{"issue":"2","key":"8_CR83","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical system structures. IEEE Trans Systems, Man and Cybernetics 11(2):109\u2013125","journal-title":"IEEE Trans Systems, Man and Cybernetics"},{"key":"8_CR84","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11527503_12","volume":"3584","author":"K Techapichetvanich","year":"2008","unstructured":"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\u201395","journal-title":"Advanced Data Mining and Applications, Springer, LNAI, vol"},{"volume-title":"Illuminating the Path: The Research and Development Agenda for Visual Analytics","year":"2005","key":"8_CR85","unstructured":"Thomas JJ, Cook KA (eds) (2005) Illuminating the Path: The Research and Development Agenda for Visual Analytics. IEEE Press"},{"key":"8_CR86","doi-asserted-by":"crossref","unstructured":"Unwin A, Hofmann H, Bernt K (2001) The TwoKey plot for multiple association rules control. In: [70], pp 472\u2013483","DOI":"10.1007\/3-540-44794-6_39"},{"issue":"B","key":"8_CR87","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.tcs.2016.03.018","volume":"658","author":"M Wild","year":"2017","unstructured":"Wild M (2017) The joy of implications, aka pure Horn functions: mainly a survey. Theor Comput Sci 658(B):264\u2013292. https:\/\/doi.org\/10.1016\/j.tcs.2016.03.018","journal-title":"Theor Comput Sci"},{"key":"8_CR88","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered sets","author":"R Wille","year":"1982","unstructured":"Wille R (1982) Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets, Reidel Publishing, Dordrecht\u2013Boston, pp 445\u2013470"},{"key":"8_CR89","doi-asserted-by":"crossref","unstructured":"Wray T, Eklund P (2011) Exploring the information space of cultural collections. In: Valtchev P, J\u00e4schke R (eds) Proc. 9th Intl. Conf. FCA, Springer","DOI":"10.1007\/978-3-642-20514-9_19"},{"key":"8_CR90","unstructured":"Yevtushenko SA (2000) Concept Explorer: a system for data analysis. In: Proc. 7th National Conference on Artificial Intelligence KII-2000, Russia, pp 127\u2013134, in Russian"},{"key":"8_CR91","unstructured":"Yevtushenko SA (2004) Computing and visualizing concept lattices. PhD thesis, Technischen Universit\u00e4t Darmstadt"},{"key":"8_CR92","unstructured":"Zschalig C (2007) An FDP-algorithm for drawing lattices. In: Proc. 2007 Intl. Conf. CLA, CEUR-WS.org, vol 331, pp 58\u201371"}],"container-title":["Complex Data Analytics with Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93278-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T17:04:52Z","timestamp":1656522292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93278-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,8]]},"ISBN":["9783030932770","9783030932787"],"references-count":92,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93278-7_8","relation":{},"subject":[],"published":{"date-parts":[[2021,12,8]]},"assertion":[{"value":"8 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}