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.

Chapter 6. Voting based consensus functions for soft cluster ensembles<br />

I πλ<br />

⎛<br />

0<br />

1 ,λ2 λ = ⎝0<br />

1<br />

1<br />

1<br />

0<br />

0<br />

⎞ ⎛<br />

0 0<br />

1⎠⎝1<br />

0 0<br />

0<br />

1<br />

0<br />

0<br />

1<br />

0<br />

1<br />

0<br />

0<br />

1<br />

0<br />

0<br />

1<br />

0<br />

0<br />

0<br />

0<br />

1<br />

0<br />

0<br />

1<br />

⎞ ⎛<br />

0 1<br />

0⎠<br />

= ⎝0<br />

1 0<br />

1<br />

0<br />

0<br />

1<br />

0<br />

0<br />

0<br />

0<br />

1<br />

0<br />

0<br />

1<br />

0<br />

0<br />

1<br />

0<br />

1<br />

0<br />

0<br />

1<br />

0<br />

⎞<br />

0<br />

1⎠<br />

0<br />

(6.22)<br />

Therefore, assigning each object to the cluster it is most strongly associated to transforms<br />

the cluster permuted incidence matrix I πλ1 ,λ2 λ into the disambiguated crisp clustering<br />

1<br />

λ πλ1 ,λ2 1 . In equation (6.23), this clustering is presented alongside λ2 —the clustering that<br />

has been taken as the reference of the cluster disambiguation process.<br />

λ πλ 1 ,λ 2<br />

1 =[111333222] (6.23)<br />

λ2 =[113333322] (6.24)<br />

In the context of our voting-based soft consensus functions, though, cluster disambiguation<br />

is conducted on pairs of soft clustering solutions. In order to illustrate how to proceed<br />

in this case, we use a toy example that is the fuzzy version of the one just reported. For<br />

brevity, we will only consider the case in which object-to-cluster associations are expressed<br />

in terms of membership probabilities, although an analog procedure could be devised in<br />

the case these were expressed by means of other metrics. Therefore, given the two fuzzy<br />

partitions Λ1 and Λ2 of equation (6.25):<br />

⎛<br />

0.054 0.026 0.057 0.969 0.976 0.959 0.009 0.016<br />

⎞<br />

0.010<br />

Λ1 = ⎝0.921<br />

0.932 0.905 0.025 0.019 0.030 0.014 0.055 0.017⎠<br />

0.025<br />

⎛<br />

0.932<br />

0.042<br />

0.921<br />

0.038<br />

0.019<br />

0.006<br />

0.030<br />

0.005<br />

0.014<br />

0.011<br />

0.025<br />

0.976<br />

0.057<br />

0.929<br />

0.017<br />

0.972<br />

⎞<br />

0.055<br />

Λ2 = ⎝0.042<br />

0.025 0.005 0.011 0.009 0.006 0.038 0.972 0.929⎠<br />

(6.25)<br />

0.026 0.054 0.976 0.959 0.976 0.969 0.905 0.010 0.016<br />

The cluster similarity matrix S Λ1 ,Λ 2 is computed upon the soft clustering matrices themselves,<br />

as described by equation (6.26).<br />

SΛ 1 ,Λ 2 = Λ1Λ T 2 =<br />

⎛<br />

= ⎝<br />

⎛<br />

= ⎝<br />

0.054 0.026 0.057 0.969 0.976 0.959 0.009 0.016 0.010<br />

0.921 0.932 0.905 0.025 0.019 0.030 0.014 0.055 0.017<br />

0.025 0.042 0.038 0.006 0.005 0.011 0.976 0.929 0.972<br />

0.143 0.054 2.878<br />

1.738 0.136 1.042<br />

0.188 1.845 0.969<br />

⎞<br />

⎛<br />

⎜<br />

⎞ ⎜<br />

⎠ ⎜<br />

⎝<br />

0.932 0.042 0.026<br />

0.921 0.025 0.054<br />

0.019 0.005 0.976<br />

0.030 0.011 0.959<br />

0.014 0.009 0.976<br />

0.025 0.006 0.969<br />

0.057 0.038 0.905<br />

0.017 0.972 0.010<br />

0.055 0.929 0.016<br />

⎠ (6.26)<br />

175<br />

⎞<br />

⎟<br />

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

Saved successfully!

Ooh no, something went wrong!