Some Notes on Polyadic Concept Analysis

by   Alexandre Bazin, et al.
Universite Lumiere Lyon 2

Despite the popularity of Formal Concept Analysis (FCA) as a mathematical framework for data analysis, some of its extensions are still considered arcane. Polyadic Concept Analysis (PCA) is one of the most promising yet understudied of these extensions. This formalism offers many interesting open questions but is hindered in its dissemination by complex notations and a lack of agreed-upon basic definitions. In this paper, we discuss in a mostly informal way the fundamental differences between FCA and PCA in the relation between contexts, conceptual structures, and rules. We identify open questions, present partial results on the maximal size of concept n-lattices and suggest new research directions.


page 1

page 2

page 3

page 4


Computability in partial combinatory algebras

We prove a number of elementary facts about computability in partial com...

Formal Concept Analysis with Many-sorted Attributes

This paper unites two problem-solving traditions in computer science: (1...

Scaling Dimension

Conceptual Scaling is a useful standard tool in Formal Concept Analysis ...

A Survey on how Description Logic Ontologies Benefit from Formal Concept Analysis

Although the notion of a concept as a collection of objects sharing cert...

Distributed Conceptual Structures

The theory of distributed conceptual structures, as outlined in this pap...

Detecting Large Concept Extensions for Conceptual Analysis

When performing a conceptual analysis of a concept, philosophers are int...

Conceptual Analysis of Resource Meta-information

It's ease of use and the availability of browsers for various platforms ...

Please sign up or login with your details

Forgot password? Click here to reset