CoChat
Sign Up
Cited by 35Recommender Systems and TechniquesEthics and Social Impacts of AIInformation Retrieval and Search Behavior

Algorithmic and Ethical Aspects of Recommender Systems in e-Commerce

Open access
Paraschakis, Dimitris·2018
DOI 10.24834/2043/24268
Open this paper in CoChat — free accountOpen PDF

Abstract

Finally, I want to thank our industry

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.24834/2043/24268

Cites

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Information for algorithmic profiling is typically obtained directly from a person's interactions with a system or indirectly inferred from algorithmically assembled groups of individuals.

    “This information is typically obtained directly, from when a person interacts with a given system, or indirectly, inferred from algorithmically assembled groups of individuals (Paraschakis 2018).”

    From The ethics of algorithms: key problems and solutions (2022) · cites this paper as Paraschakis 2018

  • Algorithmic profiling takes place over an indefinite period of time, in which individuals are categorised according to a system's internal logic, and their profiles are updated as new information is obtained about them.

    “Algorithmic profiling takes place over an indefinite period of time, in which individuals are categorised according to a system's internal logic, and their profiles are updated as new information is obtained about them.”

    From The ethics of algorithms: key problems and solutions (2022) · cites this paper as Paraschakis 2018

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

The citation lists haven’t been fetched yet

References 191 · Cited by 35

Research works printed but not linked: 40

  1. A. Bar, L. Rokach, G. Shani, B. Shapira, and A. Schclar. Improv- ing simple collaborative filtering models using ensemble meth- ods. In Z.-H. Zhou, F. Roli, and J. Kittler, editors, Multiple Clas- sifier Systems: 11th International Workshop, MCS 2013, Nan- jing, China, May 15-17, 2013. Proceedings, pages 1-12. Springer Berlin Heidelberg, 2013.
  2. S. Barocas and H. Nissenbaum. Big data end run around anonymity and consent. In J. Lane, V. Stodden, S. Bender, and H. Nissenbaum, editors, Privacy, Big Data, and the Pub- lic Good. Frameworks for Engagement, chapter 2, pages 44-75. Cambridge University Press, 2014.
  3. J. Beel, S. Langer, M. Genzmehr, B. Gipp, C. Breitinger, and A. N ürnberger. Research paper recommender system evalua- tion: A quantitative literature survey. In Proc. of the International Workshop on Reproducibility and Replication in Recommender Systems Evaluation, RepSys '13, 2013.
  4. M. Blondel, A. Fujino, and N. Ueda. Convex factorization ma- chines. In A. Appice, P. P. Rodrigues, V. Santos Costa, J. Gama, A. Jorge, and C. Soares, editors, Machine Learning and Knowl- edge Discovery in Databases: European Conference, ECML PKDD 2015, Porto, Portugal, September 7-11, 2015, Proceedings, Part II, pages 19-35. Springer International Publishing, 2015.
  5. L. Breiman. Bagging predictors. Machine Learning, 24(2):123- 140, Aug 1996.
  6. B. Brodén, M. Hammar, B. J. Nilsson, and D. Paraschakis. Ban- dit algorithms for e-commerce recommender systems: Extended abstract. In Proc. of the 11th ACM Conference on Recommender Systems, RecSys '17, pages 349-349. ACM, 2017.
  7. B. Brodén, M. Hammar, B. J. Nilsson, and D. Paraschakis. En- semble recommendations via Thomson Sampling: an experi- mental study within e-commerce. In Proc. of the 23rd ACM Con- ference on Intelligent User Interfaces (IUI). ACM, in press.
  8. R. Burke, M. P. O'Mahony, and N. J. Hurley. Robust col- laborative recommendation. In F. Ricci, L. Rokach, and B. Shapira, editors, Recommender Systems Handbook, pages 961-995. Springer US, 2015.
  9. S. Caron and S. Bhagat. Mixing bandits: A recipe for improved cold-start recommendations in a social network. In Proc. of the 7th Workshop on Social Network Mining and Analysis, SNAKDD '13, pages 11:1-11:9. ACM, 2013.
  10. N. Craswell. Mean reciprocal rank. In L. Liu and M. T. Özsu, editors, Encyclopedia of Database Systems, pages 1703-1703. Springer US, 2009.
  11. P. Cremonesi, F. Garzotto, and R. Turrin. Investigating the per- suasion potential of recommender systems from a quality per- spective: An empirical study. ACM Trans. Interact. Intell. Syst., 2(2):11:1-11:41, 2012.
  12. M. Deshpande and G. Karypis. Item-based top-n recommen- dation algorithms. ACM Trans. Inf. Syst., 22(1):143-177, Jan. 2004.
  13. Z. Gantner, S. Rendle, C. Freudenthaler, and L. Schmidt- Thieme. Mymedialite: A free recommender system library. In Proc. of the 5th ACM Conference on Recommender Systems, Rec- Sys 2011, 2011.
  14. F. Guillou. On recommendation systems in a sequential context. PhD thesis, Université Charles de Gaulle -Lille III, Dec. 2016.
  15. A. Gunawardana and G. Shani. Evaluating recommender sys- tems. In F. Ricci, L. Rokach, and B. Shapira, editors, Recom- mender Systems Handbook, pages 265-308. Springer US, 2015.
  16. J. L. Herlocker, J. A. Konstan, and J. Riedl. Explaining col- laborative filtering recommendations. In Proc. of the 2000 ACM Conference on Computer Supported Cooperative Work, CSCW '00, pages 241-250. ACM, 2000.
  17. K.-H. Huang and H.-T. Lin. Linear upper confidence bound al- gorithm forźcontextual bandit problem with piled rewards. In Proceedings, Part II, of the 20th Pacific-Asia Conference on Ad- vances in Knowledge Discovery and Data Mining -Volume 9652, PAKDD 2016, pages 143-155. Springer-Verlag New York, Inc., 2016.
  18. C. C. Johnson. Logistic matrix factorization for implicit feed- back data. In NIPS Workshop on Distributed Matrix Computa- tions, 2014.
  19. T. Kamishima and S. Akaho. Personalized pricing recommender system: Multi-stage epsilon-greedy approach. In Proc. of the 2nd International Workshop on Information Heterogeneity and Fusion in Recommender Systems, pages 57-64. ACM, 2011.
  20. T. Koc ák, M. Valko, R. Munos, and S. Agrawal. Spectral thomp- son sampling. In Proc. of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI'14, pages 1911-1917. AAAI Press, 2014.
  21. Y. Koren. Factorization meets the neighborhood: A multifaceted collaborative filtering model. In Proc. of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Min- ing, KDD '08, pages 426-434. ACM, 2008.
  22. Y. Koren. Factor in the neighbors: Scalable and accurate collab- orative filtering. ACM Trans. Knowl. Discov. Data, 4(1):1:1-1:24, Jan. 2010.
  23. S. Li, A. Karatzoglou, and C. Gentile. Collaborative filtering ban- dits. In Proc. of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '16, pages 539-548. ACM, 2016.
  24. S. Li, B. Wang, S. Zhang, and W. Chen. Contextual combinato- rial cascading bandits. In Proc. of the 33rd International Confer- ence on International Conference on Machine Learning -Volume 48, ICML'16, pages 1245-1253. JMLR.org, 2016.
  25. A. M. McDonald and C. L. Faith. The cost of reading privacy policies. I/S: A Journal of Law and Policy for the Information Society, 4:540-565, 2008.
  26. J. H. Moor. Just consequentialism and computing. Ethics and Inf. Technol., 1(1):61-65, Jan. 1998.
  27. A. Narayanan and V. Shmatikov. De-anonymizing social net- works. In 30th IEEE Symposium on Security and Privacy, pages 173-187. IEEE, 2009.
  28. M. Quadrana, A. Karatzoglou, B. Hidasi, and P. Cremonesi. Per- sonalizing session-based recommendations with hierarchical re- current neural networks. In Proc. of the Eleventh ACM Con- ference on Recommender Systems, RecSys '17, pages 130-137. ACM, 2017.
  29. R. Salakhutdinov and A. Mnih. Probabilistic matrix factoriza- tion. In Proc. of the 20th International Conference on Neural Infor- mation Processing Systems, NIPS'07, pages 1257-1264.
  30. C. Sandvig, K. Hamilton, K. Karahalios, and C. Langbort. Audit- ing algorithms: Research methods for detecting discrimination on internet platforms. In Pre-conference of the 64th annual meet- ing of the International Communication Association, 2014.
  31. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Incremental singular value decomposition algorithms for highly scalable rec- ommender systems. pages 27-28, 2002.
  32. J. B. Schafer, J. A. Konstan, and J. Riedl. E-commerce recom- mendation applications. Data Min. Knowl. Discov., 5(1-2):115- 153, Jan. 2001.
  33. H. Stormer. Improving e-commerce recommender systems by the identification of seasonal products. In Conference on Artifi- cial Intelligence, pages 92-99, 2007.
  34. H. Tavani. Ethics and technology: Controversies, questions and strategies for ethical computing. Wiley, 2015.
  35. V. K. Vaishnavi and W. Kuechler, Jr. Design science research methods and patterns: Innovating information and communi- cation technology. Auerbach Publications, 1st edition, 2007.
  36. S. B. van der Zon. Predictive performance and discrimination in unbalanced classification. Master's thesis, Eindhoven Univer- sity of Technology, 2016.
  37. E. G. Vozalis and K. G. Margaritis. Recommender systems: An experimental comparison of two filtering algorithms. In Proc. of the Ninth Panhellenic Conference in Informatics, 2003.
  38. D. H. Wolpert. Original contribution: Stacked generalization. Neural Netw., 5(2):241-259, Feb. 1992.
  39. M. Wu. Collaborative filtering via ensembles of matrix factoriza- tion. In KDDCup 2007, pages 43-47, 2007.
  40. X. Zhao, W. Zhang, and J. Wang. Interactive collaborative filter- ing. In Proc. of the 22nd ACM international conference on Con- ference on Information and Knowledge Management, CIKM '13, pages 1411-1420. ACM, 2013.

Authors
Paraschakis, D.
Corresponding author
Paraschakis, Dimitris
Publisher
Malmo University Library
Published
2018-01-01
DOI
10.24834/2043/24268
OpenAlex
W2785291028
Cited by
35
References
191
Citations by year
2025: 1 · 2024: 1 · 2023: 24 · 2022: 2 · 2021: 3 · 2020: 3 · 2019: 1
Type
dissertation
Language
en
Open access
Locations
  • KTH Publication Database DiVA (KTH Royal Institute of Technology) (submittedVersion, other-oa)
  • Malmö University Publications (Malmö University) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Social Sciences › Safety Research › Ethics and Social Impacts of AI
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
Keywords
recommender systems, e-commerce, algorithmic ethics, recommendation algorithms

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review