Week 9 Review: 7/30 - 8/3

By
At the start of this week I tried to clean and analyze more recent Tstat logs from January and July of this year. To my surprise, these files were formatted differently from my previous files which meant I had to clean and compile them differently as well. This posed many unexpected problems that took much longer to solve than I first imagined. Also planned for the week was to add a way to identify the "normal" cluster to the algorithm and perform quantitative analysis on the similarities of the calculated sequences with the log(throughput). All at the same time, this content needed to be put into my poster for the intern poster session by noon on Friday. After cleaning, I tried to add the cluster identification step to the algorithm. I was running behind, so without finishing it I moved on to calculating quantitative similarity metrics. I didn't want to consider the similarity of the sequences when throughput is high (because our values turn out to be low) so I took the Root Mean Square Error of the calculated sequence for points where throughput is less than 1 Mb/s.

S2C
S2C Recommended
C2S relevant
no_ports
RMS Error
0.2057
0.1962
0.2661
0.2035

Results of the RMS Error show that the S2C Recommended feature subset performed the best.
2

Comments

Post a Comment

Popular posts from this blog

Week 10 Review: 9/6 - 9/10

By
Image
I spent all my time this week preparing for the end of the internship. I submitted a poster for admittance to the Association for Computing Machinery poster competition to be held at the Super Computing Conference in Dallas, Texas this year. Beyond that, I spent a lot of time organizing files and finishing mandatory assignments. On Monday I submitted a minute long video to a small competition for giving elevator pitches and got an honorable mention award on Thursday, which was a tie between 5th and 6th place out of 10. Not bad for one hour of recording at midnight. Thursday was the poster session for all the interns and it went fairly well. The expense of organizing the event probably wasn't worth the amount of visitors that came to participate, though. I will say that I was one of the few interns that presented their poster to Michael Stewart Witherell, the director of the lab! Now that was cool! The research poster presented at the final poster session There was a lot plan
Read more

Research update 3 ~Alex

By
Image
I was looking over what I posted last time and actually couldn't believe how much we have accomplished in just one week. I also realized I never explained how Optimal Matching is. Optimal Matching to a non-Euclidean distance metric which can be used on large sequences of data. It works through a series of substitutions; the less substitution it takes to match two series the "further apart" they are.  Determining the substitution cost for missing values can be tricky especially for missing values due to the alignment of data. Too high of a cost can cause artificial clusters to form by the alignment variable, and too little can under represent possible similarities in the missing data. So determining the optimal cost for missing values, "NA cost", will be an important part of our analysis. Since I last posted there have been good times and bad times. Monday and Tuesday were good days. We worked through the methods used in the last publication on our data set to ge
Read more