Skip to main content

Artificial Prediction Markets for Clustering

  • Conference paper
  • First Online:
AI 2016: Advances in Artificial Intelligence (AI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9992))

Included in the following conference series:

  • 3113 Accesses

Abstract

There exist a lot of clustering algorithms for different purposes. But there is no general algorithm that can work without considering the context. This means clustering is not an application independent problem. So there is a need for more flexible frameworks to engineer new clustering algorithms for the problems at hand. One way to do this is by combining clustering algorithms. This is also called consensus or ensemble clustering in the literature. This paper presents a framework based on prediction markets mechanism for online clustering by combining different clustering algorithms. In real world, prediction markets are used to aggregate wisdom of the crowd for predicting outcome of events such as presidential election. By using the prediction markets mechanism and considering clustering algorithms as agents or market participants, an artificial prediction market is designed. Here clustering is viewed as a prediction problem. Beside working online, the proposed method provides flexibility in combining algorithms and also helps in tracking their performance in the market. Based on this framework an algorithm for center-based clustering algorithms (like k-means) is proposed. The first set of experiments show the flexibility of the algorithm on synthetic datasets. The results from the second set of experiments show that the algorithm also works well on real-world datasets.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    The term cluster and partition is used interchangeably.

References

  1. Storkey, A.: Machine learning markets. In: International Conference on Artificial Intelligence and Statistics (2011)

    Google Scholar 

  2. Barbu, A., Lay, N.: An introduction to artificial prediction markets for classification. J. Mach. Learn. Res. 13(1), 2177–2204 (2012)

    MathSciNet  MATH  Google Scholar 

  3. Vega-Pons, S., Ruiz-Shulcloper, J.: A survey of clustering ensemble algorithms. Int. J. Pattern Recogn. Artif. Intell. 25(03), 337–372 (2011)

    Article  MathSciNet  Google Scholar 

  4. Piantoni, J., Faceli, K., Sakata, T.C., Pereira, J.C., Souto, M.C.P.: Impact of base partitions on multi-objective and traditional ensemble clustering algorithms. In: Arik, S., Huang, T., Lai, W.K., Liu, Q. (eds.) ICONIP 2015. LNCS, vol. 9489, pp. 696–704. Springer, Heidelberg (2015). doi:10.1007/978-3-319-26532-2_77

    Chapter  Google Scholar 

  5. Wang, H., Shan, H., Banerjee, A.: Bayesian cluster ensembles. Stat. Anal. Data Min. 4(1), 54–70 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Strehl, A., Ghosh, J.: Cluster ensembles–a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583–617 (2003)

    MathSciNet  MATH  Google Scholar 

  7. Choromanska, A., Monteleoni, C.: Online clustering with experts. In: International Conference on Artificial Intelligence and Statistics, pp. 227–235 (2012)

    Google Scholar 

  8. Louren, A., et al.: Probabilistic consensus clustering using evidence accumulation. Mach. Learn. 98(1–2), 331–357 (2015)

    Article  MathSciNet  Google Scholar 

  9. Fred, A.L.N., Jain, A.K.: Data clustering using evidence accumulation. In: Proceedings of 16th International Conference on Pattern Recognition, vol. 4. IEEE (2002)

    Google Scholar 

  10. Von Luxburg, U., Williamson, R.C., Guyon, I.: Clustering: science or art? In: ICML Unsupervised and Transfer Learning, pp. 65–80 (2012)

    Google Scholar 

  11. Gjerstad, S., Hall, M.: Risk aversion, beliefs, and prediction market equilibrium. Economic Science Laboratory, University of Arizona (2005)

    Google Scholar 

  12. Manski, C.F.: Interpreting the predictions of prediction markets. Econ. Lett. 91(3), 425–429 (2006)

    Article  Google Scholar 

  13. Chen, Y., Pennock, D.M.: Designing markets for prediction. AI Mag. 31(4), 42–52 (2010)

    Google Scholar 

  14. Hanson, R.: Logarithmic markets coring rules for modular combinatorial information aggregation. J. Predict. Mark. 1(1), 3–15 (2012)

    Article  Google Scholar 

  15. Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics (2007)

    Google Scholar 

  16. Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53–65 (1987)

    Article  MATH  Google Scholar 

  17. Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825–2830 (2011)

    MathSciNet  MATH  Google Scholar 

  18. Rosenberg, A., Hirschberg, J.: V-measure: a conditional entropy-based external cluster evaluation measure. In: EMNLP-CoNLL, vol. 7 (2007)

    Google Scholar 

  19. Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sina Famouri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Famouri, S., Hashemi, S., Taheri, M. (2016). Artificial Prediction Markets for Clustering. In: Kang, B.H., Bai, Q. (eds) AI 2016: Advances in Artificial Intelligence. AI 2016. Lecture Notes in Computer Science(), vol 9992. Springer, Cham. https://doi.org/10.1007/978-3-319-50127-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50127-7_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50126-0

  • Online ISBN: 978-3-319-50127-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics