# formal-concepts¶

**Release** v0.2.

Trying to find balance between usability and speed for Formal Concept Analysis experiments. Library is built on well known Python libraries Numpy (fast) and Pandas (easy to use). This library is work in progress, it is possible that whole implementation will change in the future.

## What is Formal Concept Analysis?¶

Formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties. Each concept in the hierarchy represents the objects sharing some set of properties; and each sub-concept in the hierarchy represents a subset of the objects (as well as a superset of the properties) in the concepts above it. The term was introduced by Rudolf Wille in 1980, and builds on the mathematical theory of lattices and ordered sets that was developed by Garrett Birkhoff and others in the 1930s.

## Implemented algorithms¶

- CloseByOne
- FastCloseByOne
- Lindig’s UpperNeighbor

## Links¶

- Basic info about FCA: https://phoenix.inf.upol.cz/esf/ucebni/formal.pdf

## User’s Guide¶

This part is describing how to use this library.

## API Reference¶

Detailed description of provided functionality.