Algorithm was developed by Periklis Andritsos and Vassilios Tzerpos.

Banch algorithm produces flat decomposition from a software system.

Factbased is generic dependency data table where each row describes one entity to be cluster. Each column contains the value for a specific attribute.

The Limbo algorithm produces software decomposition with minimum information loss.

An agglomerative clustering algorithm that on each step merges two clusters with least information loss.

The information lost calculates using formulas from Agglomerative Information Bottleneck algorithm.

The LIMBO decomposition has a small value for its information lost function.

The LIMBO algorithm has four phases:

1. Creation of the Summary Artefacts
2. Application of the AIB algorithm
3. Associating original artefacts with clusters
4. Determining the number of clusters