A Scalable Clustering Algorithm for Serendipity in Recommender Systems

Anup Anand Deshmukh, Pratheeksha Nair, Shrisha Rao. A Scalable Clustering Algorithm for Serendipity in Recommender Systems. In Hanghang Tong, Zhenhui Jessie Li, Feida Zhu, Jeffrey Yu, editors, 2018 IEEE International Conference on Data Mining Workshops, ICDM Workshops, Singapore, Singapore, November 17-20, 2018. pages 1279-1288, IEEE, 2018. [doi]

@inproceedings{DeshmukhNR18,
  title = {A Scalable Clustering Algorithm for Serendipity in Recommender Systems},
  author = {Anup Anand Deshmukh and Pratheeksha Nair and Shrisha Rao},
  year = {2018},
  doi = {10.1109/ICDMW.2018.00182},
  url = {https://doi.org/10.1109/ICDMW.2018.00182},
  researchr = {https://researchr.org/publication/DeshmukhNR18},
  cites = {0},
  citedby = {0},
  pages = {1279-1288},
  booktitle = {2018 IEEE International Conference on Data Mining Workshops, ICDM Workshops, Singapore, Singapore, November 17-20, 2018},
  editor = {Hanghang Tong and Zhenhui Jessie Li and Feida Zhu and Jeffrey Yu},
  publisher = {IEEE},
  isbn = {978-1-5386-9288-2},
}