Software Clustering

User Tools

Site Tools

You are here: Welcome to the Software Clustering Wiki » protected » LIMBO Algorithm
Trace:
protected:limbo

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
protected:limbo [2009/05/12 03:44] – markprotected:limbo [2010/05/06 14:12] (current) – bil
Line 1: Line 1:
 ====== LIMBO Algorithm ====== ====== LIMBO Algorithm ======
 +
 ====== History ====== ====== History ======
-Algorithm was developed by Periklis Andritsos and Vassilios Tzerpos.+The algorithm was developed by Periklis Andritsos and Vassilios Tzerpos.
  
 ====== Algorithm Intent ====== ====== Algorithm Intent ======
-Banch algorithm produces [[nested/flat decomposition|flat]]  decomposition from a software system. + 
 +To generate decompositions that exhibit the least information lost when entities are represented by their clusters.
  
 ====== Factbase Properties ====== ====== Factbase Properties ======
-Factbased is generic dependency data table where each row describes one [[terms|entity]] to be cluster. Each column contains the value for a specific [[terms|attribute]]. + 
 +The factbase is a generic dependency data table where each row describes one [[terms|entity]] to be clustered. Each column contains the value for a specific [[terms|attribute]]. 
  
 ====== Clustering Objectives ====== ====== Clustering Objectives ======
-The Limbo algorithm produces software decomposition with minimum information loss.+ 
 +The Limbo algorithm produces software decompositions with minimum information loss.
  
 ====== Process Description ====== ====== Process Description ======
-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.     +An agglomerative clustering algorithm that on each step merges the two clusters with the least information loss. 
 + 
 +The information lost is calculated using the Agglomerative Information Bottleneck algorithm.     
  
 ====== Decomposition Properties ====== ====== Decomposition Properties ======
 +
 The LIMBO decomposition has a small value for its information lost function.  The LIMBO decomposition has a small value for its information lost function. 
  
 ====== Algorithm Restrictions ====== ====== Algorithm Restrictions ======
 +
 ====== Failed Assumptions ====== ====== Failed Assumptions ======
 +
 ====== Detailed Algorithm Description ====== ====== Detailed Algorithm Description ======
  
-The LIMBO algorithm has four phases:+LIMBO has four phases:
    - Creation of the Summary Artefacts    - Creation of the Summary Artefacts
    - Application of the AIB algorithm    - Application of the AIB algorithm
protected/limbo.1242099886.txt.gz · Last modified: 2009/05/12 03:44 by mark