AUTOMATA REGRESSION OF MINE WITH SOFTWARE MECHANISM AND WEIGHT TRANPORTATION REGRESSION AND OTHER ALGORITHM AROUND IT AUTOMATICALLY AND VERY NEW SOFTWARE OF OVER THEM MECHANISM
AUTOMAATA LINEAR REGRESSION:
automata regression in it there is imagine binary has given 110101010 depnedend varibale and indepndent varibel 01010101010 and thye manage the state of automatea then there wil be one centric so how these independent varibel will chnage in dependnet vairbel becayse these are two diffeet machine so we need expression methods so we need heer expression tree of both we draw any how thta tree and connect them then by distance of between node and edge then connection between by operator be clerfyies and we clalate that distance by hwo much anad or or operation need betwen to reac indepdent varible to depndent varible to trvales closely then we connect node by and or or operator between them make linear equation of the varibel that present in the postiion and non postion i ama here declaring the whole software mechanism imagine 110101010 for firts lienar equaion then other linear equation for dependent variable then other equation for dependent variable we creates then same wway we cretae for independent varible lenat equations like we cretae firts equation for dependent varible is x1+x2+x4 for example 1101 then for dependent 0101 we create x2+x4 then by that we cretae many so for eahc dependent varibel equation we make autaomata state and samae for independnet variable then we make sperate tree for each dependen variable or all vriables a binary tree then same for inepden vribale then we make for varibale and conssnatnt then we connecte or and and operation means or gate and and operation over dependnt ad indepnednet variable tree to see to find whihc is closure to menas whihc where relation sis exists for it we make lpp programes for it and we chekc the very clsoe numebr when we reahc very clsoe numebr we chnage the state of inddepent varible insidely like if exmaple there is 0110 and chnages then it become 0101 means why we chnage becaus very clsoe numebr insdiely for idneppednet variabael with dependent varibel anad with tree with all three will check and auatomata state must to sastifies here we give the greedy forms we give the greedy forms a test condtion testing data that testing or trianing data will be the grief grief training set by which we maian tain anotehr autaoma state and tree that will be the decison tree to compares the tree of both indepndent and depndenet and combined of them and then chnaaing them by auatomata state means we check in tranaing set automata sate they come under or not or under this lpp root number lying or not
all fifteen algorithm of data science will make undder it easily to this softwrae and algorithm
WEIGHT TRANSPORTATION REGRESSION ALGORITHM or VARIANT MODEL TO USE :->
weight transporataion regression algorithm in it we produces the wieght of dependent and indepdepen varibel and tranport by the transport operation reserach which weight will trasport first by any traning set or thrid variables set then they have relation with each other like changes in their grvaity chnages in theri tranprotaion time chnage sin tehri trnaaprotaion behaves that will chnages weight relation betwen dependent and indepnent varibel here wieght variables or variants under the third varibale groups as group will increase it increase weight or decrase in trasport operartion reserahc model to use
all fifterrn algorhtm in data science like svm and other like clusters could be works so on in weight linear regression
Comments
Post a Comment