Software Clustering

User Tools

Site Tools

You are here: Welcome to the Software Clustering Wiki » protected » Bunch Algorithm
Trace: • ACDC Algorithm
protected:bunch

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
protected:bunch [2009/05/12 00:23] – markprotected:bunch [2010/05/06 14:08] (current) – bil
Line 1: Line 1:
 ====== Bunch Algorithm ====== ====== Bunch Algorithm ======
 +
 ====== History ====== ====== History ======
 +
 ====== Algorithm Intent ====== ====== Algorithm Intent ======
-Banch algorithm produces [[nested/flat decomposition|flat]]  decomposition from a software system.  
  
 +Bunch produces [[nested/flat decomposition|flat]] decompositions of a software system that exhibit high cohesion and low coupling. 
  
 ====== Factbase Properties ====== ====== Factbase Properties ======
-The //[[factbase]]// is //[[factbase|module dependency graph (MDG)]]//+ 
 +The factbase is a module dependency graph (MDG).
  
 ====== Clustering Objectives ====== ====== Clustering Objectives ======
-The Bunch algorithm constructs software decomposition with maximum cohesion and minimum coupling. + 
 +The Bunch algorithm constructs software decompositions with maximum cohesion and minimum coupling. 
  
 ====== Process Description ====== ====== Process Description ======
-Bunch algorithm is optimization search algorithm that finds a partition with the maximum value of the [[objective functions|MQ]] objective function.+ 
 +The Bunch algorithm is an optimization search algorithm that finds a partition with the maximum value of the MQ objective function.
  
 ====== Decomposition Properties ====== ====== Decomposition Properties ======
-The Bunch decomposition has a high value for its objective function ([[objective functions|MQ]]).+ 
 +The Bunch decomposition has a high value for its objective function MQ.
  
 ====== Algorithm Restrictions ====== ====== Algorithm Restrictions ======
 +
 ====== Failed Assumptions ====== ====== Failed Assumptions ======
 +
 ====== Detailed Algorithm Description ====== ====== Detailed Algorithm Description ======
-Bunch starts by generating a random partition of the [[factbase|module dependency graph]]. Then,+ 
 +Bunch starts by generating a random partition of the module dependency graph. Then,
 [[terms|entities]] from the partition are regrouped systematically by examining neighbouring [[terms|entities]] from the partition are regrouped systematically by examining neighbouring
 partitions in order to find a better partition. When an improved partition is found, the partitions in order to find a better partition. When an improved partition is found, the
Line 27: Line 36:
  
 ====== Implementation ====== ====== Implementation ======
-The [[bunch_tools|bunch]] is official implementation of Bunch algorithm.+ 
 +You can download the official Bunch implementation [[http://serg.cs.drexel.edu/redmine/projects/show/bunch|here]]. 
protected/bunch.1242087806.txt.gz · Last modified: by mark