Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts

By R. Wille. International Conference on Formal Concept Analysis, 2009

2,113 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Sentiment analysis algorithms and applications: A survey (2014, methodology): “FCA was proposed by Wille [99] as a mathematical approach used for structuring, analyzing and visualizing data, based on a notion of duality called Galois connection [100].”
Discovery of optimal factors in binary data via a novel method of matrix decomposition (2010, unknown): “for 〈C1, D1〉, 〈C2, D2〉 ∈ B(X, Y , I), B(X, Y , I) happens to be a complete lattice, so-called concept lattice associated to 〈X, Y , I〉 [9,32].”
Exploring Partial Order of European Countries (2007, background): “This practical rule stems from a fundamental mathematical theorem on concept lattices ( Wille 1982 ).”
Rowmotion in slow motion (2017, methodology): “†Similar ideas appeared after [40] in the work of Wille under the names ‘concept lattices’ and ‘contexts’ and have been used in the study of ‘Formal Concept Analysis’ [69].”
Concept learning via granular computing: A cognitive viewpoint (2014, background): “By this means, the obtained concept structure often forms a complete lattice no matter what kinds of meanings we give to the concepts, and hence some scholars from the community of formal concept analysis [42] called it certain concept lattice instead.”