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.3. Deterministic hierarchical consensus architectures<br />

Serial DHCA<br />

Firstly, let us consider the fully serialized version of the DHCA. In this case, the time<br />

complexity amounts to the sum of all the consensus processes, as defined by equation (3.14).<br />

Notice that STCDHCA can be expressed ultimately in terms of the number and cardinalities<br />

of the diversity factors employed in the generation of the cluster ensemble.<br />

STCDHCA =<br />

s Ki <br />

i=1 j=1<br />

O (bij w )=<br />

s<br />

i=1<br />

Ki · O (bij w )=<br />

f<br />

<br />

f<br />

i=1<br />

k=i+1<br />

Keeping the higher order terms, serial DHCA time complexity is:<br />

Parallel DHCA<br />

<br />

f<br />

<br />

STCDHCA = O |dfk| |df1| w<br />

<br />

k=2<br />

<br />

|dfk| · O (|dfi| w ) (3.14)<br />

(3.15)<br />

And secondly, the time complexity of the parallelized execution of the DHCA is presented<br />

in equation (3.16). As all the consensus processes in a given DHCA stage are equally costly,<br />

the value of PTCDHCA amounts to the addition of the complexities of one of the consensus<br />

processes run on each of the s stages of the hierarchy.<br />

PTCDHCA =<br />

s<br />

i=1<br />

O (bij w )=<br />

f<br />

O (|dfi| w ) (3.16)<br />

Notice that the parallel execution of a DHCA can be regarded as a sequence of f<br />

instructions of complexity O (|dfi| w ) , ∀i ∈ [1,f]. Therefore, applying the sum rule of<br />

assymptotic notation, PTCDHCA can be rewritten as:<br />

<br />

PTCDHCA = O<br />

3.3.3 Running time minimization<br />

i=1<br />

max (|dfi|)<br />

i<br />

w<br />

<br />

(3.17)<br />

As in section 3.2, a naturally arising question regarding the practical implementation of<br />

deterministic hierarchical consensus architectures is the following: given a cluster ensemble<br />

of size l created upon a set of diversity factors dfi (for i = {1,...,f}), which is the least<br />

time consuming DHCA variant that can be built?<br />

Indeed, as the topology of a deterministic hierarchical consensus architecture is ultimately<br />

determined by an ordered list O of the f diversity factors indicating upon which<br />

diversity factor consensus is conducted at each DHCA stage, there exist f! distinctDHCA<br />

variants for a given consensus clustering problem —one for each of the possible ways of ordering<br />

the f diversity factors. Then, the question transforms into: how should the diversity<br />

factors be ordered so as to minimize the total running time of the DHCA?<br />

72

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

Saved successfully!

Ooh no, something went wrong!