Scribd Logo
Upload

Welcome to Scribd!

  • Distance Based

    Uploaded by

    Diklu Norsita
    15 views2 pages
    The document describes the Relief algorithm for attribute selection. It provides an example of 5 samples with 2 attributes (X1 and X2) and a class. It calculates the nearest hit (H) and nearest miss (M) for each sample. It then computes the attribute weights Wx1 and Wx2, with Wx1 being higher, indicating X1 is more relevant for classifying samples. Therefore, Relief selects X1 as the most relevant attribute.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the Relief algorithm for attribute selection. It provides an example of 5 samples with 2 attributes (X1 and X2) and a class. It calculates the nearest hit (H) and nearest miss (M) for each sample. It then computes the attribute weights Wx1 and Wx2, with Wx1 being higher, indicating X1 is more relevant for classifying samples. Therefore, Relief selects X1 as the most relevant attribute.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views2 pages

    Distance Based

    Uploaded by

    Diklu Norsita
    The document describes the Relief algorithm for attribute selection. It provides an example of 5 samples with 2 attributes (X1 and X2) and a class. It calculates the nearest hit (H) and nearest miss (M) for each sample. It then computes the attribute weights Wx1 and Wx2, with Wx1 being higher, indicating X1 is more relevant for classifying samples. Therefore, Relief selects X1 as the most relevant attribute.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Distance Based : Relief

    X1 X2 Class
    2 5 nearest hit (H) between same class
    8 7 nearest miss (M) between different class
    5 10
    Max x1=12, min x1=2 range =10
    12 10
    6 14 Max x2=14, min x2=5range=9
    14
    Sample =5
    Hhit
    Wx1= (-10/10+6/10 -1/10+5/10
    10
    Mmiss -3/10+2/10 -1/10+6/10
    -10/10+4/10)/5= -0.04
    7
    Wx2= (-3/9+1/9 -5/9+2/9 -5/9+3/9
    5
    -4/9+4/9 -4/9+4/9)/5= -0.133

    2 5 6 8 12
    Hhit Wx1 > Wx2  select x1
    Mmiss 1
    HOME WORK
    a1 a2 a3 a4 target
    2 3 2 1 Star
    3 4 4 1 Circle
    4 3 3 16 Star
    1 4 7 5 Circle
    1 3 9 9 Star
    1 2 3 6 Star
    3 2 2 0 Star
    4 2 1 6 Circle

    • Compute which attribute the most relevant


    one to classify the target?, compare Relief`

    You might also like