Conference
International Conference on Formal Concept Analysis
About: International Conference on Formal Concept Analysis is an academic conference. The conference publishes majorly in the area(s): Formal concept analysis & Lattice Miner. Over the lifetime, 361 publications have been published by the conference receiving 7523 citations.
Topics: Formal concept analysis, Lattice Miner, Context (language use), Map of lattices, Description logic
Papers published on a yearly basis
Papers
More filters
12 May 2009
TL;DR: Restructuring lattice theory is an attempt to reinvigorate connections with the authors' general culture by interpreting the theory as concretely as possible, and in this way to promote better communication between lattice theorists and potential users of lattices theory.
Abstract: Lattice theory today reflects the general Status of current mathematics: there is a rich production of theoretical concepts, results, and developments, many of which are reached by elaborate mental gymnastics; on the other hand, the connections of the theory to its surroundings are getting weaker and weaker, with the result that the theory and even many of its parts become more isolated. Restructuring lattice theory is an attempt to reinvigorate connections with our general culture by interpreting the theory as concretely as possible, and in this way to promote better communication between lattice theorists and potential users of lattice theory.
2,407 citations
15 Mar 2010
TL;DR: Two algorithms for closure systems are described, one to produce all closed sets of a given closure operator and another to construct a minimal family of implications for the ”logic” of a closure system.
Abstract: We describe two algorithms for closure systems. The purpose of the first is to produce all closed sets of a given closure operator. The second constructs a minimal family of implications for the ”logic” of a closure system. These algorithms then are applied to problems in concept analysis: Determining all concepts of a given context and describing the dependencies between attributes. The problem of finding all concepts is equivalent, e.g., to finding all maximal complete bipartite subgraphs of a bipartite graph.
294 citations
23 Feb 2004
TL;DR: The existing ARM methods are discussed, a set of guidelines for the design of novel ones are provided, and some open algorithmic issues on the FCA side are list and two on-line methods computing the minimal generators of a closure system are proposed.
Abstract: Data mining (DM) is the extraction of regularities from raw data, which are further transformed within the wider process of knowledge discovery in databases (KDD) into non-trivial facts intended to support decision making. Formal concept analysis (FCA) offers an appropriate framework for KDD, whereby our focus here is on its potential for DM support. A variety of mining methods powered by FCA have been published and the figures grow steadily, especially in the association rule mining (ARM) field. However, an analysis of current ARM practices suggests the impact of FCA has not reached its limits, i.e., appropriate FCA-based techniques could successfully apply in a larger set of situations. As a first step in the projected FCA expansion, we discuss the existing ARM methods, provide a set of guidelines for the design of novel ones, and list some open algorithmic issues on the FCA side. As an illustration, we propose two on-line methods computing the minimal generators of a closure system.
175 citations
17 Nov 2003
TL;DR: In this paper, the authors present the main ideas of a novel theory for the assessment of a student's knowledge in a topic and give details on a practical implementation in the form of a software system available on the Internet.
Abstract: Adaptations from a book and many scholarly articles are presented. It reviews the main ideas of a novel theory for the assessment of a student's knowledge in a topic and gives details on a practical implementation in the form of a software system available on the Internet. The basic concept of the theory is the 'knowledge state,' which is the complete set of problems that an individual is capable of solving in a particular topic, such as elementary algebra. The task of the assessor consists in uncovering the particular state of the student being assessed. Even though the number of knowledge states for a topic may exceed several hundred thousand, these large numbers are well within the capacity of current home or school computers. The result of an assessment consists in two short lists of problems, which may be labelled: 'what the student can do' and 'what the student is ready to learn'. In the most important applications of the theory, these two lists specify the exact knowledge state of the individual being assessed.
172 citations
23 Feb 2004
TL;DR: An incremental concept lattice construction algorithm, called AddIntent, was proposed in this paper for most types of contexts and was close to the most efficient algorithm in other cases, and the current best estimate for the algorithm's upper bound complexity is O(L||G|2 max(|g′|)).
Abstract: An incremental concept lattice construction algorithm, called AddIntent, is proposed. In experimental comparison, AddIntent outperformed a selection of other published algorithms for most types of contexts and was close to the most efficient algorithm in other cases. The current best estimate for the algorithm’s upper bound complexity to construct a concept lattice L whose context has a set of objects G, each of which possesses at most max(|g′|) attributes, is O(|L||G|2 max(|g′|)).
156 citations