Scribd Logo
Upload

Welcome to Scribd!

  • Pca ML

    Uploaded by

    Govada Dhana
    13 views4 pages
    Principal Component Analysis (PCA) is a dimensionality reduction machine learning technique that transforms high-dimensional datasets into smaller ones by identifying patterns in the data and reducing the large set of variables into a smaller set that still explains most of the variance. It does this by computing the eigenvalues and eigenvectors of the covariance matrix to identify the principal components and directions that maximize the variance in the data. The technique was applied to a sample dataset to reduce its dimensionality from 4 features to 2 features while preserving most of the information.

    Original Description:

    Original Title

    PCA_ML

    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
    Principal Component Analysis (PCA) is a dimensionality reduction machine learning technique that transforms high-dimensional datasets into smaller ones by identifying patterns in the data and reducing the large set of variables into a smaller set that still explains most of the variance. It does this by computing the eigenvalues and eigenvectors of the covariance matrix to identify the principal components and directions that maximize the variance in the data. The technique was applied to a sample dataset to reduce its dimensionality from 4 features to 2 features while preserving most of the information.

    Copyright:

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

    Pca ML

    Uploaded by

    Govada Dhana
    Principal Component Analysis (PCA) is a dimensionality reduction machine learning technique that transforms high-dimensional datasets into smaller ones by identifying patterns in the data and reducing the large set of variables into a smaller set that still explains most of the variance. It does this by computing the eigenvalues and eigenvectors of the covariance matrix to identify the principal components and directions that maximize the variance in the data. The technique was applied to a sample dataset to reduce its dimensionality from 4 features to 2 features while preserving most of the information.

    Copyright:

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

    ii pal Conronent Analysis (Pr):

    kcarning Metho.
    is
    a dinenulonaliby udution Madune
    Jt datasets and hulps
    into Shmaller
    t reduces large data sets
    (F the model
    in
    in incveasing the accuvacy

    PycceSS the Vacuiabe s.


    the Man c Coyrelati on
    iden ify
    (orelation ss.
    . Ffnding matuiz
    to
    Lo idntity the
    ance
    CovVasiance

    the
    coVaú rs 8f
    Cempute
    values & etgenvecto
    components,
    the eigen
    Compute the principa
    to iden tfy
    Matrix

    vectoy

    Novmali 7e
    the eígen
    4. Derive new dataset

    hom
    2 to 1using PA.
    dimusicuality
    Reduce the
    Problem EXs EX
    Feature EX EX
    7
    3
    X
    4

    = 2
    features
    (n)
    ho.of
    S Given thar (N= +
    samplu
    Noof
    variable s.
    stp-1 Finding
    Mea
    oof
    4++ 377 32 -g
    +4+ Stly 9.S
    bls,
    mabú n
    vasia

    OF
    (oVaníance
    Foy
    theu aAU N*
    , 2 ) , (99)
    Computation
    Step 0a) ,ay)
    Ordescd p a i r s

    orcuned palrs

    of a , )
    i, Cova

    cov a ) =
    ) 1
    N-
    -9)+ (-9+(3-8+(1-s

    atu
    varuiables
    If too the
    (2,7),
    =16t0+25+1 Same,as
    formutais ECK)
    919
    Co von,a) =19 |
    i,
    J, Covar (7,4)
    (7,
    t-8)
    4-1
    (u-s.s)4 (8-1)(4 -3.5)-+(18-e)(5-gs)
    +(7- )Cu-8.5)]
    covaY (2)=-I
    , Covar of (u,2)
    -T-9-s)(-8)+(+-s Ys-c)+(s-c r) (3-8)+
    C4-8)Ct-9)
    cova(y)=-0|
    v CoVa of (yy)
    Sinu havingUcedahtu
    N-1 Re

    1-B + (tt.s)4 (s.s'+ (4-8.s)+|


    Eova of (9,y)= 23

    Noo, the cOVasian ce matún is

    S ov Ca,2) cov(79) 14-


    Cov(y2) Covy)J - 23

    Step- values and tigen vectors


    Compute eigen
    ,Eigen values: S is
    Covasuiance
    matu

    whew f s igen value


    det (S->
    I)=o z.

    I is idnrtity maoi

    de -A]-
    utu1-
    matyíz the
    det 4- - 0 For 2x2 is ad-be
    - 23- odetermirant
    d=/acd-be)
    (14-2)(13-A)- U)EU =o. 2X

    we

    quadiatic equati
    en,
    Solve thú bktar
    when we
    values a
    get the n0oti E) tigen
    A30-30 6 6 s
    Here >A , So , is ernud as
    frst principa) temarnent
    ,Eigenvec lors of A
    Efgen vectors os 0.
    nnn br nepre ssentrd
    be oepre
    take
    2X1 egen vector. vatue A
    taking eigen
    mabú x ,
    ahte aw

    S-T)O= lere w e

    -u23-n
    9-A -10.
    - 3-
    (4-A)U - 0=o 0

    From ea" O

    (14-)U,=U
    Equalizing
    to

    t-
    UEU 0-46.89

    Eigenv

    tp-yNomalize
    the eigen Vector

    |JuP+-16-38)
    e
    - 6-38

    JuP+V Jt+63e)2

    O.5574
    e
    0-8303
    the e w dataset
    Ste p-5 Desüvng

    Ffrst pcC
    PC
    JOTE
    For 1dimunsioma/ tve only calcutat PCi
    For 2 dinunsional e calculatt Pe, gPC

    etranspose of eigen vector


    P-[e5574 -08303
    Fiy oss7y -0:8303]
    FE3e52||
    8-8
    4-8
    3S7y -0.83 4s
    P 31361

    P5.6928
    Py 5.i2 38
    EX- EX2
    E X-3 EX-9
    3-736 S.6928-S.|238
    Pe -4.30S2
    reduced th dimnsíonA PCA
    using PCA
    Finallywe

    You might also like