Skip to main content
SpringerLink
Log in

You Have the Choice: The Borda Voting Rule for Clustering Recommendations

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11695))

Included in the following conference series:

Abstract

Automatic recommendations are very popular in E-commerce, online shopping platforms, video on-demand services, or music-streaming. However, recommender systems often suggest too many related items such that users are unable to cope with the huge amount of recommendations. In order to avoid losing the overview in recommendations, clustering algorithms like k-means are a very common approach to manage large and confusing sets of items. In this paper, we present a clustering technique, which exploits the Borda social choice voting rule for clustering recommendations in order to produce comprehensible results for a user. Our comprehensive benchmark evaluation and experiments regarding quality indicators show that our approach is competitive to k-means and confirms the high quality of our Borda clustering approach.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.imdb.com/.

  2. 2.

    Jaccard: \(J(A, B) = |A\cap B| / |A \cup B|\) for two sets A and B. \(J_\delta (A,B)= 1 - J(A,B)\).

  3. 3.

    http://www.jmdb.de/.

References

  1. Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: ACM-SIAM 2007, SODA 2007, Philadelphia, PA, USA, pp. 1027–1035 (2007)

    Google Scholar 

  2. Bandyopadhyay, S., Saha, S.: Unsupervised Classification. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-32451-2

    Book  MATH  Google Scholar 

  3. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE 2001, pp. 421–430. IEEE, Washington, DC (2001)

    Google Scholar 

  4. Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. 1(2), 224–227 (1979)

    Article  Google Scholar 

  5. Debord, B.: An axiomatic characterization of Borda’s k-choice function. Soc. Choice Welfare 9(4), 337–343 (1992)

    Article  MathSciNet  Google Scholar 

  6. Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)

    Article  Google Scholar 

  7. Jing, L., Ng, M.K., Huang, J.Z.: An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Trans. Knowl. Data Eng. 19(8), 1026–1041 (2007)

    Article  Google Scholar 

  8. Kamishima, T., Akaho, S.: Efficient clustering for orders. In: Zighed, D.A., Tsumoto, S., Ras, Z.W., Hacid, H. (eds.) Mining Complex Data. Studies in Computational Intelligence, vol. 165, pp. 261–279. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-88067-7_15

    Chapter  Google Scholar 

  9. Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE TPAMI 24(7), 881–892 (2002)

    Article  Google Scholar 

  10. Kastner, J., Endres, M., Kießling, W.: A pareto-dominant clustering approach for pareto-frontiers. In: EDBT/ICDT 2017, Venice, Italy, 21–24 March 2017, Workshop Proceedings, vol. 1810 (2017)

    Google Scholar 

  11. Kastner, J., Ranitovic, N., Endres, M.: The Borda social choice movie recommender. In: BTW 2019, 4–8 March 2019 in Rostock, Germany, pp. 499–502 (2019)

    Google Scholar 

  12. Kießling, W., Endres, M., Wenzel, F.: The preference SQL system - an overview. Bull. Tech. Commitee Data Eng. 34(2), 11–18 (2011)

    Google Scholar 

  13. Kim, D., Kim, K.S., Park, K.H., Lee, J.H., Lee, K.M.: A Music Recommendation System with a Dynamic k-means Clustering Algorithm. In: ICMLA (2007)

    Google Scholar 

  14. Knijnenburg, B.P., Willemsen, M.C., Gantner, Z., Soncu, H., Newell, C.: Explaining the user experience of recommender systems. User Model. User-Adap. Inter. 22(4–5), 441–504 (2012)

    Article  Google Scholar 

  15. Kunaver, M., Porl, T.: Diversity in recommender systems a survey. Know. Based Syst. 123(C), 154–162 (2017)

    Article  Google Scholar 

  16. Macqueen, J.: Some methods for classification and analysis of multivariate observations. In: In 5-th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)

    Google Scholar 

  17. Mohamad, I., Usman, D.: Standardization and its effects on K-Means Clustering Algorithm. Res. J. Appl. Sci. Eng. Technol. 6, 3299–3303 (2013)

    Article  Google Scholar 

  18. Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review. SIGKDD Explor. Newsl. 6(1), 90–105 (2004)

    Article  Google Scholar 

  19. Ricci, F., Rokach, L., Shapira, B.: Recommender systems: introduction and challenges. In: Ricci, F., Rokach, L., Shapira, B. (eds.) Recommender Systems Handbook, pp. 1–34. Springer, Boston, MA (2015). https://doi.org/10.1007/978-1-4899-7637-6_1

    Chapter  MATH  Google Scholar 

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

    Article  Google Scholar 

  21. Sarstedt, M., Mooi, E.: Cluster analysis. In: A Concise Guide to Market Research. STBE, pp. 273–324. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-53965-7_9

    Chapter  Google Scholar 

  22. Sen, A.: The possibility of social choice. Am. Econ. Rev. 89(3), 349–378 (1999)

    Article  Google Scholar 

  23. Ukkonen, A.: Clustering algorithms for chains. J. Mach. Learn. Res. 12, 1389–1423 (2011)

    MathSciNet  MATH  Google Scholar 

  24. Virmani, D., Shweta, T., Malhotra, G.: Normalization Based K Means Clustering Algorithm. CoRR abs/1503.00900 (2015)

    Google Scholar 

  25. Wan, S.J., Wong, S.K.M., Prusinkiewicz, P.: An algorithm for multidimensional data clustering. ACM Trans. Math. Softw. 14(2), 153–162 (1988)

    Article  Google Scholar 

  26. Wei, S., Ye, N., Zhang, S., Huang, X., Zhu, J.: Collaborative filtering recommendation algorithm based on item clustering and global similarity. In: BIFE 2012, pp. 69–72, August 2012

    Google Scholar 

  27. Zhang, Z., Zhang, J., Xue, H.: Improved K-means clustering algorithm. In: Proceedings of the Congress on Image and Signal Processing 2008, CISP 2008, vol. 5, pp. 169–172, May 2008

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Augsburg, Universitätsstr. 6a, 86159, Augsburg, Germany

    Johannes Kastner

  2. University of Passau, Innstr. 43, 94032, Passau, Germany

    Markus Endres

Authors
  1. Johannes Kastner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Endres
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Johannes Kastner or Markus Endres .

Editor information

Editors and Affiliations

  1. University of Maribor, Maribor, Slovenia

    Tatjana Welzer

  2. Alpen-Adria Universität Klagenfurt, Klagenfurt, Austria

    Johann Eder

  3. University of Maribor, Maribor, Slovenia

    Vili Podgorelec

  4. University of Maribor, Maribor, Slovenia

    Aida Kamišalić Latifić

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kastner, J., Endres, M. (2019). You Have the Choice: The Borda Voting Rule for Clustering Recommendations. In: Welzer, T., Eder, J., Podgorelec, V., Kamišalić Latifić, A. (eds) Advances in Databases and Information Systems. ADBIS 2019. Lecture Notes in Computer Science(), vol 11695. Springer, Cham. https://doi.org/10.1007/978-3-030-28730-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-28730-6_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-28729-0

  • Online ISBN: 978-3-030-28730-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation