INTERCEPT TREE LIKE OTHER TREE OF MINE IN DATA SCIENCE

if we store data in intercept forms means x+by+cz=d or any other so in that manners a1,a2,a3,a4x+b1,b2,b3,b4,b5y+c1,c2,c3,c4,c4z=d so how thsi will in gretest order and or lowest order means atoc or ctoa and c a b and a b c and b a c that coudl be the order of intercept, then they would place in cnetr of inetrcet d and ax by cz in which prder they are great or low or disorderment \intercep tree could be used in data science to factor data in relavnce and irrelevanc eview from multiple hierearchy where one data is super data and oen data is non super data imagine we have ax+by=c then we factor this c in center and ax a1x and b1y and because by+c2>a2x and b2y but here it could create for euqla intercept of data in thsi algorithm in this algotithm ccoul use in where ax+by=c where we take c as intercpet anad ax and by it elft or right anay way here one thing that thsi tree cnat give vaualtion to less and greater then , in it less or greater cnaat valaution that its less comes in rihgt even maxmimum from center could come in any where for examaple for exmaple a1x+b1y is equal to c1 >c and >ax amd > by c is in the shape of ax---c---by then c will add to a1x+c and b1y+c then ax(second)---a1x+c(first) in left and by(second)---b1y+c(first) in right then ---c1--- if there is another is coming a2x+b2y=c2 and its less thne a1x then then then if then in center theer will be c then in left driection a2x b2y beneath c2 then a1x+c1 then its benetah under c in left direction and then rihgt in right direction (by) beneath b1y+c1 so thsi is all intecep x/a+y/b=1 or bx+ay=ab tree in whihc data is interencte and we hav eto make tree as intercept of the data it totally differ from binaayr it have answer of ythe gerater conclasion we make ax+by =c as a tree we took in center c and left or right dreiciton ax and by then we called another line or liner eqaion if c>c1 then it will at it was but if c1>c ten c1 will replce the equation and then letf and right becasye a1x and b1y conslaion is high if high came then c1 then left or right any things then again another comes who is less then only a1x like a2x+b2y=c2 where a2x+b2y>a1x so it could left or right or ot could come on normal ways if ax+by =c is given then in center will be ax---c---by then if ax+by=c1ax and a1x>ax then it goes to ax then ax will replace by d1 then in d1 there will be three leaf nodes a1x b1y c1z then in a1x then if a2x+b2y+c2z=d2>b1y and

Comments

Popular posts from this blog

HADMARD MATRIX WITH NEGATION AND ACCPETANCe

gpu or people are running wrong in all about whether it and whether its any company what ther are saynig they are in intiaally career of stage of of gpu saying that so :from royal socie_y i am saying to tycoon company

A.I. CASH or MACHINE LEARNING CASH