<html><body><div style="font-family: garamond,new york,times,serif; font-size: 12pt; color: #000000"><div>Sophie Qiu will present her MSE talk, "Streaming data analytics and visualization: An illustrative example" on Monday, May 08, 2017 at 11am in CS 301.</div><div><br data-mce-bogus="1"></div><div>The members of her committee are Jen Rexford (adviser) and Walter Willinger (Niksun).</div><div><br></div><div data-marker="__QUOTED_TEXT__">
<div>
<div style="margin: 0px;" data-mce-style="margin: 0px;">Everyone is invited to attend her talk. Her abstract follows below.</div>
<div style="margin: 0px;" data-mce-style="margin: 0px;"><span><br>
</span></div>
<div style="margin: 0px;" data-mce-style="margin: 0px;"><span>The emergence of streaming data or “data in motion” has motivated the development of new “streaming” algorithms that provide up-to-date answers to continuous queries; that is,
queries that are issued once and then run continuously as new data streams in. For example, in the context of network traffic management, continuous queries over<b> </b>streaming Netflow data may be used to detect anomalies in the network as they happen (e.g.,
performance degradation, onset of an attack). </span></div>
<div style="margin: 0px;" data-mce-style="margin: 0px;"><span><br>
</span></div>
<div style="margin: 0px;" data-mce-style="margin: 0px;"><span><span>The main objective of this thesis is to demonstrate with an illustrative example how the continuous stream of answers produced by existing streaming algorithms can be visualized
in an effective and meaningful manner. In particular, such visualization efforts should be able to capture the dynamics that is inherent in the answers that result from such continuous queries. </span><span>Our illustrative example concerns the class of frequent
itemset mining algorithms for streaming data, a generalization of the well-know algorithms for finding frequent items (e.g., top-k) in streaming data. Using the output of these streaming algorithms as input, our proposed visualization method c</span>ombines
two previously-considered types of flow diagrams (i.e., sankey and alluvial diagrams) to depict the temporal evolution of frequent itemsets. We apply our visualization method to real-world streaming data (e.g., unsampled Netflow data from a stub network,
DNS records from a university network) and illustrate its basic features and capabilities.</span></div>
</div>
<div style="margin: 0px;" data-mce-style="margin: 0px;"><br></div></div></div></body></html>