Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Fattah, Polla; Aickelin, Uwe; Wagner, Christian (2016)
Languages: English
Types: Unknown
Subjects: Computer Science - Artificial Intelligence, Computer Science - Computer Science and Game Theory
An important issue in public goods game is whether player's behaviour changes over time, and if so, how significant it is. In this game players can be classified into different groups according to the level of their participation in the public good. This problem can be considered as a concept drift problem by asking the amount of change that happens to the clusters of players over a sequence of game rounds. In this study we present a method for measuring changes in clusters with the same items over discrete time points using external clustering validation indices and area under the curve. External clustering indices were originally used to measure the difference between suggested clusters in terms of clustering algorithms and ground truth labels for items provided by experts. Instead of different cluster label comparison, we use these indices to compare between clusters of any two consecutive time points or between the first time point and the remaining time points to measure the difference between clusters through time points. In theory, any external clustering indices can be used to measure changes for any traditional (non-temporal) clustering algorithm, due to the fact that any time point alone is not carrying any temporal information. For the public goods game, our results indicate that the players are changing over time but the change is smooth and relatively constant between any two time points.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] U. Fischbacher and S. Ga¨chter, “Social Preferences, Beliefs, and the Dynamics of Free Riding in Public Goods Experiments,” American Economic Review, vol. 100, no. 1, pp. 541-556, mar 2010.
    • [2] G. Widmer and M. Kubat, “Learning in the presence of concept drift and hidden contexts,” Machine learning, vol. 23, no. 1, pp. 69-101, 1996.
    • [3] A. Tsymbal, “The problem of concept drift: definitions and related work,” Computer Science Department, Trinity College Dublin, 2004.
    • [4] R. Elwell and R. Polikar, “Incremental Learning of Concept Drift in Nonstationary Environments,” IEEE Transactions on Neural Networks, vol. 22, no. 10, pp. 1517-1531, 2011.
    • [5] R. Garnett and S. J. Roberts, “Learning from Data Streams with Concept Drift,” Technical Report PARG-08-01, Dept. of Engineering Science, University of Oxford, 2008.
    • [6] L. Xiaofeng and G. Weiwei, “Study on a Classification Model of Data Stream based on Concept Drift,” vol. 9, no. 5, pp. 363-372, 2014.
    • [7] M. Baena-Garcia, J. del Campo-Avila, R. Fidalgo, A. Bifet, R. Gavalda, and R. Morales-Bueno, “Early Drift Detection Method,” 4th ECML PKDD International Workshop on Knowledge Discovery from Data Streams, pp. 77-86, 2006.
    • [8] M. Harel, S. Mannor, R. El-Yaniv, and K. Crammer, “Concept Drift Detection Through Resampling,” Proceedings of the 31st International Conference on Machine Learning (ICML-14), pp. 1009-1017, 2014.
    • [9] I. Ntoutsi, M. Spiliopoulou, and Y. Theodoridis, “Summarizing Cluster Evolution in Dynamic Environments,” in Computational Science and Its Applications - ICCSA 2011. Springer Berlin Heidelberg, 2011, vol. 6783, pp. 562-577.
    • [10] M. Spiliopoulou, E. Ntoutsi, Y. Theodoridis, and R. Schult, “MONIC and Followups on Modeling and Monitoring Cluster Transitions,” Machine Learning and Knowledge Discovery in Databases, vol. 8190, no. 2013, pp. 622-626, 2013.
    • [12] M. Halkidi, Y. Batistakis, and M. Vazirgiannis, “Cluster validity methods: part I,” ACM Sigmod Record, vol. 31, no. 2, pp. 40-45, 2002.
    • [13] M. Meila, “Comparing clusterings by the variation of information,” Learning theory and Kernel machines: 16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003: proceedings, p. 173, 2003.
    • [14] A. P. Bradley, “The use of the area under the ROC curve in the evaluation of machine learning algorithms,” Pattern Recognition, vol. 30, no. 7, pp. 1145-1159, jul 1997.
    • [15] I. Kaul, I. Grungberg, and M. Stern, “Global public goods,” Global public goods, 1999.
    • [16] U. Fischbacher, S. Gachter, S. Quercia, and S. Ga¨chter, “The behavioral validity of the strategy method in public good experiments,” Journal of Economic Psychology, vol. 33, no. 4, pp. 897-913, aug 2012.
    • [17] U. Fischbacher, S. Ga¨chter, and E. Fehr, “Are people conditionally cooperative? Evidence from a public goods experiment,” Economics Letters, vol. 71, pp. 397-404, 2001.
    • [18] E. Rendo´n and I. Abundez, “Internal versus External cluster validation indexes,” International Journal of computers and communications, vol. 5, no. 1, pp. 27-34, 2011.
    • [19] M. J. Zaki and M. J. Meira, Data Mining and Analysis: Fundamental Concepts and Algorithms. New York: Cambridge University Press, 2014.
    • [20] L. Vendramin, R. J. Campello, and E. R. Hruschka, “Relative clustering validity criteria: A comparative overview,” Statistical Analysis and Data Mining, vol. 4, no. 3, pp. 209-235, 2010.
    • [21] X. Robin, N. Turck, A. Hainard, N. Tiberti, F. Lisacek, C. Sanchez, and M. Mu¨ller, “pROC: an open-source package for R and S+ to analyze and compare ROC curves,” BMC Bioinformatics, vol. 12, p. 77, 2014.
    • [22] T. Fawcett, “An introduction to ROC analysis,” Pattern Recognition Letters, vol. 27, no. 8, pp. 861-874, jun 2006.
    • [23] D. D. J. Hand and R. J. R. Till, “A simple generalisation of the area under the ROC curve for multiple class classification problems,” Machine Learning, pp. 171-186, 2001.
    • [24] M. Spiliopoulou, I. Ntoutsi, Y. Theodoridis, and R. Schult, “Monic: modeling and monitoring cluster transitions,” Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 706-711, 2006.
    • [25] S. Gu¨nnemann, H. Kremer, C. Laufkotter, and T. Seidl, “Tracing evolving clusters by subspace and value similarity,” Advances in Knowledge Discovery and Data Mining, vol. 6635, pp. 444-456, 2011.
    • [26] B. Hawwash and O. O. Nasraoui, “Stream-dashboard: a framework for mining, tracking and validating clusters in a data stream,” Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, pp. 109-117, 2012.
    • [27] P. Kalnis, N. Mamoulis, and S. Bakiras, “On discovering moving clusters in spatio-temporal data,” Advances in Spatial and Temporal Databases, vol. 3633, pp. 364-381, 2005.
    • [28] U. Fischbacher and S. Gachter, “Social preferences, beliefs, and the dynamics of free riding in public good experiments,” 2008.
    • [29] C. Keser and F. V. Winden, “Conditional cooperation and voluntary contributions to public goods,” The Scandinavian Journal of Economics, vol. 102, no. 1, pp. 23-39, 2000.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article