- Table View
- List View
Formal Concept Analysis: 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings (Lecture Notes in Computer Science #12733)
by Agnès Braud Aleksey Buzmakov Tom Hanika Florence Le BerThis book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021. The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length. The research part of this volume is divided in five different sections. First, "Theory" contains compiled works that discuss advances on theoretical aspects of FCA. Second, the section "Rules" consists of contributions devoted to implications and association rules. The third section "Methods and Applications" is composed of results that are concerned with new algorithms and their applications. "Exploration and Visualization" introduces different approaches to data exploration.
Formal Concept Analysis: 11th International Conference, ICFCA 2013, Dresden, Germany, May 21-24, 2013, Proceedings (Lecture Notes in Computer Science #7880)
by Peggy Cellier Felix Distel Bernhard GanterThis book constitutes the refereed proceedings of the 11th International Conference on Formal Concept Analysis, ICFCA 2013, held in Dresden, Germany, in May 2013. The 15 regular papers presented in this volume were carefully reviewed and selected from 46 submissions. The papers present current research from a thriving theoretical community and a rapidly expanding range of applications in information and knowledge processing including data visualization and analysis (mining), knowledge management, as well as Web semantics, and software engineering. In addition the book contains a reprint of the first publication in english describing the seminal stem-base construction by Guigues and Duquenne; and a position paper pointing out potential future applications of FCA.
Formal Concept Analysis: 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings (Lecture Notes in Computer Science #11511)
by Diana Cristea Florence Le Ber Baris SertkayaThis book constitutes the proceedings of the 15th International Conference on Formal Concept Analysis, ICFCA 2019, held in Frankfurt am Main, Germany, in June 2019.The 15 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 36 submissions. The book also contains four invited contributions in full paper length. The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.
Formal Concept Analysis: 10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings (Lecture Notes in Computer Science #7278)
by Florent Domenach Dmitry Ignatov Jonas PoelmansThis book constitutes the refereed proceedings of the 10th International Conference on Formal Concept Analysis, ICFCA 2012, held in Leuven, Belgium in May 2012. The 20 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 68 submissions. The topics covered in this volume range from recent advances in machine learning and data mining; mining terrorist networks and revealing criminals; concept-based process mining; to scalability issues in FCA and rough sets.
Formal Concept Analysis: 17th International Conference, ICFCA 2023, Kassel, Germany, July 17–21, 2023, Proceedings (Lecture Notes in Computer Science #13934)
by Dominik Dürrschnabel Domingo López RodríguezThis book constitutes the proceedings of the 17th International Conference on Formal Concept Analysis, ICFCA 2023, which took place in Kassel, Germany, in July 2023.The 13 full papers presented in this volume were carefully reviewed and selected from 19 submissions. The International Conference on Formal Concept Analysis serves as a platform for researchers from FCA and related disciplines to showcase and exchange their research findings. The papers are organized in two topical sections, first "Theory" and second "Applications and Visualization".
Formal Concept Analysis: 7th International Conference, ICFCA 2009 Darmstadt, Germany, May 21-24, 2009 Proceedings (Lecture Notes in Computer Science #5548)
by Sébastien Ferré Sebastian RudolphThe discipline of formal concept analysis (FCA) is concerned with the form- ization of concepts and conceptual thinking. Built on the solid foundation of lattice and order theory, FCA is ?rst and foremost a mathematical discipline. However,its motivation andguiding principles arebasedon strongphilosophical underpinnings. In practice, FCA provides a powerful framework for the qua- tative, formal analysis of data, as demonstrated by numerous applications in diverse areas. Likewise, it emphasizes the aspect of human-centered information processing by employing visualization techniques capable of revealing inherent structure in data in an intuitively graspable way. FCA thereby contributes to structuring and navigating the ever-growing amount of information available in our evolving information society and supports the process of turning data into information and ultimately into knowledge. In response to an expanding FCA community, the International Conference on Formal Concept Analysis (ICFCA) was established to provide an annual opportunity for the exchange of ideas. Previous ICFCA conferences were held in Darmstadt (2003), Sydney (2004), Lens (2005), Dresden (2006), Clermont- Ferrand (2007), as well as Montreal (2008) and are evidence of vivid ongoing interest and activities in FCA theory and applications. ICFCA 2009 took place during May 21–24 at the University of Applied S- ences in Darmstadt. Beyond serving as a host of the very ?rst ICFCA in 2003, Darmstadt can be seen as the birthplace of FCA itself, where this discipline was introduced in the early 1980s and elaborated over the subsequent decades.
Formal Concept Analysis: Foundations and Applications (Lecture Notes in Computer Science #3626)
by Bernhard Ganter Gerd Stumme Rudolf WilleFormal concept analysis has been developed as a field of applied mathematics based on the mathematization of concept and concept hierarchy. It thereby allows us to mathematically represent, analyze, and construct conceptual structures. The formal concept analysis approach has been proven successful in a wide range of application fields. This book constitutes a comprehensive and systematic presentation of the state of the art of formal concept analysis and its applications. The first part of the book is devoted to foundational and methodological topics. The contributions in the second part demonstrate how formal concept analysis is successfully used outside of mathematics, in linguistics, text retrieval, association rule mining, data analysis, and economics. The third part presents applications in software engineering.
Formal Concept Analysis: Mathematical Foundations
by Bernhard Ganter Rudolf WilleThis first textbook on formal concept analysis gives a systematic presentation of the mathematical foundations and their relations to applications in computer science, especially in data analysis and knowledge processing. Above all, it presents graphical methods for representing conceptual systems that have proved themselves in communicating knowledge. The mathematical foundations are treated thoroughly and are illuminated by means of numerous examples, making the basic theory readily accessible in compact form.
Formal Concept Analysis: 12th International Conference, ICFCA 2014, Cluj-Napoca, Romania , June 10-13, 2014. Proceedings (Lecture Notes in Computer Science #8478)
by Cynthia Vera Glodeanu Mehdi Kaytoue Christian SacareaThis book constitutes the refereed proceedings of the 12th International Conference on Formal Concept Analysis, ICFCA 2014, held in Cluj-Napoca, Romania, in June 2014. The 16 regular papers presented together with 3 invited talks were carefully reviewed and selected from 39 submissions. The papers in this volume cover a rich range of FCA aspects, such as theory, enhanced FCA. Knowledge discovery and knowledge spaces, as well as methods and applications. In addition the book contains a reprint of the first publication "Sub direct decomposition of concept lattices" by Rudolf Wille.
Formal Concept Analysis: Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings (Lecture Notes in Computer Science #3403)
by Robert Godin Bernhard GanterThis volume contains the Proceedings of ICFCA 2005, the 3rd International Conference on Formal Concept Analysis. The ICFCA conference series aims to be the premier forum for the publication of advances in applied lattice and order theory, and in particular scienti?c advances related to formal concept analysis. Formal concept analysis is a ?eld of applied mathematics with its mat- matical root in order theory, in particular in the theory of complete lattices. Researchers had long been aware of the fact that these ?elds have many - tential applications. Formal concept analysis emerged in the 1980s from e?orts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathe- tization of concept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical com- nity and an increasing number of applications in data and knowledge processing, including data visualization, information retrieval, machine learning, data an- ysis and knowledge management. ICFCA2005re?ectedbothpracticalbene?tsandprogressinthefoundational theory of formal concept analysis. Algorithmic aspects were discussed as well as e?orts to broaden the ?eld. All regular papers appearing in this volume were refereed by at least two, in most cases three independent reviewers. The ?nal decision to accept the papers was arbitrated by the Program Chairs based on the referee reports. It was the involvement of the Program Committee and the Editorial Board that ensured the scienti?c quality of these proceedings.
Formal Concept Analysis: 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings (Lecture Notes in Computer Science #10308)
by Karell Bertet, Daniel Borchmann, Peggy Cellier and Sébastien FerréThis book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017. The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contribution and a historical paper translated from German and originally published in “Die Klassifkation und ihr Umfeld”, edited by P. O. Degens, H. J. Hermes, and O. Opitz, Indeks-Verlag, Frankfurt, 1986.The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.
Formal Concept Analysis: 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings (Lecture Notes in Computer Science #4390)
by Sergei O. Kuznetsov Stefan SchmidtThis book constitutes the refereed proceedings of the 5th International Conference on Formal Concept Analysis, ICFCA 2007, held in Clermont-Ferrand, France in February 2007. The 19 revised full papers presented together with 1 invited lecture comprise state of the art research from foundational to applied lattice theory and related fields, all of which involve methods and techniques of formal concept analysis.
Formal Concept Analysis: 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010, Procedings (Lecture Notes in Computer Science #5986)
by Léonard Kwuida Baris SertkayaThis volume contains selected papers presented at ICFCA 2010, the 8th Int- national Conference on Formal Concept Analysis. The ICFCA conference series aims to be the prime forum for dissemination of advances in applied lattice and order theory, and in particular advances in theory and applications of Formal Concept Analysis. Formal Concept Analysis (FCA) is a ?eld of applied mathematics with its mathematical root in order theory, in particular the theory of complete lattices. Researchershadlongbeenawareofthefactthatthese?eldshavemanypotential applications.FCAemergedinthe1980sfrome?ortstorestructurelattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathematical formalization of c- cept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical community and an - creasingnumberofapplicationsindataandknowledgeprocessingincludingdata visualization, information retrieval, machine learning, sofware engineering, data analysis, data mining in Web 2.0, analysis of social networks, concept graphs, contextual logic and description logics. ICFCA 2010 took place during March 15–18, 2010 in Agadir, Morocco. We received 37 high-quality submissions out of which 17 were chosen as regular papers in these proceedings after a competitive selection process. Less mature works that were still considered valuable for discussion at the conference were collected in the supplementary proceedings. The papers in the present volume coveradvancesinvariousaspectsofFCArangingfromitstheoreticalfoundations to its applications in numerous other ?elds. In addition to the regular papers, thisvolumealsocontainsfourkeynotepapersarisingfromtheseveninvitedtalks given at the conference. We are also delighted to include a reprint of Bernhard Ganter’sseminalpaper on hiswell-knownalgorithmfor enumerating closedsets.
Formal Concept Analysis: 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings (Lecture Notes in Computer Science #4933)
by Raoul Medina Sergei ObiedkovFormal Concept Analysis (FCA) is a mathematical theory of concepts and c- ceptualhierarchyleadingtomethodsforconceptuallyanalyzingdataandkno- edge. The theoryitselfstronglyreliesonorderandlatticetheory,whichhasbeen studied by mathematicians over decades. FCA proved itself highly relevant in several applications from the beginning, and, over the last years, the range of applicationshaskeptgrowing. The mainreasonfor this comesfromthe fact that our modern society has turned into an “information” society. After years and years of using computers, companies realized they had stored gigantic amounts of data. Then, they realized that this data, just rough information for them, might become a real treasure if turned into knowledge. FCA is particularly well suited for this purpose. From relational data, FCA can extract implications, - pendencies, concepts and hierarchies of concepts, and thus capture part of the knowledge hidden in the data. The ICFCA conference series gathers researchers from all over the world, being the main forum to present new results in FCA and related ?elds. These results range from theoretical novelties to advances in FCA-related algorithmic issues, as well as application domains of FCA. ICFCA 2008 was in the same vein as its predecessors: high-quality papers and presentations, the place of real debate and exchange of ideas. ICFCA 2008 contributed to strengthening the links between theory and applications. The high quality of the presentations was the result of the remarkable work of the authors and the reviewers. We wish to thank the reviewers for all their valuable comments, which helped the authors to improve their presentations.
Formal Concept Analysis: 4th International Conference, ICFCA 2006, Dresden, Germany, Feburary 13-17, 2006, Proceedings (Lecture Notes in Computer Science #3874)
by Rokia Missaoui Jürg SchmidThis book constitutes the refereed proceedings of the 4th International Conference on Formal Concept Analysis, held in February 2006. The 17 revised full papers presented together with four invited papers were carefully reviewed and selected for inclusion in the book. The papers show advances in applied lattice and order theory and in particular scientific advances related to formal concept analysis and its practical applications: data and knowledge processing including data visualization, information retrieval, machine learning, data analysis and knowledge management.
Formal Concept Analysis: 9th International Conference, ICFCA 2011, Nicosia, Cyprus, May 2-6, 2011, Proceedings (Lecture Notes in Computer Science #6628)
by Petko Valtchev Robert JäschkeThis book constitutes the refereed proceedings of the 9th International Conference on Formal Concept Analysis, ICFCA 2011, held in Nicosia, Cyprus, in May 2011. The 16 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 49 submissions. The central theme was the mathematical formalization of concept and conceptual hierarchy. The field has developed into a constantly growing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including disciplines such as data visualization, information retrieval, machine learning, software engineering, data analysis, data mining, social networks analysis, etc.
Formal Concept Analysis of Social Networks (Lecture Notes in Social Networks)
by Rokia Missaoui Sergei O. Kuznetsov Sergei ObiedkovThe book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.The book presents contributions to the following areas: acquisition of terminological knowledge from social networks, knowledge communities, individuality computation, other types of FCA-based analysis of bipartite graphs (two-mode networks), multimodal clustering, community detection and description in one-mode and multi-mode networks, adaptation of the dual-projection approach to weighted bipartite graphs, extensions to the Kleinberg's HITS algorithm as well as attributed graph analysis.
Formal Correctness of Security Protocols (Information Security and Cryptography)
by Giampaolo BellaThe author investigates proofs of correctness of realistic security protocols in a formal, intuitive setting. The protocols examined include Kerberos versions, smartcard protocols, non-repudiation protocols, and certified email protocols. The method of analysis turns out to be both powerful and flexible. This research advances significant extensions to the method of analysis, while the findings on the protocols analysed are novel and illuminating.
Formal Description Techniques and Protocol Specification, Testing and Verification: FORTE XI/PSTV XVIII’98 IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII) 3–6 November 1998, Paris, France (IFIP Advances in Information and Communication Technology #6)
by Stan Budkowski Ana Cavalli Elie NajmFormal Description Techniques and Protocol Specification, Testing and Verification addresses formal description techniques (FDTs) applicable to distributed systems and communication protocols. It aims to present the state of the art in theory, application, tools and industrialization of FDTs. Among the important features presented are: FDT-based system and protocol engineering; FDT-application to distributed systems; Protocol engineering; Practical experience and case studies. Formal Description Techniques and Protocol Specification, Testing and Verification comprises the proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification, sponsored by the International Federation for Information Processing, held in November 1998, Paris, France. Formal Description Techniques and Protocol Specification, Testing and Verification is suitable as a secondary text for a graduate-level course on Distributed Systems or Communications, and as a reference for researchers and practitioners in industry.
Formal Description Techniques and Protocol Specification, Testing and Verification: FORTE X / PSTV XVII ’97 (IFIP Advances in Information and Communication Technology)
by Atsushi Togashi Tadanori Mizuno Norio Shiratori Teruo HigashinoFORTE/PSTV '97 addresses Formal Description Techniques (FDTs) applicable to Distributed Systems and Communication Protocols (such as Estelle, LOTOS, SDL, ASN.1, TTCN, Z, Automata, Process Algebra, Logic). The conference is a forum for presentation of the state-of-the-art in theory, application, tools and industrialization of FDTs, and provides an excellent orientation for newcomers.
Formal Description Techniques, IV: Proceedings of the IFIP TC6/WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols, FORTE '91, Sydney, Australia, 19-22 November 1991 (IFIP Transactions C: Communication Systems #Volume 2)
by K. R. Parker G. A. RoseFormality is becoming accepted as essential in the development of complex systems such as multi-layer communications protocols and distributed systems. Formality is mandatory for mathematical verification, a procedure being imposed on safety-critical system development. Standard documents are also becoming increasingly formalised in order to capture notions precisely and unambiguously. This FORTE '91 proceedings volume has focussed on the standardised languages SDL, Estelle and LOTOS while, as with earlier conferences, remaining open to other notations and techniques, thus encouraging the continuous evolution of formal techniques. This useful volume contains 29 submitted papers, three invited papers, four industry reports, and four tool reports organised to correspond with the conference sessions.
Formal Description Techniques IX: Theory, application and tools (IFIP Advances in Information and Communication Technology)
by R. Gotzhein J. BrederekeThis book is the combined proceedings of the latest IFIP Formal Description Techniques (FDTs) and Protocol Specification, Testing and Verification (PSTV) series. It addresses FDTs applicable to communication protocols and distributed systems, with special emphasis on standardised FDTs. It features state-of-the-art in theory, application, tools and industrialisation of formal description.
Formal Description Techniques VII (IFIP Advances in Information and Communication Technology)
by D. Hogrefe S. LeueThis book presents the latest research in formal techniques for distributed systems, including material on theory, applications, tools and industrial usage of formal techniques.
Formal Description Techniques VIII (IFIP Advances in Information and Communication Technology)
by Gregor Von Bochmann Rachida Dssouli Omar RafiqThis volume contains the latest worldwide research results on formal description techniques applicable to telecommunications, covering their theoretical foundations, industrial applications and practical usage. The book presents the selected proceedings of the eighth International Conference on Formal Description Techniques, arranged by the International Federation for Information Processing and held in Montreal, Canada, October 1995.
Formal Development of a Network-Centric RTOS: Software Engineering for Reliable Embedded Systems
by Eric Verhulst Raymond T. Boute José Miguel Faria Bernhard H.C. Sputh Vitaliy MezhuyevMany systems, devices and appliances used routinely in everyday life, ranging from cell phones to cars, contain significant amounts of software that is not directly visible to the user and is therefore called "embedded". For coordinating the various software components and allowing them to communicate with each other, support software is needed, called an operating system (OS). Because embedded software must function in real time (RT), a RTOS is needed. This book describes a formally developed, network-centric Real-Time Operating System, OpenComRTOS. One of the first in its kind, OpenComRTOS was originally developed to verify the usefulness of formal methods in the context of embedded software engineering. Using the formal methods described in this book produces results that are more reliable while delivering higher performance. The result is a unique real-time concurrent programming system that supports heterogeneous systems with just 5 Kbytes/node. It is compatible with safety related engineering standards, such as IEC61508.