scientific article; zbMATH DE number 3420808

zbMath0267.06001MaRDI QIDQ5685119

Marc Barbut, Bernard Monjardet

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to biology (92-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01) Order, lattices, ordered algebraic structures (06-XX)

Related Items (only showing first 100 items - show all)

On the correspondence between granular polytomous spaces and polytomous surmising functions ⋮ Fuzzy and rough formal concept analysis: a survey ⋮ Towards an Iterative Classification Based on Concept Lattice ⋮ The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Maximal and stochastic Galois lattices ⋮ The median procedure in the semilattice of orders ⋮ Cayley lattices of finite Coxeter groups are bounded ⋮ What can lattices do for experimental designs? ⋮ Logical handling of uncertain, ontology-based, spatial information ⋮ Representing a concept lattice by a graph ⋮ An incremental concept formation approach for learning from databases ⋮ Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates ⋮ Symbolic objects: Order structure and pyramidal clustering ⋮ On a dependence relation in finite lattices ⋮ The Galois lattice as a hierarchical structure for topological relations ⋮ Relational concept discovery in structured datasets ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ A local approach to concept generation ⋮ On the use of ordered sets in problems of comparison and consensus of classifications ⋮ Representing lattices using many-valued relations ⋮ On permutation lattices ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Recursive decomposition and bounds of the lattice of Moore co-families. ⋮ Relational concept analysis: mining concept lattices from multi-relational data ⋮ Filtral preorders and opportunity inequality ⋮ Concordance between two linear orders: The Spearman and Kendall coefficients revisited ⋮ The spectra of irreducible matrices over completed idempotent semifields ⋮ The lattice of idempotent binary relations ⋮ Dichotomic lattices and local discretization for Galois lattices ⋮ A formal method for inheritance graph hierarchy construction ⋮ Hierarchical analysis: Classification with ordinal object dissimilarities ⋮ Clusteranalyse - Überblick und neuere Entwicklungen ⋮ Complexité de problèmes liés aux graphes sans circuit ⋮ DASACT: a decision aiding software for axiomatic consensus theory ⋮ On the efficient stability computation for the selection of interesting formal concepts ⋮ Metrics on partially ordered sets - a survey ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data ⋮ Plural psychological developmental models: An ordinal generalization of the Guttman scale ⋮ Activating Generalized Fuzzy Implications from Galois Connections ⋮ The median procedure in cluster analysis and social choice theory ⋮ Formal context coverage based on isolated labels: an efficient solution for text feature extraction ⋮ On critical sets of a finite Moore family ⋮ Aggregation of fuzzy preferences: A theoretic Arrow-like approach ⋮ Ordered structures and projections ⋮ Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms ⋮ On the join dependency relation in multinomial lattices ⋮ Cluster structures and collections of Galois closed entity subsets ⋮ Optimal clustering of multipartite graphs ⋮ The conjunctive model of hierarchical classes ⋮ Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices) ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ Combining formal concept analysis and translation to assign frames and semantic role sets to French verbs ⋮ Lattice valuations, medians and majorities ⋮ INDCLAS: a three-way hierarchical classes model ⋮ Unnamed Item ⋮ A framework for incremental generation of closed itemsets ⋮ The SIMCLAS model: simultaneous analysis of coupled binary data matrices with noise heterogeneity between and within data blocks ⋮ Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation ⋮ Possibility theory and formal concept analysis: characterizing independent sub-contexts ⋮ Size of random Galois lattices and number of closed frequent itemsets ⋮ The lattice of embedded subsets ⋮ Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data ⋮ Tucker3 hierarchical classes analysis ⋮ A conjunctive parallelogram model for Pick any/\(n\) data ⋮ Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors ⋮ Generalized domination in closure systems ⋮ Hyperplane arrangements in preference modeling ⋮ Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales ⋮ Characterizations of discrete Sugeno integrals as polynomial functions over distributive lattices ⋮ Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory ⋮ \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality ⋮ Maximal chains of preorders ⋮ Translating between the representations of a ranked convex geometry ⋮ The CHIC model: a global model for coupled binary data ⋮ FCA for software product line representation: mixing configuration and feature relationships in a unique canonical representation ⋮ Going down in (semi)lattices of finite moore families and convex geometries ⋮ On Fuzzy Generalizations of Concept Lattices ⋮ Weighted lattice polynomials ⋮ Far beyond the classical data models: symbolic data analysis ⋮ Arrowian characterizations of latticial federation consensus functions ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ Means on ordered sets ⋮ A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations ⋮ Latticial structures in data analysis. ⋮ Graphes des complements et classes de branches dans un ensemble ordonne fini resultant d'un produit contracte ⋮ Design and comparison of lattices of topological relations for spatial representation and reasoning ⋮ Hypergraphs and Sperner's theorem ⋮ On Galois connections between polytomous knowledge structures and polytomous attributions ⋮ On the comparison of the Spearman and Kendall metrics between linear orders. ⋮ Formal Concept Analysis from the Standpoint of Possibility Theory ⋮ Formal Concept Analysis and Information Retrieval – A Survey ⋮ Totally Balanced Formal Context Representation ⋮ Efficient and binary consensus functions on transitively valued relations ⋮ Two hierarchies associated with each clustering scheme ⋮ Lattice-based and topological representations of binary relations with an application to music ⋮ Efficient polynomial algorithms for distributive lattices ⋮ Tensorial decomposition of concept lattices

This page was built for publication: