Affiliations: Department of Computer Science, Brigham Young University, Provo, UT, USA
Correspondence:
[*]
Corresponding author: C. Giraud-Carrier, Department of Computer Science, Brigham Young University, USA. E-mail: cgc@cs.byu.edu.
Abstract: While increasingly complex algorithms are being developed for graph classification in highly-structured domains, such as image processing and climate forecasting, they often lead to over-fitting and inefficiency when applied to human interaction networks where the confluence of cooperation, conflict, and evolutionary pressures produces chaotic environments. We propose a graph transformation approach for efficient classification in chaotic human systems that is based on game theoretic, network theoretic, and chaos theoretic principles. Graph structural properties are compiled into time-series that are then transposed into the frequency domain to offer a dynamic view of the system for classification. We propose a set of benchmark data sets and show through experiments that the approach is efficient and appropriate for many dynamic networks in which agents both compete and cooperate, such as social media networks, stock markets, political campaigns, legislation, and geopolitical events.
Keywords: Graph classification, graph time-series, chaotic systems
