3d - Figuring out if data is linearly separable -


so i've been given bunch of 3d data points of 2 types , b in list format , question trying solve asking me @ data points , determine if think linearly separable or not(just looking @ points).

however don't know how go telling if they're linearly separable looking @ points. there hints or tricks or sort of method can use determine answer?

the number of data points pretty small. there's 25 points in group , 40 in group b.

suppose there linear page separate data. suppose page written as:

z = mx + ny + o 

for fining page, should find m, n , o in such way z>0 data in , z<0 data in b. solved constraint programming techniques.


Comments

Popular posts from this blog

linux - Does gcc have any options to add version info in ELF binary file? -

android - send complex objects as post php java -

charts - What graph/dashboard product is facebook using in Dashboard: PUE & WUE -