search menu icon-carat-right cmu-wordmark

Encounter Complexes For Clustering Network Flow

January 2015 Presentation
Leigh B. Metcalf

In this presentation, Leigh defines and demonstrates an encounter complex for analyzing network flow.



Analyzing network flow is an arduous process. An encounter complex for analyzing network flow is defined and demonstrates how it can be used to reduce the amount of data to be analyzed as well as to highlight anomalous flows. A graph similarity measure is then defined to further cluster the network flows.