machine learning - Prediction of sets -


assume have 4 transactions a,a,a,b. assume, has been grouped b single group. there similar transactions c,c,g,c,c,c , c,c,b,c , c,c,b,c,c grouped. here see c has been grouped b , g c&b have been grouped twice compared c&g there lots of transactions these.

when new set of transactions come c,c,b,a,a,g need suggest each of these transactions, other transactions should paired with. in example, prediction should follows.

c -> b (predicted since had max probability) c -> b (predicted since had max probability) b -> c (predicted) -> b (predicted) -> b (predicted) g -> c (predicted) 

1) simple case approach/ ml technique needed achieve this? 2) if transactions become more complicated a,a,a,b,n grouped, how able handle case.

i can go through transactions , calculate probability of each transactions in group, there better approach should considering. packages available these problems?


Comments

Popular posts from this blog

javascript - gulp-nodemon - nodejs restart after file change - Error: listen EADDRINUSE events.js:85 -

Fatal Python error: Py_Initialize: unable to load the file system codec. ImportError: No module named 'encodings' -

javascript - oscilloscope of speaker input stops rendering after a few seconds -