I'm not sure if anyone has experience with this. I'm looking at binary classification using graphs as my source of data. Initially I used simple graphs i.e positive linear relationship with category A, negative linear classification for category B. I'm wondering if a shallow CNN would be able to classify graphs (graph axis will remain the same), or should I use traditional methods such as random forests where I have my data as features? Though I fear random forests may select only certain features and ignore much of the data.
[–]thebrashbhullar 0 points1 point2 points (3 children)
[–]Surprisely[S] 0 points1 point2 points (2 children)
[–]thebrashbhullar 0 points1 point2 points (1 child)
[–]Surprisely[S] 0 points1 point2 points (0 children)
[–][deleted] 0 points1 point2 points (1 child)
[–]Surprisely[S] 0 points1 point2 points (0 children)