Finding incomparable pairs of subsets by using Formal Concept Analysis

Name: Finding incomparable pairs of subsets by using Formal Concept Analysis
Brand: Vita e Pensiero
Availability: OnlineOnly

digital

Article

Magazine

STATISTICA & APPLICAZIONI

Section

Open Access

Title

Finding incomparable pairs of subsets by using Formal Concept Analysis

Authors

Hans-Georg Bartel, Hans-Joachim Mucha

Publisher

Vita e Pensiero

Format

Article |

Pdf

Pages

Online from

02-2011

Issn

1824-6672 (print) | 2283-6659 (digital)

Write a comment for this product

Download

Ebook format Pdf readable on these devices:

Computer
with Software:
- Adobe PDF Reader
Android
iPhone/Ipad
with App:
- Adobe PDF Reader
E-Book Reader
Ibs Tolino
Kobo

Description Readers' comments

In the paper presented here, we use Formal Concept Analysis (FCA) to solve a problem that arises when working with partially ordered sets (posets). In detail, the task here is to look for incomparable subsets which are related to a given poset. A way to solve this problem is to use FCA based on a context which can be derived in some steps from the _-matrix of the (simple directed) graph corresponding to the given poset. The requested incomparable subsets result from the set of concepts obtained from this context. For illustrative purposes, small toy data sets are presented. At the end, a real data application to environmental chemistry is given in detail. The data consist of ten chemicals found in the German river Main. As the result a set of twelve incomparable pairs of subsets are figured out.
Keywords: Bipartite Graph, Adjacency Matrix, Formal Concept Analysis, Partially Ordered Set, Incomparability of Sets.

Enter a comment for Finding incomparable pairs of subsets by using Formal Concept Analysis