29.04.2013 Views

TESI DOCTORAL - La Salle

TESI DOCTORAL - La Salle

TESI DOCTORAL - La Salle

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

1. Given a cluster ensemble E containing l components:<br />

⎛ ⎞<br />

λ1<br />

⎜λ2⎟<br />

⎜ ⎟<br />

E = ⎜ ⎟<br />

⎝ . ⎠<br />

Chapter 4. Self-refining consensus architectures<br />

compute the φ (ANMI) between each one of them and the cluster ensemble, that is:<br />

l<br />

φ (NMI) (λi, λk) , ∀k =1,...,l<br />

φ (ANMI) (E, λk) = 1<br />

l<br />

i=1<br />

2. Select the cluster ensemble component that maximizes its φ (ANMI) with respect to the whole<br />

ensemble as the reference for the self-refining<br />

<br />

process:<br />

(ANMI)<br />

λref =maxφ<br />

(E, λk)<br />

λk<br />

<br />

3. Compute the φ (NMI) between λref and each of the components of the cluster ensemble, that<br />

is:<br />

φ (NMI) (λref, λk) , ∀k =1,...,l<br />

4. Generate an ordered list Oφ (NMI) = {λφ (NMI) 1, λφ (NMI)2,...λφ (NMI)l} of cluster ensemble components<br />

ranked in decreasing order according to their φ (NMI) with respect λref.<br />

5. Create a set of P select cluster ensembles Epi by compiling the first ⌊ pi<br />

100l⌉ components of<br />

Oφ (NMI):<br />

⎛<br />

λφ (NMI)<br />

⎜<br />

Epi = ⎜<br />

⎝<br />

1<br />

λφ (NMI) 2<br />

⎞<br />

⎟<br />

.<br />

⎟<br />

⎠<br />

where pi ∈ (0, 100) , ∀i =1,...,P.<br />

λl<br />

λ φ (NMI) ⌊ p i<br />

100 l⌉<br />

6. Run a (flat or hierarchical) consensus architecture based on a consensus function F on Epi,<br />

obtaining a self-refined consensus clustering solution λc p i .<br />

7. Apply the supraconsensus function on the selected cluster ensemble component λref and<br />

the set of self-refined consensus clustering solutions λc p i , i.e. select as the final consensus<br />

solution the one maximizing its φ (ANMI) with respect to the cluster ensemble E, i.e.:<br />

λ final<br />

c<br />

= λ max φ (ANMI) (E, λ) , λ ∈{λref, λc p 1 ,...,λc p P }<br />

Table 4.11: Methodology of the cluster ensemble component selection-based consensus selfrefining<br />

procedure.<br />

SLSAD consensus functions is applied on λref —see figures 4.3(b) and 4.3(g), respectively.<br />

As in section 4.2, the consensus clustering solution deemed as the optimal one (across<br />

a majority of experiment runs) by the supraconsensus function is identified by means of a<br />

vertical green dashed line. As regards its performance, we can observe that it manages to<br />

select the highest quality clustering solution in all cases except when self-refining is based<br />

on the ALSAD and KMSAD consensus functions.<br />

So as to provide the reader with a more comprehensive and quantitative analysis of the<br />

performance of the proposed selection-based consensus self-refining procedure, the follow-<br />

123

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

Saved successfully!

Ooh no, something went wrong!