protected:bunch
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| protected:bunch [2010/05/06 14:04] – bil | protected: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/ | ||
| + | Bunch produces [[nested/ | ||
| ====== Factbase Properties ====== | ====== Factbase Properties ====== | ||
| Line 10: | Line 12: | ||
| ====== Clustering Objectives ====== | ====== Clustering Objectives ====== | ||
| - | The Bunch algorithm constructs software | + | |
| + | The Bunch algorithm constructs software | ||
| ====== 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 | + | |
| + | 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 28: | Line 36: | ||
| ====== Implementation ====== | ====== Implementation ====== | ||
| - | The [[bunch_tools|bunch]] | + | |
| + | You can download the official Bunch implementation | ||
protected/bunch.1273154653.txt.gz · Last modified: 2010/05/06 14:04 by bil