Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    Candidate Elimination

    Uploaded by

    Santosh Agadoorappa
    The document describes a candidate elimination algorithm for learning from examples. It loads data on whether people enjoy sports given weather and temperature conditions. It initializes specific and general hypotheses to the first example. It then iterates through each example, updating the hypotheses: if the example is positive, it makes the specific hypothesis more general; if negative, it makes the general hypothesis more specific. It returns the final specific and general hypotheses.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Candidate Elimination

    Uploaded by

    Santosh Agadoorappa
    18 views2 pages
    The document describes a candidate elimination algorithm for learning from examples. It loads data on whether people enjoy sports given weather and temperature conditions. It initializes specific and general hypotheses to the first example. It then iterates through each example, updating the hypotheses: if the example is positive, it makes the specific hypothesis more general; if negative, it makes the general hypothesis more specific. It returns the final specific and general hypotheses.

    Original Description:

    machine learning

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a candidate elimination algorithm for learning from examples. It loads data on whether people enjoy sports given weather and temperature conditions. It initializes specific and general hypotheses to the first example. It then iterates through each example, updating the hypotheses: if the example is positive, it makes the specific hypothesis more general; if negative, it makes the general hypothesis more specific. It returns the final specific and general hypotheses.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    18 views2 pages

    Candidate Elimination

    Uploaded by

    Santosh Agadoorappa
    The document describes a candidate elimination algorithm for learning from examples. It loads data on whether people enjoy sports given weather and temperature conditions. It initializes specific and general hypotheses to the first example. It then iterates through each example, updating the hypotheses: if the example is positive, it makes the specific hypothesis more general; if negative, it makes the general hypothesis more specific. It returns the final specific and general hypotheses.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 2

    CANDIDATE ELIMINATION ALGORITHM

    import numpy as np

    import pandas as pd

    data = pd.read_csv('enjoysport.csv')

    concepts = np.array(data.iloc[:,0:-1])

    print("\nInstances are:\n",concepts)

    target = np.array(data.iloc[:,-1])

    print("\nTarget Values are: ",target)

    Instances are:
    [['sunny' 'warm' 'normal' 'strong' 'warm' 'same']
    ['sunny' 'warm' 'high' 'strong' 'warm' 'same']
    ['rainy' 'cold' 'high' 'strong' 'warm' 'change']
    ['sunny' 'warm' 'high' 'strong' 'cool' 'change']]

    Target Values are: ['yes' 'yes' 'no' 'yes']

    def learn(concepts, target):

    specific_h = concepts[0].copy()

    print("\nInitialization of specific_h and genearal_h")

    print("\nSpecific Boundary: ", specific_h)

    general_h = [["?" for i in range(len(specific_h))] for i in range(len(specific_h))]

    print("\nGeneric Boundary: ",general_h)

    for i, h in enumerate(concepts):

    print("\nInstance", i+1 , "is ", h)

    if target[i] == "yes":

    print("Instance is Positive ")


    CANDIDATE ELIMINATION ALGORITHM

    for x in range(len(specific_h)):

    if h[x]!= specific_h[x]:

    specific_h[x] ='?'

    general_h[x][x] ='?'

    if target[i] == "no":

    print("Instance is Negative ")

    for x in range(len(specific_h)):

    if h[x]!= specific_h[x]:

    general_h[x][x] = specific_h[x]

    else:

    general_h[x][x] = '?'

    print("Specific Bundary after ", i+1, "Instance is ", specific_h)

    print("Generic Boundary after ", i+1, "Instance is ", general_h)

    print("\n")

    indices = [i for i, val in enumerate(general_h) if val == ['?', '?', '?', '?', '?', '?']]

    for i in indices:

    general_h.remove(['?', '?', '?', '?', '?', '?'])

    return specific_h, general_h

    s_final, g_final = learn(concepts, target)

    print("Final Specific_h: ", s_final, sep="\n")

    print("Final General_h: ", g_final, sep="\n")

    You might also like