## Hamming, Relief, fitness

4 posts
• Page

**1**of**1**### Hamming, Relief, fitness

Hi there,

i would ask to you some explanations about hamming and relief: what do they are? i mean...i know how to calculate distances by manhattan and euclidean, but using them?

I would like even to know how it's done the fitness evaluator for k-means.

Any help is really appreciated

Thanks

i would ask to you some explanations about hamming and relief: what do they are? i mean...i know how to calculate distances by manhattan and euclidean, but using them?

I would like even to know how it's done the fitness evaluator for k-means.

Any help is really appreciated

Thanks

Hamming distance is well known (see http://en.wikipedia.org/wiki/Hamming_distance). For ReliefF, check Kononenko's papers. As I recall, it is the same thing as Manhattan distance with a few tricks for treatment of undefined values.

Janez

Relief seems different, uses probability:

W[A] = P (different value of A | nearest istance from different class) â€“

P (different value of A | nearest istance from same class)

By the way, i can't understand why BIC is calculated for every cluster: i thought it was an evaluator for the whole model. How can i obtain BIC for hierarchical clustering? I would like to check quality of k-means against hierarchical clustering.

Another thing is that at the end the values of BIC obtained for every cluster are added: does it mean that is an additive measure for every cluster, considered them as stand-alone models?

Last thing about BIC is: a good value of BIC is a low value in absolute value, or even considering the sign?

Thanks a lot for the help

As for BIC: I don't know. The answer is somewhere here: http://www.ailab.si/svn/orange/trunk/add-ons/orngCRS/, especially here: http://www.ailab.si/svn/orange/trunk/ad ... ngCRS/src/.

Janez

4 posts
• Page

**1**of**1**