DataScience SG Meetup - RecSys, Beyond the Baseline

[ recsys machinelearning ] · 2 min read

I’ve benefited greatly from attending meetups over the years.

Exception speakers would share about the challenges, failures, solutions, and outcome from their professional and personal projects. Especially insightful were the failures and their thought process on how to overcome them.

Having just completed a small personal project on recommender systems over the holidays, I decided to share at the first meetup of the year for DataScience SG.

Image

The audience was very active and engaging, and it made the couple hours spent working on slides worth it. The feedback received on the project was useful, and it was great practice for public speaking.

What’s the talk about?

The talk covers my efforts over the past few weeks exploring the baselines for recommender systems and mixing in novel approaches from graph and NLP.

It discusses the end-to-end, from data acquisition (of Amazon data) and preparation, implementation of various recommenders, optimization, and result comparisons (metrics, runtime, etc.).

Interested in learning more? Links to the slides and associated articles below. (Warning: The slides have plenty of metrics, tables, and graphs and could be headache inducing 😵)

Articles:

Slides:

P.S. Looking for the code for this? Available on github: recsys-nlp-graph


If you found this useful, please cite this write-up as:

Yan, Ziyou. (Jan 2020). DataScience SG Meetup - RecSys, Beyond the Baseline. eugeneyan.com. https://eugeneyan.com/speaking/recommender-systems-beyond-the-baseline-talk/.

or

@article{yan2020baseline,
  title   = {DataScience SG Meetup - RecSys, Beyond the Baseline},
  author  = {Yan, Ziyou},
  journal = {eugeneyan.com},
  year    = {2020},
  month   = {Jan},
  url     = {https://eugeneyan.com/speaking/recommender-systems-beyond-the-baseline-talk/}
}

Share on:

Browse related tags: [ recsys machinelearning ]

Join 9,100+ readers getting updates on machine learning, RecSys, LLMs, and engineering.