Closure spaces that are not uniquely generated

Authors:
Robert E. Jamison;John L. Pfaltz
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC 29634, USA;Department of Computer Science, University of Virginia, Charlottesville, VA 22903, USA
Venue:
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
Year:
2005

Citing 6
Cited 3

Convexity in graphs and hypergraphs

SIAM Journal on Algebraic and Discrete Methods
Matroids and antimatroids—a survey

Discrete Mathematics
Closure lattices

Discrete Mathematics
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations

Using concept lattices to uncover causal dependencies in software

ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts

Information Sciences: an International Journal
Key roles of closed sets and minimal generators in concise representations of frequent patterns

Intelligent Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Because antimatroid closure spaces satisfy the anti-exchange axiom, it is easy to show that they are uniquely generated. That is, the minimal set of elements determining a closed set is unique. A prime example is a discrete convex geometry in Euclidean space where closed sets are uniquely generated by their extreme points. But, many of the geometries arising in computer science, e.g. the world wide web or rectilinear VLSI layouts are not uniquely generated. Nevertheless, these closure spaces still illustrate a number of fundamental antimatroid properties which we demonstrate in this paper. In particular, we examine both a pseudo-convexity operator and the Galois closure of formal concept analysis. In the latter case, we show how these principles can be used to automatically convert a formal concept lattice into a system of implications.