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.

5.3. Multimodal consensus clustering results<br />

5.3.2 Self-refined consensus clustering across modalities<br />

In this section, we analyze the results of subjecting the intermodal consensus clustering<br />

solution λc to a self-refining procedure based on a cluster ensemble E, the components of<br />

which correspond to both unimodal and multimodal partitions.<br />

As described in chapter 4, the self-refining process is based on the creation of a select<br />

cluster ensemble Epi –containing a percentatge pi of the clusterings in E– followed by<br />

the application of a (either flat or hierarchical) consensus process on it, which yields a<br />

self-refined consensus clustering λ pi<br />

c . In this work, the refining consensus processes are<br />

conducted by means of a flat consensus architecture, and the set of percentages pi employed<br />

is pi = {2, 5, 10, 15, 20, 30, 40, 50, 75}.<br />

For this reason, the obtention of the final consensus clustering solution λ final<br />

c<br />

relies on the<br />

application of a supraconsensus selection function onto the set of self-refined clusterings λ pi<br />

c<br />

—see section 4.1 for a description of the φ (ANMI) -based supraconsensus function employed<br />

in this work. In the following paragraphs, the performances of these two processes (i.e. the<br />

self-refining procedure and the supraconsensus function) are evaluated separately.<br />

As in the previous section, the results of the execution of these processes on the IsoLetters<br />

data collection are described in detail next. Again, for brevity reasons, the presentation of<br />

the results corresponding to the CAL500, InternetAds and Corel data sets is deferred to<br />

appendix E.<br />

Evaluation of the multimodal self-refining process<br />

For starters, figure 5.7 depicts the results of the self-refining process using the multimodal<br />

cluster ensemble resulting from gathering the partitions output by the agglo-cos-upgma<br />

clustering algorithm of the CLUTO package. Each one of the seven boxplots presented (one<br />

per consensus function) shows, from left to right, the φ (NMI) values of the multimodal cluster<br />

ensemble E components, of the intermodal consensus clustering λc, and of the self-refined<br />

consensus clustering solutions λ pi<br />

c . The consensus clustering selected by the supraconsensus<br />

, is highlighted by a vertical green dashed line.<br />

Notice that, regardless of the consensus function employed, there always exists at least<br />

one self-refined consensus clustering solution that attains a φ (NMI) value that is statistically<br />

significantly higher than the one achieved by the non-refined version λc. In some cases, as<br />

when consensus is based on CSPA (figure 5.7(a)), relatively small φ (NMI) gains are obtained,<br />

specially if they are compared with the dramatic φ (NMI) increases brought about by selfrefining<br />

when, for instance, the EAC, HGPA or SLSAD consensus functions are employed<br />

(see figures 5.7(b), 5.7(c) and 5.7(g)).<br />

As regards the ability of the supraconsensus function to select the highest quality (either<br />

refined or non-refined) consensus clustering as the final partition of the data, it is to<br />

notice that it apparently performs reasonably well, as it mostly succeeds in picking up the<br />

clustering solution of maximum φ (NMI) as λfinal c . A deeper analysis of the supraconsensus<br />

function performance will be presented in the next section.<br />

Notice that the proposed intermodal consensus self-refining procedure shows a very similar<br />

behaviour in the experiments conducted on the multimodal cluster ensembles created<br />

upon the partitions output by the direct-cos-i2, thegraph-cos-i2 and the rb-cos-i2 clustering<br />

algorithms from the CLUTO toolbox —see figures 5.8, 5.9 and 5.10, respectively.<br />

function, λ final<br />

c<br />

152

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

Saved successfully!

Ooh no, something went wrong!