How Fuzzy FCA and Pattern Structures are connected?

International audienceFCA is a mathematical formalism having many applicationsin data mining and knowledge discovery. Originally it deals with binarydata tables. However, there is a number of extensions that enrich standard FCA. In this paper we consider two important extensions: fuzzyFCA and pattern structures, and discuss the relation between them. Inparticular we introduce a scaling procedure that enables representing afuzzy context as a pattern structure

On Scaling of Fuzzy FCA to Pattern Structures

International audienceFCA is a mathematical formalism having many applications in data mining and knowledge discovery. Originally it deals with binary data tables. However, there is a number of extensions that enrich standard FCA. In this paper we consider two important extensions: fuzzy FCA and pattern structures, and discuss the relation between them. In particular we introduce a scaling procedure that enables representing a fuzzy context as a pattern structure. Studying the relation between different extensions of FCA is of high importance, since it allows migrating methods from one extension to another. Moreover, it allows for more simple implementation of different extensions within a software

Proceedings of the 5th International Workshop "What can FCA do for Artificial Intelligence?", FCA4AI 2016(co-located with ECAI 2016, The Hague, Netherlands, August 30th 2016)

International audienceThese are the proceedings of the fifth edition of the FCA4AI workshop (http://www.fca4ai.hse.ru/). Formal Concept Analysis (FCA) is a mathematically well-founded theory aimed at data analysis and classification that can be used for many purposes, especially for Artificial Intelligence (AI) needs. The objective of the FCA4AI workshop is to investigate two main main issues: how can FCA support various AI activities (knowledge discovery, knowledge representation and reasoning, learning, data mining, NLP, information retrieval), and how can FCA be extended in order to help AI researchers to solve new and complex problems in their domain. Accordingly, topics of interest are related to the following: (i) Extensions of FCA for AI: pattern structures, projections, abstractions. (ii) Knowledge discovery based on FCA: classification, data mining, pattern mining, functional dependencies, biclustering, stability, visualization. (iii) Knowledge processing based on concept lattices: modeling, representation, reasoning. (iv) Application domains: natural language processing, information retrieval, recommendation, mining of web of data and of social networks, etc

The Foundation of Pattern Structures and their Applications

This thesis is divided into a theoretical part, aimed at developing statements around the newly introduced concept of pattern morphisms, and a practical part, where we present use cases of pattern structures. A first insight of our work clarifies the facts on projections of pattern structures. We discovered that a projection of a pattern structure does not always lead again to a pattern structure. A solution to this problem, and one of the most important points of this thesis, is the introduction of pattern morphisms in Chapter4. Pattern morphisms make it possible to describe relationships between pattern structures, and thus enable a deeper understanding of pattern structures in general. They also provide the means to describe projections of pattern structures that lead to pattern structures again. In Chapter5 and Chapter6, we looked at the impact of morphisms between pattern structures on concept lattices and on their representations and thus clarified the theoretical background of existing research in this field. The application part reveals that random forests can be described through pattern structures, which constitutes another central achievement of our work. In order to demonstrate the practical relevance of our findings, we included a use case where this finding is used to build an algorithm that solves a real world classification problem of red wines. The prediction accuracy of the random forest is better, but the high interpretability makes our algorithm valuable. Another approach to the red wine classification problem is presented in Chapter 8, where, starting from an elementary pattern structure, we built a classification model that yielded good results

Exploration of Emotion Modelling Through Fuzzy Logic

This work outlines a programme of research tasked with the exploration of representing psychologically grounded theories of emotion through fuzzy logic systems. It presents an introduction to the specific goals of the project, followed by an overview of the wider, multi-disciplinary field of emotion representation. Two emotion theories are explored in detail. One, rooted in behaviourism, proposed by J. R. Millenson in 1967; the other, the Geneva Emotion Wheel proposed by K. R. Scherer in 2005. Each of these theories is independently abstracted mathematically, and represented in terms of both type-1 and type-2 fuzzy logic systems. Six potential implementations of these systems are presented. Of these, five are tested within this report. The results of these tests are analysed and discussed in the context of both computational behaviour and psychological analogue. There follows a critical review where the effectiveness of the different implementations and models is considered, informed by both testing results and the psychology upon which they are based. A prototype of one implementation applied to govern the behaviour of an agent in a predator-prey scenario is included. Discussion of this prototype includes examples of how the implementation was practically applied to the environment, and an assessment of the behaviours of the agent in testing. The work concludes with an overview of the thesis, including discussion of the results of the project and future avenues of research related to the completed work. The contributions of the thesis are explicitly outlined: the research of pre-existing, psychologically grounded models of emotional state suitable for computational representation; construction of mathematical representations of two models of emotion, using both type-1 and type-2 fuzzy logic; and, the presentation of five computational implementations of those representations, of which four are explicitly tested, compared and critically reviewed.EPSRC DT

Emergent Design

Explorations in Systems Phenomenology in Relation to Ontology, Hermeneutics and the Meta-dialectics of Design SYNOPSIS A Phenomenological Analysis of Emergent Design is performed based on the foundations of General Schemas Theory. The concept of Sign Engineering is explored in terms of Hermeneutics, Dialectics, and Ontology in order to define Emergent Systems and Metasystems Engineering based on the concept of Meta-dialectics. ABSTRACT Phenomenology, Ontology, Hermeneutics, and Dialectics will dominate our inquiry into the nature of the Emergent Design of the System and its inverse dual, the Meta-system. This is an speculative dissertation that attempts to produce a philosophical, mathematical, and theoretical view of the nature of Systems Engineering Design. Emergent System Design, i.e., the design of yet unheard of and/or hitherto non-existent Systems and Metasystems is the focus. This study is a frontal assault on the hard problem of explaining how Engineering produces new things, rather than a repetition or reordering of concepts that already exist. In this work the philosophies of E. Husserl, A. Gurwitsch, M. Heidegger, J. Derrida, G. Deleuze, A. Badiou, G. Hegel, I. Kant and other Continental Philosophers are brought to bear on different aspects of how new technological systems come into existence through the midwifery of Systems Engineering. Sign Engineering is singled out as the most important aspect of Systems Engineering. We will build on the work of Pieter Wisse and extend his theory of Sign Engineering to define Meta-dialectics in the form of Quadralectics and then Pentalectics. Along the way the various ontological levels of Being are explored in conjunction with the discovery that the Quadralectic is related to the possibility of design primarily at the Third Meta-level of Being, called Hyper Being. Design Process is dependent upon the emergent possibilities that appear in Hyper Being. Hyper Being, termed by Heidegger as Being (Being crossed-out) and termed by Derrida as Differance, also appears as the widest space within the Design Field at the third meta-level of Being and therefore provides the most leverage that is needed to produce emergent effects. Hyper Being is where possibilities appear within our worldview. Possibility is necessary for emergent events to occur. Hyper Being possibilities are extended by Wild Being propensities to allow the embodiment of new things. We discuss how this philosophical background relates to meta-methods such as the Gurevich Abstract State Machine and the Wisse Metapattern methods, as well as real-time architectural design methods as described in the Integral Software Engineering Methodology. One aim of this research is to find the foundation for extending the ISEM methodology to become a general purpose Systems Design Methodology. Our purpose is also to bring these philosophical considerations into the practical realm by examining P. Bourdieu’s ideas on the relationship between theoretical and practical reason and M. de Certeau’s ideas on practice. The relationship between design and implementation is seen in terms of the Set/Mass conceptual opposition. General Schemas Theory is used as a way of critiquing the dependence of Set based mathematics as a basis for Design. The dissertation delineates a new foundation for Systems Engineering as Emergent Engineering based on General Schemas Theory, and provides an advanced theory of Design based on the understanding of the meta-levels of Being, particularly focusing upon the relationship between Hyper Being and Wild Being in the context of Pure and Process Being

Combining SOA and BPM Technologies for Cross-System Process Automation

This paper summarizes the results of an industry case study that introduced a cross-system business process automation solution based on a combination of SOA and BPM standard technologies (i.e., BPMN, BPEL, WSDL). Besides discussing major weaknesses of the existing, custom-built, solution and comparing them against experiences with the developed prototype, the paper presents a course of action for transforming the current solution into the proposed solution. This includes a general approach, consisting of four distinct steps, as well as specific action items that are to be performed for every step. The discussion also covers language and tool support and challenges arising from the transformation