Formal concept analysis

From HandWiki
Short description: Method of deriving an ontology

In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties. Each concept in the hierarchy represents the objects sharing some set of properties; and each sub-concept in the hierarchy represents a subset of the objects (as well as a superset of the properties) in the concepts above it. The term was introduced by Rudolf Wille in 1981, and builds on the mathematical theory of lattices and ordered sets that was developed by Garrett Birkhoff and others in the 1930s.

Formal concept analysis finds practical application in fields including data mining, text mining, machine learning, knowledge management, semantic web, software development, chemistry and biology.

Overview and history

The original motivation of formal concept analysis was the search for real-world meaning of mathematical order theory. One such possibility of very general nature is that data tables can be transformed into algebraic structures called complete lattices, and that these can be utilized for data visualization and interpretation. A data table that represents a heterogeneous relation between objects and attributes, tabulating pairs of the form "object g has attribute m", is considered as a basic data type. It is referred to as a formal context. In this theory, a formal concept is defined to be a pair (A, B), where A is a set of objects (called the extent) and B is a set of attributes (the intent) such that

  • the extent A consists of all objects that share the attributes in B, and dually
  • the intent B consists of all attributes shared by the objects in A.

In this way, formal concept analysis formalizes the semantic notions of extension and intension.

The formal concepts of any formal context can—as explained below—be ordered in a hierarchy called more formally the context's "concept lattice". The concept lattice can be graphically visualized as a "line diagram", which then may be helpful for understanding the data. Often however these lattices get too large for visualization. Then the mathematical theory of formal concept analysis may be helpful, e.g., for decomposing the lattice into smaller pieces without information loss, or for embedding it into another structure which is easier to interpret.

The theory in its present form goes back to the early 1980s and a research group led by Rudolf Wille, Bernhard Ganter and Peter Burmeister at the Technische Universität Darmstadt. Its basic mathematical definitions, however, were already introduced in the 1930s by Garrett Birkhoff as part of general lattice theory. Other previous approaches to the same idea arose from various French research groups, but the Darmstadt group normalised the field and systematically worked out both its mathematical theory and its philosophical foundations. The latter refer in particular to Charles S. Peirce, but also to the Port-Royal Logic.

Motivation and philosophical background

In his article "Restructuring Lattice Theory" (1982),[1] initiating formal concept analysis as a mathematical discipline, Wille starts from a discontent with the current lattice theory and pure mathematics in general: The production of theoretical results—often achieved by "elaborate mental gymnastics"—were impressive, but the connections between neighboring domains, even parts of a theory were getting weaker.

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

This aim traces back to the educationalist Hartmut von Hentig, who in 1972 pleaded for restructuring sciences in view of better teaching and in order to make sciences mutually available and more generally (i.e. also without specialized knowledge) critiqueable.[2] Hence, by its origins formal concept analysis aims at interdisciplinarity and democratic control of research.[3]

It corrects the starting point of lattice theory during the development of formal logic in the 19th century. Then—and later in model theory—a concept as unary predicate had been reduced to its extent. Now again, the philosophy of concepts should become less abstract by considering the intent. Hence, formal concept analysis is oriented towards the categories extension and intension of linguistics and classical conceptual logic.[4]

Formal concept analysis aims at the clarity of concepts according to Charles S. Peirce's pragmatic maxim by unfolding observable, elementary properties of the subsumed objects.[3] In his late philosophy, Peirce assumed that logical thinking aims at perceiving reality, by the triade concept, judgement and conclusion. Mathematics is an abstraction of logic, develops patterns of possible realities and therefore may support rational communication. On this background, Wille defines:

The aim and meaning of Formal Concept Analysis as mathematical theory of concepts and concept hierarchies is to support the rational communication of humans by mathematically developing appropriate conceptual structures which can be logically activated.

Example

Line diagram corresponding to the formal context bodies of water shown in the example table

The data in the example is taken from a semantic field study, where different kinds of bodies of water were systematically categorized by their attributes.[5] For the purpose here it has been simplified.

The data table represents a formal context, the line diagram next to it shows its concept lattice. Formal definitions follow below.

Example for a formal context: "bodies of water"
bodies of water attributes
temporary running natural stagnant constant maritime
rowspan="18" Script error: No such module "Vertical header". canal Yes Yes
channel Yes Yes
lagoon Yes Yes Yes Yes
lake Yes Yes Yes
maar Yes Yes Yes
puddle Yes Yes Yes
pond Yes Yes Yes
pool Yes Yes Yes
reservoir Yes Yes
river Yes Yes Yes
rivulet Yes Yes Yes
runnel Yes Yes Yes
sea Yes Yes Yes Yes
stream Yes Yes Yes
tarn Yes Yes Yes
torrent Yes Yes Yes
trickle Yes Yes Yes


The above line diagram consists of circles, connecting line segments, and labels. Circles represent formal concepts. The lines allow to read off the subconcept-superconcept hierarchy. Each object and attribute name is used as a label exactly once in the diagram, with objects below and attributes above concept circles. This is done in a way that an attribute can be reached from an object via an ascending path if and only if the object has the attribute.

In the diagram shown, e.g. the object reservoir has the attributes stagnant and constant, but not the attributes temporary, running, natural, maritime. Accordingly, puddle has exactly the characteristics temporary, stagnant and natural.

The original formal context can be reconstructed from the labelled diagram, as well as the formal concepts. The extent of a concept consists of those objects from which an ascending path leads to the circle representing the concept. The intent consists of those attributes to which there is an ascending path from that concept circle (in the diagram). In this diagram the concept immediately to the left of the label reservoir has the intent stagnant and natural and the extent puddle, maar, lake, pond, tarn, pool, lagoon, and sea.

Formal contexts and concepts

A formal context is a triple K = (G, M, I), where G is a set of objects, M is a set of attributes, and I ⊆ G × M is a binary relation called incidence that expresses which objects have which attributes.[4] For subsets A ⊆ G of objects and subsets B ⊆ M of attributes, one defines two derivation operators as follows:

A′ = {m ∈ M | (g,m) ∈ I for all g ∈ A}, i.e., a set of all attributes shared by all objects from A, and dually
B′ = {g ∈ G | (g,m) ∈ I for all m ∈ B}, i.e., a set of all objects sharing all attributes from B.

Applying either derivation operator and then the other constitutes two closure operators:

A ↦ A′′ = (A′)′ for A ⊆ G (extent closure), and
B ↦ B′′ = (B′)′ for B ⊆ M (intent closure).

The derivation operators define a Galois connection between sets of objects and of attributes. This is why in French a concept lattice is sometimes called a treillis de Galois (Galois lattice).

With these derivation operators, Wille gave an elegant definition of a formal concept: a pair (A,B) is a formal concept of a context (G, M, I) provided that:

A ⊆ G, B ⊆ M, A′ = B, and B′ = A.

Equivalently and more intuitively, (A,B) is a formal concept precisely when:

  • every object in A has every attribute in B,
  • for every object in G that is not in A, there is some attribute in B that the object does not have,
  • for every attribute in M that is not in B, there is some object in A that does not have that attribute.

For computing purposes, a formal context may be naturally represented as a (0,1)-matrix K in which the rows correspond to the objects, the columns correspond to the attributes, and each entry ki,j equals to 1 if "object i has attribute j." In this matrix representation, each formal concept corresponds to a maximal submatrix (not necessarily contiguous) all of whose elements equal 1. It is however misleading to consider a formal context as boolean, because the negated incidence ("object g does not have attribute m") is not concept forming in the same way as defined above. For this reason, the values 1 and 0 or TRUE and FALSE are usually avoided when representing formal contexts, and a symbol like × is used to express incidence.

Concept lattice of a formal context

The concepts (Ai, Bi) of a context K can be (partially) ordered by the inclusion of extents, or, equivalently, by the dual inclusion of intents. An order ≤ on the concepts is defined as follows: for any two concepts (A1, B1) and (A2, B2) of K, we say that (A1, B1) ≤ (A2, B2) precisely when A1 ⊆ A2. Equivalently, (A1, B1) ≤ (A2, B2) whenever B1 ⊇ B2.

In this order, every set of formal concepts has a greatest common subconcept, or meet. Its extent consists of those objects that are common to all extents of the set. Dually, every set of formal concepts has a least common superconcept, the intent of which comprises all attributes which all objects of that set of concepts have.

These meet and join operations satisfy the axioms defining a lattice, in fact a complete lattice. Conversely, it can be shown that every complete lattice is the concept lattice of some formal context (up to isomorphism).

Attribute values and negation

Real-world data is often given in the form of an object-attribute table, where the attributes have "values". Formal concept analysis handles such data by transforming them into the basic type of a ("one-valued") formal context. The method is called conceptual scaling.

The negation of an attribute m is an attribute ¬m, the extent of which is just the complement of the extent of m, i.e., with (¬m)′ = G \ m′. It is in general not assumed that negated attributes are available for concept formation. But pairs of attributes which are negations of each other often naturally occur, for example in contexts derived from conceptual scaling.

For possible negations of formal concepts see the section concept algebras below.

Implications

An implication A → B relates two sets A and B of attributes and expresses that every object possessing each attribute from A also has each attribute from B. When (G,M,I) is a formal context and A, B are subsets of the set M of attributes (i.e., A,B ⊆ M), then the implication A → B is valid if A′ ⊆ B′. For each finite formal context, the set of all valid implications has a canonical basis,[6] an irredundant set of implications from which all valid implications can be derived by the natural inference (Armstrong rules). This is used in attribute exploration, a knowledge acquisition method based on implications.[7]

Arrow relations

Formal concept analysis has elaborate mathematical foundations,[4] making the field versatile. As a basic example we mention the arrow relations, which are simple and easy to compute, but very useful. They are defined as follows: For g ∈ G and m ∈ M let

g ↗ m ⇔ (g, m) ∉ I and if m⊆n′ and m′ ≠ n′ , then (g, n) ∈ I,

and dually

g ↙ m ⇔ (g, m) ∉ I and if g′⊆h′ and g′ ≠ h′ , then (h, m) ∈ I.

Since only non-incident object-attribute pairs can be related, these relations can conveniently be recorded in the table representing a formal context. Many lattice properties can be read off from the arrow relations, including distributivity and several of its generalizations. They also reveal structural information and can be used for determining, e.g., the congruence relations of the lattice.

Extensions of the theory

  • Triadic concept analysis replaces the binary incidence relation between objects and attributes by a ternary relation between objects, attributes, and conditions. An incidence [math]\displaystyle{ (g,m,c) }[/math] then expresses that the object g has the attribute m under the condition c. Although triadic concepts can be defined in analogy to the formal concepts above, the theory of the trilattices formed by them is much less developed than that of concept lattices, and seems to be difficult.[8] Voutsadakis has studied the n-ary case.[9]
  • Fuzzy concept analysis: Extensive work has been done on a fuzzy version of formal concept analysis.[10]
  • Concept algebras: Modelling negation of formal concepts is somewhat problematic because the complement (G \ A, M \ B) of a formal concept (A, B) is in general not a concept. However, since the concept lattice is complete one can consider the join (A, B)Δ of all concepts (C, D) that satisfy C ⊆ G \ A; or dually the meet (A, B)𝛁 of all concepts satisfying D ⊆ M \ B. These two operations are known as weak negation and weak opposition, respectively. This can be expressed in terms of the derivation operators. Weak negation can be written as (A, B)Δ = ((G \ A)″, (G \ A)'), and weak opposition can be written as (A, B)𝛁 = ((M \ B)', (M \ B)″). The concept lattice equipped with the two additional operations Δ and 𝛁 is known as the concept algebra of a context. Concept algebras generalize power sets. Weak negation on a concept lattice L is a weak complementation, i.e. an order-reversing map Δ: L → L which satisfies the axioms xΔΔ ≤ x and (x⋀y) ⋁ (x⋀yΔ) = x. Weak opposition is a dual weak complementation. A (bounded) lattice such as a concept algebra, which is equipped with a weak complementation and a dual weak complementation, is called a weakly dicomplemented lattice. Weakly dicomplemented lattices generalize distributive orthocomplemented lattices, i.e. Boolean algebras.[11][12]

Temporal concept analysis

Temporal concept analysis (TCA) is an extension of Formal Concept Analysis (FCA) aiming at a conceptual description of temporal phenomena. It provides animations in concept lattices obtained from data about changing objects. It offers a general way of understanding change of concrete or abstract objects in continuous, discrete or hybrid space and time. TCA applies conceptual scaling to temporal data bases.[13]

In the simplest case TCA considers objects that change in time like a particle in physics, which, at each time, is at exactly one place. That happens in those temporal data where the attributes 'temporal object' and 'time' together form a key of the data base. Then the state (of a temporal object at a time in a view) is formalized as a certain object concept of the formal context describing the chosen view. In this simple case, a typical visualization of a temporal system is a line diagram of the concept lattice of the view into which trajectories of temporal objects are embedded. [14]

TCA generalizes the above mentioned case by considering temporal data bases with an arbitrary key. That leads to the notion of distributed objects which are at any given time at possibly many places, as for example, a high pressure zone on a weather map. The notions of 'temporal objects', 'time' and 'place' are represented as formal concepts in scales. A state is formalized as a set of object concepts. That leads to a conceptual interpretation of the ideas of particles and waves in physics.[15]

Algorithms and tools

There are a number of simple and fast algorithms for generating formal concepts and for constructing and navigating concept lattices. For a survey, see Kuznetsov and Obiedkov[16] or the book by Ganter and Obiedkov,[7] where also some pseudo-code can be found. Since the number of formal concepts may be exponential in the size of the formal context, the complexity of the algorithms usually is given with respect to the output size. Concept lattices with a few million elements can be handled without problems.

Many FCA software applications are available today.[17] The main purpose of these tools varies from formal context creation to formal concept mining and generating the concepts lattice of a given formal context and the corresponding implications and association rules. Most of these tools are academic open-source applications, such as:

Related analytical techniques

Bicliques

A formal context can naturally be interpreted as a bipartite graph. The formal concepts then correspond to the maximal bicliques in that graph. The mathematical and algorithmic results of formal concept analysis may thus be used for the theory of maximal bicliques. The notion of bipartite dimension (of the complemented bipartite graph) translates[4] to that of Ferrers dimension (of the formal context) and of order dimension (of the concept lattice) and has applications e.g. for Boolean matrix factorization.[24]

Biclustering and multidimensional clustering

Given an object-attribute numerical data-table, the goal of biclustering is to group together some objects having similar values of some attributes. For example, in gene expression data, it is known that genes (objects) may share a common behavior for a subset of biological situations (attributes) only: one should accordingly produce local patterns to characterize biological processes, the latter should possibly overlap, since a gene may be involved in several processes. The same remark applies for recommender systems where one is interested in local patterns characterizing groups of users that strongly share almost the same tastes for a subset of items.[25]

A bicluster in a binary object-attribute data-table is a pair (A,B) consisting of an inclusion-maximal set of objects A and an inclusion-maximal set of attributes B such that almost all objects from A have almost all attributes from B and vice versa.

Of course, formal concepts can be considered as "rigid" biclusters where all objects have all attributes and vice versa. Hence, it is not surprising that some bicluster definitions coming from practice[26] are just definitions of a formal concept.[27] Relaxed FCA-based versions of biclustering and triclustering include OA-biclustering[28] and OAC-triclustering[29] (here O stands for object, A for attribute, C for condition); to generate patterns these methods use prime operators only once being applied to a single entity (e.g. object) or a pair of entities (e.g. attribute-condition), respectively.

A bicluster of similar values in a numerical object-attribute data-table is usually defined[30][31][32] as a pair consisting of an inclusion-maximal set of objects and an inclusion-maximal set of attributes having similar values for the objects. Such a pair can be represented as an inclusion-maximal rectangle in the numerical table, modulo rows and columns permutations. In[27] it was shown that biclusters of similar values correspond to triconcepts of a triadic context where the third dimension is given by a scale that represents numerical attribute values by binary attributes.

This fact can be generalized to n-dimensional case, where n-dimensional clusters of similar values in n-dimensional data are represented by n+1-dimensional concepts. This reduction allows one to use standard definitions and algorithms from multidimensional concept analysis[32][9] for computing multidimensional clusters.

Knowledge spaces

In the theory of knowledge spaces it is assumed that in any knowledge space the family of knowledge states is union-closed. The complements of knowledge states therefore form a closure system and may be represented as the extents of some formal context.

Hands-on experience with formal concept analysis

The formal concept analysis can be used as a qualitative method for data analysis. Since the early beginnings of FCA in the early 1980s, the FCA research group at TU Darmstadt has gained experience from more than 200 projects using the FCA (as of 2005).[33] Including the fields of: medicine and cell biology,[34][35] genetics,[36][37] ecology,[38] software engineering,[39] ontology,[40] information and library sciences,[41][42][43] office administration,[44] law,[45][46] linguistics,[47] political science.[48]

Many more examples are e.g. described in: Formal Concept Analysis. Foundations and Applications,[33] conference papers at regular conferences such as: International Conference on Formal Concept Analysis (ICFCA),[49] Concept Lattices and their Applications (CLA),[50] or International Conference on Conceptual Structures (ICCS).[51]

See also


Notes

  1. ↑ Wille, Rudolf (1982). "Restructuring lattice theory: An approach based on hierarchies of concepts". in Rival, Ivan. Ordered Sets. Proceedings of the NATO Advanced Study Institute held at Banff, Canada, August 28 to September 12, 1981. Nato Science Series C. 83. Springer. pp. 445–470. doi:10.1007/978-94-009-7798-3. ISBN 978-94-009-7800-3. https://link.springer.com/chapter/10.1007/978-3-642-01815-2_23. , reprinted in Ferré, Sébastien; Rudolph, Sebastian, eds (12 May 2009). Formal Concept Analysis: 7th International Conference, ICFCA 2009 Darmstadt, Germany, May 21–24, 2009 Proceedings. Springer. p. 314. ISBN 978-364201814-5. 
  2. ↑ Hentig, von, Hartmut (1972). Magier oder Magister? Über die Einheit der Wissenschaft im Verständigungsprozeß. Klett (1972), Suhrkamp (1974). ISBN 978-3518067079. 
  3. ↑ 3.0 3.1 Wollbold, Johannes (2011). Attribute Exploration of Gene Regulatory Processes (PDF) (PhD). University of Jena. p. 9. arXiv:1204.1995. urn:nbn:de:gbv:27-20120103-132627-0.
  4. ↑ 4.0 4.1 4.2 4.3 Ganter, Bernhard; Wille, Rudolf (1999). Formal Concept Analysis: Mathematical Foundations. Springer. ISBN 3-540-62771-5. 
  5. ↑ Lutzeier, Peter Rolf (1981) (in de), Wort und Feld: wortsemantische Fragestellungen mit besonderer Berücksichtigung des Wortfeldbegriffes: Dissertation, Linguistische Arbeiten 103, Tübingen: Niemeyer, doi:10.1515/9783111678726.fm, OCLC 8205166 
  6. ↑ Guigues, J.L.; Duquenne, V. (1986). "Familles minimales d'implications informatives résultant d'un tableau de données binaires". Mathématiques et Sciences Humaines 95: 5–18. http://www.numdam.org/item/MSH_1986__95__5_0.pdf. 
  7. ↑ 7.0 7.1 Ganter, Bernhard; Obiedkov, Sergei (2016). Conceptual Exploration. Springer. ISBN 978-3-662-49290-1. 
  8. ↑ Wille, R. (1995). "The basic theorem of triadic concept analysis".". Order 12 (2): 149–158. doi:10.1007/BF01108624. 
  9. ↑ 9.0 9.1 Voutsadakis, G. (2002). "Polyadic Concept Analysis". Order 19 (3): 295–304. doi:10.1023/A:1021252203599. https://www.voutsadakis.com/RESEARCH/PUBLISHED/polyadic.pdf. 
  10. ↑ "Formal Concept Analysis and Fuzzy Logic". http://www.glc.us.es/cla2010/slides/tutorialI_Belohlavek.pdf. 
  11. ↑ Wille, Rudolf (2000), "Boolean Concept Logic", in Ganter, B.; Mineau, G. W., ICCS 2000 Conceptual Structures: Logical, Linguistic and Computational Issues, LNAI 1867, Springer, pp. 317–331, ISBN 978-3-540-67859-5 .
  12. ↑ Kwuida, Léonard (2004), Dicomplemented Lattices. A contextual generalization of Boolean algebras, Shaker Verlag, ISBN 978-3-8322-3350-1, http://hsss.slub-dresden.de/documents/1101148726640-2926/1101148726640-2926.pdf 
  13. ↑ Wolff, Karl Erich (2010), "Temporal Relational Semantic Systems", in Croitoru, Madalina; Ferré, Sébastien; Lukose, Dickson, Conceptual Structures: From Information to Intelligence. ICCS 2010. LNAI 6208, Lecture Notes in Artificial Intelligence, 6208, Springer, pp. 165–180, doi:10.1007/978-3-642-14197-3, ISBN 978-3-642-14196-6, https://basepub.dauphine.fr/handle/123456789/12138 .
  14. ↑ Wolff, Karl Erich (2019), "Temporal Concept Analysis with SIENA", in Cristea, Diana; Le Ber, Florence; Missaoui, Rokia et al., Supplementary Proceedings of ICFCA 2019, Conference and Workshops, Springer, pp. 94–99, http://ceur-ws.org/Vol-2378/shortAT12.pdf .
  15. ↑ Wolff, Karl Erich (2004), "'Particles' and 'Waves' as Understood by Temporal Concept Analysis.", in Wolff, Karl Erich; Pfeiffer, Heather D.; Delugach, Harry S., Conceptual Structures at Work. 12th International Conference on Conceptual Structures, ICCS 2004. Huntsville, AL, USA, July 2004, LNAI 3127. Proceedings, Lecture Notes in Artificial Intelligence, Springer, pp. 126–141, doi:10.1007/978-3-540-27769-9_8, ISBN 978-3-540-22392-4 .
  16. ↑ Kuznetsov, S.; Obiedkov, S. (2002). "Comparing Performance of Algorithms for Generating Concept Lattices". Journal of Experimental and Theoretical Artificial Intelligence 14 (2–3): 189–216. doi:10.1080/09528130210164170. 
  17. ↑ One can find a non exhaustive list of FCA tools in the FCA software website: "Formal Concept Analysis Software and Applications". http://www.fcahome.org.uk/fcasoftware.html. 
  18. ↑ "The Concept Explorer". http://conexp.sourceforge.net/. 
  19. ↑ "ToscanaJ: Welcome". http://toscanaj.sourceforge.net/. 
  20. ↑ Boumedjout Lahcen and Leonard Kwuida. "Lattice Miner: A Tool for Concept Lattice Construction and Exploration". In: Supplementary Proceeding of International Conference on Formal concept analysis (ICFCA'10), 2010
  21. ↑ "The Coron System". http://coron.loria.fr/site/index.php. 
  22. ↑ "FcaBedrock Formal Context Creator". 12 June 2014. https://sourceforge.net/projects/fcabedrock/. 
  23. ↑ "GALACTIC GAlois LAttices, Concept Theory, Implicational system and Closures". https://galactic.univ-lr.fr/. 
  24. ↑ Belohlavek, Radim; Vychodil, Vilem (2010). "Discovery of optimal factors in binary data via a novel method of matrix decomposition". Journal of Computer and System Sciences 76 (1): 3–20. doi:10.1016/j.jcss.2009.05.002. https://core.ac.uk/download/pdf/82623547.pdf. 
  25. ↑ Adomavicius, C.; Tuzhilin, A. (2005). "Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions". IEEE Transactions on Knowledge and Data Engineering 17 (6): 734–749. doi:10.1109/TKDE.2005.99. http://homepages.dcc.ufmg.br/~nivio/cursos/ri13/sources/recommender-systems-survey-2005.pdf. 
  26. ↑ Prelic, S.; Bleuler, P.; Zimmermann, A.; Wille, P.; Buhlmann, W.; Gruissem, L.; Hennig, L.; Thiele, E. et al. (2006). "A Systematic Comparison and Evaluation of Biclustering Methods for Gene Expression Data". Bioinformatics 22 (9): 1122–9. doi:10.1093/bioinformatics/btl060. PMID 16500941. https://academic.oup.com/bioinformatics/article/22/9/1122/200492. 
  27. ↑ 27.0 27.1 Kaytoue, M.; Kuznetsov, S.; Macko, J.; Wagner Meira Jr., Napoli A. (2011). "Mining Biclusters of Similar Values with Triadic Concept Analysis". CLA: 175–190. 
  28. ↑ Ignatov, D.; Poelmans, J.; Kuznetsov, S. (2012). "Concept-Based Biclustering for Internet Advertisement". 2012 IEEE 12th International Conference on Data Mining Workshops. pp. 123–130. doi:10.1109/ICDMW.2012.100. ISBN 978-1-4673-5164-5. https://ieeexplore.ieee.org/document/6406432. 
  29. ↑ Ignatov, D.; Gnatyshak, D.; Kuznetsov, S.; Mirkin, B. (2015). "Triadic Formal Concept Analysis and triclustering: searching for optimal patterns". Mach. Learn. 101 (1–3): 271–302. doi:10.1007/s10994-015-5487-y. 
  30. ↑ Pensa, R.G.; Leschi, C.; Besson, J.; Boulicaut, J.-F. (2004). "Assessment of discretization techniques for relevant pattern discovery from gene expression data". in Zaki, M.J.; Morishita, S.; Rigoutsos, I.. Proceedings of the 4th ACM SIGKDD Workshop on Data Mining in Bioinformatics (BIOKDD 2004). pp. 24–30. https://www.cs.rpi.edu/~zaki/Workshops/BIOKDD04/proceedings/4-pensa.pdf. Retrieved 2022-07-20. 
  31. ↑ Besson, J.; Robardet, C.; Raedt, L.D.; Boulicaut, J.-F. (2007). "Mining bi-sets in numerical data". in Dzeroski, S.; Struyf, J.. International Workshop on Knowledge Discovery in Inductive Databases. LNCS. 4747. Springer. pp. 11–23. doi:10.1007/978-3-540-75549-4_2. ISBN 978-3-540-75549-4. https://lirias.kuleuven.be/bitstream/123456789/134532/1/07-kdid-bessonetal.pdf. 
  32. ↑ 32.0 32.1 Cerf, L.; Besson, J.; Robardet, C.; Boulicaut, J.-F. (2009). "Closed patterns meet n-ary relations". ACM Transactions on Knowledge Discovery from Data 3 (1): 1–36. doi:10.1145/1497577.1497580. http://homepages.dcc.ufmg.br/~lcerf/publications/articles/Closed%20Patterns%20Meet%20n-ary%20Relations.pdf. 
  33. ↑ 33.0 33.1 Ganter, Stumme & Wille 2005
  34. ↑ Susanne Motameny; Beatrix Versmold; Rita Schmutzler (2008), Raoul Medina; Sergei Obiedkov, eds., "Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer", Icfca 2008, LNAI (Berlin Heidelberg: Springer) 4933: 229–240, ISBN 978-3-540-78136-3, https://www.springer.com/us/book/9783540781363, retrieved 2016-01-29 
  35. ↑ Dominik Endres; Ruth Adam; Martin A. Giese; Uta Noppeney (2012), Florent Domenach; Dmitry I. Ignatov; Jonas Poelmans, eds., "Understanding the Semantic Structure of Human fMRI Brain Recordings with Formal Concept Analysis", Icfca 2012, LNCS (Berlin Heidelberg: Springer) 7278: 96–111, doi:10.1007/978-3-642-29892-9, ISBN 978-3-642-29891-2, ISSN 0302-9743 
  36. ↑ Denis Ponomaryov; Nadezhda Omelianchuk; Victoria Mironova; Eugene Zalevsky; Nikolay Podkolodny; Eric Mjolsness; Nikolay Kolchanov (2011), Karl Erich Wolff; Dmitry E. Palchunov; Nikolay G. Zagoruiko et al., eds., "From Published Expression and Phenotype Data to Structured Knowledge: The Arabidopsis Gene Net Supplementary Database and Its Applications", Kont 2007, KPP 2007, LNCS (Heidelberg New York: Springer) 6581: 101–120, doi:10.1007/978-3-642-22140-8, ISBN 978-3-642-22139-2, ISSN 0302-9743 
  37. ↑ Mehdi Kaytoue; Sergei Kuznetsov; Amedeo Napoli; Sébastien Duplessis (2011), "Mining gene expression data with pattern structures in formal concept analysis", Information Sciences (Elsevier) 181 (10): 1989–2001, doi:10.1016/j.ins.2010.07.007, https://www.hse.ru/data/2010/11/01/1223500185/InformationSciences.pdf, retrieved 2016-02-13 
  38. ↑ Aurélie Bertaux; Florence Le Ber; Agnès Braud; Michèle Trémolières (2009), Sébastien Ferré; Sebastian Rudolph, eds., "Identifying Ecological Traits: A Concrete FCA-Based Approach", Icfca 2009, LNAI (Berlin Heidelberg: Springer-Verlag) 5548: 224–236, doi:10.1007/978-3-642-01815-2, ISBN 978-3-642-01814-5 
  39. ↑ Gregor Snelting; Frank Tip (1998), "Reengineering class hierarchies using concept analysis", Proceeding. SIGSOFT '98/FSE-6 (New York: ACM) 23 (6): 99–110, doi:10.1145/291252.288273, ISBN 1-58113-108-9, http://dl.acm.org/citation.cfm?doid=288195.288273, retrieved 2016-02-04 
  40. ↑ Gerd Stumme; Alexander Maedche (2001), Universität Leipzig, ed., "FCA-Merge: Bottom-up merging of ontologies", IJCAI (Leipzig): 225–230, http://se-pubs.dbs.uni-leipzig.de/files/Stumme2001FCAMergeBottomupmergingofontologies.pdf, retrieved 2016-02-13 
  41. ↑ Priss, Uta (2006), "Formal Concept Analysis in Information Science", Annual Review of Information Science and Technology (Medford, NJ 09855: Information Today) 40 (1): 521–543, doi:10.1002/aris.1440400120, ISSN 0066-4200, http://www.upriss.org.uk/papers/arist.pdf, retrieved 2016-02-04 
  42. ↑ Jens Illig; Andreas Hotho; Robert Jäschke; Gerd Stumme (2011), Karl Erich Wolff; Dmitry E. Palchunov; Nikolay G. Zagoruiko et al., eds., "A Comparison of Content-Based Tag Recommendations in Folksonomy Systems", Kont 2007, KPP 2007, LNCS (Heidelberg New York: Springer) 6581: 136–149, doi:10.1007/978-3-642-22140-8, ISBN 978-3-642-22139-2, ISSN 0302-9743 
  43. ↑ Claudio Carpineto; Giovanni Romano, eds. (2004), Concept Data Analysis: Theory and Applications, John Wiley & Sons, ISBN 0-470-85055-8, http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470850558.html, retrieved 2016-02-04 
  44. ↑ Richard Cole; Gerd Stumme (2000), Bernhard Ganter; Guy W. Mineau, eds., "CEM – A Conceptual Email Manager", Conceptual Structures: Logical, Linguistic, and Computational Issues, LNAI (Berlin Heidelberg: Springer-Verlag) 1867: 438–452, doi:10.1007/10722280, ISBN 3-540-67859-X 
  45. ↑ Dieter Eschenfelder; Wolfgang Kollewe; Martin Skorsky; Rudolf Wille (2000), Gerd Stumme; Rudolf Wille, eds., "Ein Erkundungssystem zum Baurecht: Methoden der Entwicklung Eines TOSCANA-Systems" (in de), Begriffliche Wissensverarbeitung – Methoden und Anwendungen (Berlin Heidelberg: Springer): 254–272, doi:10.1007/978-3-642-57217-3_12, ISBN 3-540-66391-6 
  46. ↑ Nada Mimouni; Adeline Nazarenko; Sylvie Salotti (2015), Jaume Baixeries; Christian Sacarea; Manuel Ojeda-Aciego, eds., "A Conceptual Approach for Relational IR: Application to Legal Collections", Icfca 2015, LNAI (Heidelberg New York: Springer) 9113: 303–318, doi:10.1007/978-3-319-19545-2_19, ISBN 978-3-319-19544-5, ISSN 0302-9743 
  47. ↑ Priss, Uta, "Linguistic Applications of Formal Concept Analysis", Ganter, Stumme & Wille 2005, pp. 149–160 
  48. ↑ Beate Kohler-Koch; Frank Vogt; Gerhard Stumme; Rudolf Wille (2000), "Normen- und Regelgeleitete internationale Kooperationen: Quoted in: Peter Becker et al. The ToscanaJ Suite for Implementing Conceptual Information Systems" (in de), Begriffliche Wissenverarbeitung – Methoden und Anwendungen (Springer): 325–340, ISBN 978-3-540-66391-1 
  49. ↑ "International Conference on Formal Concept Analysis". dblp. http://dblp.uni-trier.de/db/conf/icfca/index. 
  50. ↑ "CLA: Concept Lattices and Their Applications". CLA. http://cla.inf.upol.cz/papers.html. 
  51. ↑ "International Conferences On Conceptual Structures – Conferences and Workshops". New Mexico State University. http://conceptualstructures.org/confs.htm. 

References

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=Formal_concept_analysis&oldid=3431175"