Today at BGSU I went to a class about data science articles that Dr. Zirbel is teaching for the new data science PhD program at BGSU. For this class, we read and discussed articles in the still-emerging field of data science, which includes machine learning. At this session, we were talking about a paper written last year in which the researcher developed an algorithm to flag insurance claims as fraudulent for a Spanish insurance company. The discussion was very interesting because while the article showed promise with its results, it was very inconsistent in its terminology and barely described its methods. For example, it mentioned that it had ~1400 numerical variables extracted from each insurance claim, but no further information. Additionally, their method involved using principal component analysis to reduce the number of variables to only ~300, but this was also confusing, because there was nothing that suggested the variability in the principal components made it easier to distinguish fraud.
Anyway, we also talked about the RNA research and possible directions to go with that, and I’m beginning to get an idea for the specific problem I want to explore. While we were discussing the TSP for finding path lengths, we were looking at heatmaps and we found some were missing discrepancies between RNAs. Dr. Zirbel was wondering if you could write an algorithm, that chooses what distances to compute, that approximates the solution in n log (n) time. This is very difficult, because balancing accuracy and time constraints is very complex. I found a few papers that address somewhat similar problems, so I think tomorrow I will read those and try and develop an intuition.
So far, attending graduate classes has been very fun, and I also really enjoy thinking about the problems we’ve discussed and how they have very direct applications.
