Author:
Johnson J.,Giraud-Carrier C.
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.
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Theoretical Computer Science
Reference58 articles.
1. Irregular leadership changes in 2014: Forecasts using ensemble, split-population duration models;Beger;International Journal of Forecasting,2016
2. Learning long-term dependencies with gradient descent is difficult;Bengio;IEEE Transactions on Neural Networks,1994
3. Power and centrality: A family of measures;Bonacich;American Journal of Sociology,1987
4. Calculating status with negative relations;Bonacich;Social Networks,2004
5. B.E. Boser, I.M. Guyon and V.N. Vapnik, A training algorithm for optimal margin classifiers, in: Proceedings of the Fifth Annual Workshop on Computational Learning Theory, 1992, pp. 144–152.