https://doi.org/10.1140/epjds/s13688-020-00233-y
Regular article
Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection
1
University of Notre Dame, Notre Dame, USA
2
U.S. Army Research Lab, Adelphi, USA
3
Purdue University, West Lafayette, USA
* e-mail: nchawla@nd.edu
Received:
23
August
2018
Accepted:
24
May
2020
Published online:
9
June
2020
Complex systems, represented as dynamic networks, comprise of components that influence each other via direct and/or indirect interactions. Recent research has shown the importance of using Higher-Order Networks (HONs) for modeling and analyzing such complex systems, as the typical Markovian assumption in developing the First Order Network (FON) can be limiting. This higher-order network representation not only creates a more accurate representation of the underlying complex system, but also leads to more accurate network analysis. In this paper, we first present a scalable and accurate model, BuildHON+, for higher-order network representation of data derived from a complex system with various orders of dependencies. Then, we show that this higher-order network representation modeled by BuildHON+ is significantly more accurate in identifying anomalies than FON, demonstrating a need for the higher-order network representation and modeling of complex systems for deriving meaningful conclusions.
Key words: Higher-order network / Dynamic network / Anomaly detection / Sequential data
© The Author(s), 2020