29.04.2013 Views

TESI DOCTORAL - La Salle

TESI DOCTORAL - La Salle

TESI DOCTORAL - La Salle

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

3.4. Flat vs. hierarchical consensus<br />

CPU time (sec.)<br />

CPU time (sec.)<br />

8<br />

7<br />

6<br />

5<br />

4<br />

8<br />

7<br />

6<br />

5<br />

4<br />

3<br />

2<br />

1<br />

0<br />

CSPA<br />

RHCA<br />

DHCA<br />

flat<br />

CSPA<br />

RHCA<br />

DHCA<br />

flat<br />

CPU time (sec.)<br />

CPU time (sec.)<br />

1.4<br />

1.2<br />

1<br />

0.8<br />

0.6<br />

0.4<br />

0.45<br />

0.4<br />

0.35<br />

0.3<br />

0.25<br />

0.2<br />

0.15<br />

0.1<br />

0.05<br />

EAC<br />

RHCA<br />

DHCA<br />

flat<br />

EAC<br />

RHCA<br />

DHCA<br />

flat<br />

CPU time (sec.)<br />

CPU time (sec.)<br />

9<br />

8<br />

7<br />

6<br />

5<br />

4<br />

HGPA<br />

RHCA<br />

DHCA<br />

flat<br />

CPU time (sec.)<br />

8<br />

7.5<br />

7<br />

6.5<br />

6<br />

5.5<br />

5<br />

4.5<br />

4<br />

MCLA<br />

RHCA<br />

DHCA<br />

flat<br />

CPU time (sec.)<br />

8<br />

7<br />

6<br />

5<br />

4<br />

3<br />

2<br />

1<br />

ALSAD<br />

RHCA<br />

DHCA<br />

flat<br />

(a) Serial implementation running time<br />

8<br />

6<br />

4<br />

2<br />

0<br />

HGPA<br />

RHCA<br />

DHCA<br />

flat<br />

CPU time (sec.)<br />

0.8<br />

0.7<br />

0.6<br />

0.5<br />

0.4<br />

0.3<br />

0.2<br />

MCLA<br />

RHCA<br />

DHCA<br />

flat<br />

CPU time (sec.)<br />

8<br />

7<br />

6<br />

5<br />

4<br />

3<br />

2<br />

1<br />

0<br />

ALSAD<br />

RHCA<br />

DHCA<br />

flat<br />

(b) Parallel implementation running time<br />

CPU time (sec.)<br />

CPU time (sec.)<br />

8<br />

7<br />

6<br />

5<br />

4<br />

3<br />

2<br />

1<br />

8<br />

7<br />

6<br />

5<br />

4<br />

3<br />

2<br />

1<br />

0<br />

KMSAD<br />

RHCA<br />

DHCA<br />

flat<br />

KMSAD<br />

RHCA<br />

DHCA<br />

flat<br />

CPU time (sec.)<br />

CPU time (sec.)<br />

8<br />

7<br />

6<br />

5<br />

4<br />

3<br />

2<br />

1<br />

8<br />

7<br />

6<br />

5<br />

4<br />

3<br />

2<br />

1<br />

0<br />

SLSAD<br />

RHCA<br />

DHCA<br />

flat<br />

SLSAD<br />

RHCA<br />

DHCA<br />

flat<br />

Figure 3.17: Running times of the computationally optimal RHCA, DHCA and flat consensus<br />

architectures on the Zoo data collection for the diversity scenario corresponding to<br />

a cluster ensemble of size l = 1083.<br />

3.5 and 3.11) are at least eight times faster than flat consensus –see figure 3.17(b)– attaining<br />

very similar execution times (being statistically equivalent when the HGPA, ALSAD and<br />

SLSAD consensus functions are employed). This is quite logical provided that DHCA has 3<br />

stages, building consensus on mini-ensembles of sizes |dfA| = 19, |dfD| = 14, and |dfR| =5,<br />

while the fastest RHCA has two or three stages (depending on the consensus function employed)<br />

where consensus is built on mini-ensembles of size b =26orb = 27. At the end of<br />

the day, the number of stages and the mini-ensembles sizes of DHCA and RHCA are conterbalanced,<br />

yielding, as mentioned earlier, pretty similar running times. Notice, however,<br />

that when consensus are built using the MCLA consensus function, RHCA is penalized<br />

with respect to DHCA, given the larger size of its mini-ensembles and the aforementioned<br />

quadratic dependence of this consensus function running time with this factor.<br />

Diversity scenario |df A| =28<br />

A very similar behaviour to the one just reported is observed when the size of the cluster<br />

ensembles is increased. Indeed, in the highest diversity scenario, i.e. the one corresponding<br />

to the use of the |dfA| = 28 clustering algorithms of the CLUTO toolbox for creating cluster<br />

92

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!