book

Practical Recommender Systems

Name: Practical Recommender Systems
Author: Kim Falk
ISBN: 9781617292705

by Kim Falk

February 2019

Beginner to intermediate

432 pages

13h 29m

English

Manning Publications

Audiobook available

Read now

Unlock full access

Copyright
Brief Table of Contents
Table of Contents
Preface
Acknowledgments
About this book
About the author
About the cover illustration
Part 1. Getting ready for recommender systems
Chapter 1. What is a recommender?
1.1. Real-life recommendations1.2. Taxonomy of recommender systems1.3. Machine learning and the Netflix Prize1.4. The MovieGEEKs website1.5. Building a recommender systemSummary

Chapter 2. User behavior and how to collect it
2.1. How (I think) Netflix gathers evidence while you browse2.2. Finding useful user behavior2.3. Identifying users2.4. Getting visitor data from other sources2.5. The collector2.6. What users in the system are and how to model themSummary
Chapter 3. Monitoring the system
3.1. Why adding a dashboard is a good idea3.2. Doing the analytics3.3. Personas3.4. MovieGEEKs dashboardSummary
Chapter 4. Ratings and how to calculate them
4.1. User-item preferences4.2. Explicit or implicit ratings4.3. Revisiting explicit ratings4.4. What are implicit ratings?4.5. Calculating implicit ratings4.6. How to implement implicit ratings4.7. Less frequent items provide more valueSummary
Chapter 5. Non-personalized recommendations
5.1. What’s a non-personalized recommendation?5.2. How to make recommendations when you have no data5.3. Implementing the chart and the groundwork for the recommender system component5.4. Seeded recommendationsSummary
Chapter 6. The user (and content) who came in from the cold
6.1. What’s a cold start?6.2. Keeping track of visitors6.3. Addressing cold-start problems with algorithms6.4. Those who doesn’t ask, won’t know6.5. Using association rules to start recommending things fastSummary
Part 2. Recommender algorithms
Chapter 7. Finding similarities among users and among content
7.1. Why similarity?7.2. Essential similarity functions7.3. k-means clustering7.4. Implementing similaritiesSummary
Chapter 8. Collaborative filtering in the neighborhood
8.1. Collaborative filtering: A history lesson8.2. Calculating recommendations8.3. Calculating similarities8.4. Amazon’s algorithm to precalculate item similarity8.5. Ways to select the neighborhood8.6. Finding the right neighborhood8.7. Ways to calculate predicted ratings8.8. Prediction with item-based filtering8.9. Cold-start problems8.10. A few words on machine learning terms8.11. Collaborative filtering on the MovieGEEKs site8.12. What’s the difference between association rule recs and collaborative recs?8.13. Levers to fiddle with for collaborative filtering8.14. Pros and cons of collaborative filteringSummary
Chapter 9. Evaluating and testing your recommender
9.1. Business wants lift, cross-sales, up-sales, and conversions9.2. Why is it important to evaluate?9.3. How to interpret user behavior9.4. What to measure9.5. Before implementing the recommender...9.6. Types of evaluation9.7. Offline evaluation9.8. Offline experiments9.9. Implementing the experiment in MovieGEEKs9.10. Evaluating the test set9.11. Online evaluation9.12. Continuous testing with exploit/exploreSummary
Chapter 10. Content-based filtering
10.1. Descriptive example10.2. Content-based filtering10.3. Content analyzer10.4. Extracting metadata from descriptions10.5. Finding important words with TF-IDF10.6. Topic modeling using the LDA10.7. Finding similar content10.8. Creating the user profile10.9. Content-based recommendations in MovieGEEKs10.10. Evaluation of the content-based recommender10.11. Pros and cons of content-based filteringSummary
Chapter 11. Finding hidden genres with matrix factorization
11.1. Sometimes it’s good to reduce the amount of data11.2. Example of what you want to solve11.3. A whiff of linear algebra11.4. Constructing the factorization using SVD11.5. Constructing the factorization using Funk SVD11.6. Doing recommendations with Funk SVD11.7. Funk SVD implementation in MovieGEEKs11.8. Explicit vs. implicit data11.9. Evaluation11.10. Levers to fiddle with for Funk SVDSummary
Chapter 12. Taking the best of all algorithms: Implementing hybrid recommenders
12.1. The confused world of hybrids12.2. The monolithic12.3. Mixed hybrid recommender12.4. The ensemble12.5. Feature-weighted linear stacking (FWLS)12.6. ImplementationSummary
Chapter 13. Ranking and learning to rank
13.1. Learning to rank an example at Foursquare13.2. Re-ranking13.3. What’s learning to rank again?13.4. Bayesian Personalized Ranking13.5. Implementation of BPR13.6. Evaluation13.7. Levers to fiddle with for BPRSummary
Chapter 14. Future of recommender systems
14.1. This book in a few sentences14.2. Topics to study next14.3. What’s the future of recommender systems?14.4. Final thoughts
Index
List of Figures
List of Tables
List of Listings

Content preview from Practical Recommender Systems

Chapter 7. Finding similarities among users and among content

Similarity can be calculated in many ways, and we’ll look at most of those. In this chapter

You’ll gain an understanding of what similarity and its cousin, distance, are.
You’ll look at how to calculate similarity between sets of items.
With similarity functions, you’ll measure how alike two users are, using the ratings they’ve given to content.
It sometimes helps to group users, so you’ll do that using the k-means clustering algorithm.

Chapter 6 described non-personalized recommendations and the association rules. Association rules are a way to connect content without looking at the item or the users who consumed them. Personalized recommendations, however, almost always contain ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781617292705Publisher Support Publisher Website Errata Page

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Practical Recommender Systems

by Kim Falk

Chapter 7. Finding similarities among users and among content

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.