Skip to main content

2017 | OriginalPaper | Buchkapitel

Evolutionary Game Network Reconstruction by Memetic Algorithm with l 1/2 Regularization

verfasst von : Kai Wu, Jing Liu

Erschienen in: Simulated Evolution and Learning

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Evolutionary Game (EG) theory is effective approach to understand and analyze the widespread cooperative behaviors among individuals. Reconstructing EG networks is fundamental to understand and control its collective dynamics. Most existing approaches extend this problem to the l 1-regularization optimization problem, leading to suboptimal solutions. In this paper, a memetic algorithm (MA) is proposed to address this network reconstruction problem with l 1/2 regularization. The problem-specific initialization operator and local search operator are integrated into MA to accelerate the convergence. We apply the method to evolutionary games taking place in synthetic and real networks, finding that our approach has competitive performance to eight state-of-the-art methods in terms of effectiveness and efficiency.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Han, X., Shen, Z., Wang, W.X., Di, Z.: Robust reconstruction of complex networks from sparse data. Phys. Rev. Lett. 114, 028701 (2015)CrossRef Han, X., Shen, Z., Wang, W.X., Di, Z.: Robust reconstruction of complex networks from sparse data. Phys. Rev. Lett. 114, 028701 (2015)CrossRef
2.
Zurück zum Zitat Wang, W.X., Lai, Y.C., Grebogi, C., Ye, J.: Network reconstruction based on evolutionary-game data via compressive sensing. Phys. Rev. X 1, 021021 (2011) Wang, W.X., Lai, Y.C., Grebogi, C., Ye, J.: Network reconstruction based on evolutionary-game data via compressive sensing. Phys. Rev. X 1, 021021 (2011)
3.
Zurück zum Zitat Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58, 267–288 (1996)MathSciNetMATH Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58, 267–288 (1996)MathSciNetMATH
4.
Zurück zum Zitat Moscato, P.: On evolution, search, optimization, genetic algorithms and martialarts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Rep., 826 (1989) Moscato, P.: On evolution, search, optimization, genetic algorithms and martialarts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Rep., 826 (1989)
5.
Zurück zum Zitat Chen, X., Ong, Y.S., Lim, M.H., Tan, K.C.: A multi-facet survey on memetic computation. IEEE Trans. Evol. Comput. 15(5), 591–607 (2011)CrossRef Chen, X., Ong, Y.S., Lim, M.H., Tan, K.C.: A multi-facet survey on memetic computation. IEEE Trans. Evol. Comput. 15(5), 591–607 (2011)CrossRef
6.
Zurück zum Zitat Ong, Y.S., Lim, M.H., Chen, X.: Research frontier-memetic computation–past, present & future. IEEE Comput. Intell. Mag. 5(2), 24–31 (2010)CrossRef Ong, Y.S., Lim, M.H., Chen, X.: Research frontier-memetic computation–past, present & future. IEEE Comput. Intell. Mag. 5(2), 24–31 (2010)CrossRef
7.
Zurück zum Zitat Herrity, K.K., Gilbert, A.C., Tropp, J.A.: Sparse approximation via iterative thresholding. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 624–627 (2006) Herrity, K.K., Gilbert, A.C., Tropp, J.A.: Sparse approximation via iterative thresholding. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 624–627 (2006)
8.
Zurück zum Zitat Nowak, M.A., May, R.M.: Evolutionary games and spatial chaos. Nature 359, 826–829 (1992)CrossRef Nowak, M.A., May, R.M.: Evolutionary games and spatial chaos. Nature 359, 826–829 (1992)CrossRef
10.
Zurück zum Zitat Szabó, G., Tőke, C.: Evolutionary prisoner’s dilemma game on a square lattice. Phys. Rev. E 58, 69 (1998)CrossRef Szabó, G., Tőke, C.: Evolutionary prisoner’s dilemma game on a square lattice. Phys. Rev. E 58, 69 (1998)CrossRef
11.
Zurück zum Zitat Xu, Z.B., Guo, H., Wang, Y., Zhang, H.: Representative of L 1/2 regularization among L q (0 < q < 1) regularizations: an experimental study based on phase diagram. Acta Automatica Sinica 38(7), 1225–1228 (2012)MathSciNet Xu, Z.B., Guo, H., Wang, Y., Zhang, H.: Representative of L 1/2 regularization among L q (0 < q < 1) regularizations: an experimental study based on phase diagram. Acta Automatica Sinica 38(7), 1225–1228 (2012)MathSciNet
12.
Zurück zum Zitat Xu, Z.B., Chang, X., Xu, F., Zhang, H.: L 1/2 regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013–1027 (2012)CrossRef Xu, Z.B., Chang, X., Xu, F., Zhang, H.: L 1/2 regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013–1027 (2012)CrossRef
13.
Zurück zum Zitat Eshellman, L.J.: Real-coded genetic algorithms and interval-schemata. Found. Genetic Algorithms 2, 187–202 (1993) Eshellman, L.J.: Real-coded genetic algorithms and interval-schemata. Found. Genetic Algorithms 2, 187–202 (1993)
14.
Zurück zum Zitat Neubauer, A.: A theoretical analysis of the non-uniform mutation operator for the modified genetic algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 93–96 (1997) Neubauer, A.: A theoretical analysis of the non-uniform mutation operator for the modified genetic algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 93–96 (1997)
15.
Zurück zum Zitat Knuth, D.E.: The Stanford Graph Base: A Platform for Combinatorial Computing. Addison-Wesley, Reading (1993)MATH Knuth, D.E.: The Stanford Graph Base: A Platform for Combinatorial Computing. Addison-Wesley, Reading (1993)MATH
16.
Zurück zum Zitat Grau, J., Grosse, I., Keilwagen, J.: PRROC: computing and visualizing precision-recall and receiver operating characteristic curves in R. Bioinformatics 31(15), 2595–2597 (2015)CrossRef Grau, J., Grosse, I., Keilwagen, J.: PRROC: computing and visualizing precision-recall and receiver operating characteristic curves in R. Bioinformatics 31(15), 2595–2597 (2015)CrossRef
17.
Zurück zum Zitat Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)CrossRefMATH Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)CrossRefMATH
18.
Zurück zum Zitat Erdős, P., Rényi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290–297 (1959)MathSciNetMATH Erdős, P., Rényi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290–297 (1959)MathSciNetMATH
20.
Zurück zum Zitat Newman, M.E., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A 263(4), 341–346 (1999)MathSciNetCrossRefMATH Newman, M.E., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A 263(4), 341–346 (1999)MathSciNetCrossRefMATH
22.
23.
Zurück zum Zitat Donoho, D.L., Tsaig, Y.: Fast solution of l1 norm minimization problems when the solution may be sparse. IEEE Trans. Inf. Theory 54(11), 4789–4812 (2008)CrossRefMATH Donoho, D.L., Tsaig, Y.: Fast solution of l1 norm minimization problems when the solution may be sparse. IEEE Trans. Inf. Theory 54(11), 4789–4812 (2008)CrossRefMATH
24.
Zurück zum Zitat Malioutov, D.M., Cetin, M., Willsky, A.S.: Homotopy continuation for sparse signal representation. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 733–736 (2005) Malioutov, D.M., Cetin, M., Willsky, A.S.: Homotopy continuation for sparse signal representation. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 733–736 (2005)
25.
Zurück zum Zitat Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183–202 (2009)MathSciNetCrossRefMATH Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183–202 (2009)MathSciNetCrossRefMATH
27.
Zurück zum Zitat Bertsekas, D.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont (1982)MATH Bertsekas, D.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont (1982)MATH
28.
Zurück zum Zitat Kim, S., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-pointmethod for large-scale l1-regularized least squares. IEEE J. Sel. Topics Sig. Process. 1(4), 606–617 (2007)CrossRef Kim, S., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-pointmethod for large-scale l1-regularized least squares. IEEE J. Sel. Topics Sig. Process. 1(4), 606–617 (2007)CrossRef
29.
Zurück zum Zitat Wu, K., Liu, J., Wang, S.: Reconstructing networks from profit sequences in evolutionary games via a multiobjective optimization approach with lasso initialization. Sci. Rep. 6, 37771 (2016)CrossRef Wu, K., Liu, J., Wang, S.: Reconstructing networks from profit sequences in evolutionary games via a multiobjective optimization approach with lasso initialization. Sci. Rep. 6, 37771 (2016)CrossRef
30.
Zurück zum Zitat Newman, M.E.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)MathSciNetCrossRef Newman, M.E.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)MathSciNetCrossRef
32.
Zurück zum Zitat Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396–405 (2003)CrossRef Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396–405 (2003)CrossRef
33.
Zurück zum Zitat Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)CrossRef Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)CrossRef
Metadaten
Titel
Evolutionary Game Network Reconstruction by Memetic Algorithm with l 1/2 Regularization
verfasst von
Kai Wu
Jing Liu
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-68759-9_2