Valuations and closure operators on finite lattices

DOI10.1016/J.DAM.2010.11.022MaRDI QIDQ548273zbMATH OpenOpenAlexFDO

Authors Léonard Kwuida, Stefan E. Schmidt

Publication date 28 June 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2010.11.022

zbMATH Keywords

valuationsclosure operatorsgeneralized measures on finite latticesmodular dimensionqualitative data analysisquantitative data analysis

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Structure and representation theory of distributive lattices (06D05)

Recommendations

• On rank functions of lattices
• scientific article; zbMATH DE number 1154190
• A note on the modularization of lattices
• A note on supermodular sublattices in finite relatively complemented lattices
• The core of finite lattices

Cites work

• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 3771669 (Why is no real title available?)
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1508964 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 2168560 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• A note on measure functions in a lattice
• Belief functions on lattices
• Combinatorics. The Rota way
• Computing iceberg concept lattices with Titanic
• Generating a condensed representation for association rules
• Metrics on partially ordered sets - a survey
• Modeling Decisions for Artificial Intelligence
• Rough approximation quality revisited
• Rough set theory and granular computing
• Rudiments of rough sets
• Semimodular Functions and Combinatorial Geometries
• The modern algebra of information retrieval

Cited in

(4)

• Robust optimization with scenarios using belief functions
• Classes of valuations closed under operations Galois-dual to Boolean sentence connectives
• Real subset sums and posets with an involution
• On rank functions of lattices

Describes a project that uses

Uses Software

• CLOSET
• FooCA

This page was built for publication: Valuations and closure operators on finite lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548273)