Scribd Logo
Upload

Welcome to Scribd!

  • Muhammad Dicky Maulida - 24319091 - 3tb04 - Tugas Praktikum m7

    Uploaded by

    Dicky Maulida
    25 views8 pages
    The document is a Jupyter notebook that discusses using the K-Nearest Neighbors (KNN) algorithm for classification. It loads and splits a dataset into training and test sets, then trains KNN classifiers with different values of k to find the optimal number of neighbors. It calculates the accuracy score for each k value on the test set and identifies the k value that achieved the highest accuracy, which is considered the optimal k for the given data.

    Original Description:

    Original Title

    Muhammad Dicky Maulida_24319091_3tb04_tugas Praktikum m7

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is a Jupyter notebook that discusses using the K-Nearest Neighbors (KNN) algorithm for classification. It loads and splits a dataset into training and test sets, then trains KNN classifiers with different values of k to find the optimal number of neighbors. It calculates the accuracy score for each k value on the test set and identifies the k value that achieved the highest accuracy, which is considered the optimal k for the given data.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    25 views8 pages

    Muhammad Dicky Maulida - 24319091 - 3tb04 - Tugas Praktikum m7

    Uploaded by

    Dicky Maulida
    The document is a Jupyter notebook that discusses using the K-Nearest Neighbors (KNN) algorithm for classification. It loads and splits a dataset into training and test sets, then trains KNN classifiers with different values of k to find the optimal number of neighbors. It calculates the accuracy score for each k value on the test set and identifies the k value that achieved the highest accuracy, which is considered the optimal k for the given data.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 8

    NAMA : M.

    DICKY MAULIDA
    NPM : 24319091
    KELAS : 3TB04
    TUGAS M7

    W 9 hyoercompu& tion-hub.gunadarma.ac.id/ ftsp/user/31319D91/no teboo k/ Tupas%20M7 lsminu&20Syahirah%20Marasabessy.lpynb

    TugasM7IsminurSyahirahMarasabessyLawch antzzr«rutesago‹unswaranges›
    ra zda vw : e, ce: c‹me+ wugas ne+o

    Review Dataset

    17.TXXXgXT1.W6S40e+04
    + 9 hyoercomputalio-n
    hub.gunadarma.ac.id/ftsp/use5r3
    /119091/noEebooM/ Tugas9620M7_Isminur962DSyahirah962OMarasabessy.ipynb

    Tugas M7_Isminur Syahirah Marasabessy Law ch ant zz ruraas ago ranges

    9 hypercomputalion-hub.punadarma. ac.id/ftsp/user/1US 1 9091/no febooks/ Tup as%20M7_Isminu r% 20Syahi ra h%20Marasabessy.ipynb

    Tugas I'v17_Ismin ur Syahi Fart MaFasabeSsy Last ChecKooiN 23 minutes ago (autosaved

    Memory: 1 GB 8 G

    Dalaset memiliki disfribusi kelas yang fidak seimban Qimbalanced sehingga secara leknis akan digunakan teknlk untuk menangani data yang tldak selrnbang-'
    9 hypercomputalion-hub.gunadarma. ac.id/ftsp/user/1351 9091/notebooks/ Tugas% 20M7_Isminu r% 20Syahi ra h%20Marasabessy.ipynb

    Tugas I'v17_Ismin ur Syahi rah Marasabess y rast ChecKooint 23 minules ago (autosaved)

    Memory: 1 GB 8 GB

    Tugas M7 Isminur Syah rah Marasabessy Law checgou. z4 mrs ago ‹au<saved

    Tugas M7 Isminur SyahJrah MaraSabeSs y Last mecksoiM 2s nnfrtes ago {autosaved


    Tugas M7 Ismin ur Syah*rah Marasabessy Law cfieckgenr zs mnntes ago ta«i saw;

    2.0 11.0 2.0


    Tugas M7_Isminur Syah1rah Marasabessy Lasi checkonint. zs rune ago ‹aviosavea)

    Visualization

    Tugas M7 Isminur Syahirah Marasabess y Law caecgoiu. zs m ns ago fau<saveaJ

    ri» La u mse, cei x,m‹i waeu n«D Python 3 0

    best.UnWkmenggunakamIerma!ék#ahamsmemanggiI€nps cs¥er ma!édanpandaspb¥ g „..


    # Proses Modelling dengan KNN
    iho rt nunpy a s np
    rom sk Sea rn . mo de1_se LeeI ion inport K FD1d

    y =df I inal .i Io c [ : , - l : ] . to n umpy ( ) Kf


    = OF o ld (n_s p I it s = 5 )
    kf . get_n_s p l it s (x)

    -f-a r I ra in_T nde x, te st_index in kf . s pI it (X) :


    p i in I ( " TR - I’J : " , I rai n_i ndex, ""E T : " , I e st_index ) x_t
    rai n, x_test X [I r•a z n_z ndex] , X [ I e st_index]
    y_t rai n , y_test y [I ra n_i ndex] , y [ I e st_index]
    OF o1d ( n_* p1it s -5, r andam_s I a te =No n e, * huIf be=F aL se
    TRR.IN : [ .^045 9046 3847 . . . 45213 45220 ^5221] TEST : [ 0 1 2 30^2 ^.B4? 904-4-]
    URL.IN : [ 0 L 2 . 45213 4 5226 A5221 ] TEST [ 9045 ^.646 DB47 z ... 16B67 18688 1S66'2§
    rR>In : [ e I 271?1 27132 2713? ]
    #szt9 4szze °szcz] zzsz : [1B090 ISO".1 16B92
    TRR.IN : [ 0 L 2 . . . 45213 45220 ^5221] TEST : [27134 27135 27L3G 36175 36176 36177]
    URL.IN : [ 0 L Z . . . 3 G17 g 3617@ T GL 7 7 ] TEST : [3G178 3617". ?@L80 4fi2JS 45220 4s221]

    [[’8.63 87 l’e5’7B771 -0.43B12161 ... 1 . 36.

    38.
    1.24469679 -1.49349376 1.
    36.

    36.
    [-8.26B42381 1 .
    38.

    1.47166476 -0.43B12161 ... e.


    -1.25195088 0.11127873 -0.438I2]61 ... 1.
    [ l.01T72882 0.92951628 -0.43B12161 ... 0. 36.

    [{-1.02498291 e . 5seBB942 1 . 36.

    -0.0tI4550# -0.945B7846 -0.438I2]61 ... 1. 38.

    [-8.79BB1494 e. 7s 7e34zt . .. .

    [-0.344079 -0.7756B407 -0.43B12161 .... 1.

    1.52047]41 ... 1. 37.


    [ -8. 64670296 38.
    0.

    y axis test
    F0ll

    In [ 19] :

    from sklearm.neighbors import KWeighborsClassifier

    lrange=list(range(l,ZB)}

    I-or k In 1 range :

    knn-KNeigh b-orsC la ssifiier (n_neighbo

    rs- K) knn. 111 x_t ra in, y_t rain .ravei )

    ) y@red=knn . p red ict (x_test )

    scores . append {iT¥=t rics.ac cura cy_score(y_test, y red) )


    pLt . I l gure(2 figs1ze= ZS 5) )

    ootimal_k = lramge[scores.imdex(max(scores))]
    print("Nilai k KNN yang optimal adalah %d" % optimal_k)

    You might also like