DeepAI AI Chat
Log In Sign Up

Experimental Study of Concise Representations of Concepts and Dependencies

by   Aleksey Buzmakov, et al.

In this paper we are interested in studying concise representations of concepts and dependencies, i.e., implications and association rules. Such representations are based on equivalence classes and their elements, i.e., minimal generators, minimum generators including keys and passkeys, proper premises, and pseudo-intents. All these sets of attributes are significant and well studied from the computational point of view, while their statistical properties remain to be studied. This is the purpose of this paper to study these singular attribute sets and in parallel to study how to evaluate the complexity of a dataset from an FCA point of view. In the paper we analyze the empirical distributions and the sizes of these particular attribute sets. In addition we propose several measures of data complexity relying on these attribute sets in considering real-world and related randomized datasets.


page 1

page 2

page 3

page 4


On sets of graded attribute implications with witnessed non-redundancy

We study properties of particular non-redundant sets of if-then rules de...

On minimal sets of graded attribute implications

We explore the structure of non-redundant and minimal sets consisting of...

Unique key Horn functions

Given a relational database, a key is a set of attributes such that a va...

Computing sets of graded attribute implications with witnessed non-redundancy

In this paper we extend our previous results on sets of graded attribute...

Composition of Credal Sets via Polyhedral Geometry

Recently introduced composition operator for credal sets is an analogy o...

Lévy copulas: a probabilistic point of view

There is a one-to-one correspondence between Lévy copulas and proper cop...

The Shapley Value of Inconsistency Measures for Functional Dependencies

Quantifying the inconsistency of a database is motivated by various goal...