Share E-Book
Scan to open this page

Scan with your phone to open this page

Author: Kim Falk

Rating No ratings yet

Recommender systems are practically a necessity for keeping a site's content current, useful, and interesting to visitors. Recommender systems are everywhere, helping you find everything from movies to jobs, restaurants to hospitals, even romance. Practical Recommender Systems goes behind the curtain to show readers how recommender systems work and, more importantly, how to create and apply them for their site. This hands-on guide covers scaling problems and other issues they may encounter as their site grows.

AI Reading Assistant

Whole-book reading guide from stratified index samples; jump to passages in the text

AI guide
# Practical Recommender Systems ## 【One-Line Pitch】 A hands-on, code-first guide to building production-ready recommender systems—from collecting user behavior data to implementing collaborative filtering, matrix factorization, and hybrid algorithms—ideal for developers and data engineers who want to move beyond theory and ship real recommendations. ## 【Book Arc】 - **Opening (~0%–10%)**: Defines what recommender systems are, introduces the long-tail concept, and establishes key terminology (prediction, relevancy, recommendation, personalization, taste profile). Sets up the MovieGEEKs example site that runs throughout the book. - **Early (~10%–23%)**: Covers the foundational infrastructure—collecting user behavior evidence, building a client-side event logger, and designing the system architecture (MovieGEEKs, Analytics, Collector, Recs, Recommendation Builder). Introduces the white-box vs. black-box trade-off. - **Early–Middle (~23%–39%)**: Explains how to monitor and analyze the collected data, including conversion rate calculations, event distribution queries, and building a dashboard to visualize user profiles and genre preferences. - **Middle (~39%–48%)**: Dives into ratings—explicit vs. implicit feedback, binary matrices, time-based weighting, and how to calculate meaningful ratings from raw behavioral data. - **Middle–Late (~48%–80%)**: The algorithmic core: similarity measures, neighborhood-based collaborative filtering, content-based filtering, matrix factorization (Funk SVD), and hybrid recommenders (monolithic, mixed, ensemble, weighted, feature-weighted linear stacking). - **Late–Ending (~80%–100%)**: Advanced topics: ranking and learning-to-rank (including Bayesian Personalized Ranking), evaluation methodologies, and a look at the future of recommender systems. ## 【Key Takeaways】 - **Recommendations are calculated, not pushed** (Early): Unlike commercials, recommendations are derived from what the user likes, what similar users liked, and what's frequently requested—the book defines anything calculated from data as a recommendation. - **Implicit feedback beats explicit ratings** (Middle): Users often behave differently from what they say—people watch films they claim to hate. Implicit signals (plays, skips, completions) are easier to collect and often more truthful than star ratings. - **The long tail is the business case** (Early): Physical stores are limited by shelf space, but online recommenders can surface niche items—this is where the real value lies for e-commerce and content platforms. - **Evidence collection is a design decision** (Early): Every user action (scrolling, hovering, clicking, adding to list, playing) carries meaning, but context matters—skipping a song might mean exploration, while skipping a movie scene might mean boredom. - **White-box vs. black-box is a fundamental trade-off** (Early): Better recommendation quality often comes with harder explainability. If your system must explain its recommendations, you may need simpler algorithms or a separate explanation layer. - **Time matters in ratings** (Middle): Recent behavior should weigh more than old behavior—a Java developer who switched to Python shouldn't get Java book recommendations forever. Time-based decay functions add necessary nuance. - **Hybrids are the practical answer** (Late): No single algorithm wins; combining approaches through ensembles, switching, or feature-weighted linear stacking (FWLS) gives the best real-world results. - **Evaluation is non-negotiable** (Middle): You can't improve what you can't measure—conversion rates, event distributions, and offline evaluation metrics are essential for knowing whether your recommender actually helps. ## 【Reading Tips】 - **Skim the opening definitions** (chapters 1–2) if you're already familiar with recommender concepts—but don't skip the evidence collection chapter, as the author's implicit-feedback philosophy shapes everything later. - **Deep-read chapters 7–11** (similarity, collaborative filtering, content-based, matrix factorization): these are the algorithmic heart, and the author explains both intuition and implementation. - **The MovieGEEKs code is your friend**: Download it from GitHub and run the populate_logs.py script—the hands-on exercises make abstract concepts concrete, especially for the dashboard and evaluation chapters. - **Watch for the "levers to fiddle with" sections**: Each algorithm chapter ends with practical tuning parameters—these are gold for real-world deployment. - **Chapter 12 (hybrids) is worth extra time**: The FWLS approach is the most sophisticated technique in the book and represents how modern production systems actually work. ## 【Coverage Limits】 This guide covers the book's core progression from data collection through algorithm implementation and evaluation. The excerpts do not cover the final chapter on the future of recommender systems in detail, nor the full implementation specifics of the ranking chapter (BPR). ##
Page 16
ata to improve collaborative filtering recommenders 332 12.3 Mixed hybrid recommender 333 12.4 The ensemble 334 Switched ensemble recommender 335 ■ Weighted...
View in text
Excerpt 2
atabase that are most similar to the current user’s taste. 3 The top five items (normally it could be 100 items or more) are piped into the next pipeline ste...
View in text
Excerpt 3
o capture the behavior of users. The collector 49 e ’re b. You’ll find plumbing around the logger, which you’re welcome to look into, but it’s a web API that...
View in text
Excerpt 4
e goals? How many times has each of these events happened? Keep those things in mind as you continue through this chapter. You’re going to start by looking a...
View in text
Excerpt 5
biggest box office take during a weekend in 2017 in the US. Don’t know why earnings is a good measure of quality, but it often used. Figure 5.5 Top 10 highes...
View in text
Excerpt 6
sing business rules to provide sensible recommendations 6.3.3 Using segments Cold start is an irritating problem, but little can be done about it. Then again...
View in text
Excerpt 7
values('movie_id')) \ .values('user_id') \ .annotate(intersect=Count('user_id')).filter(intersect__gt=min) Collaborative filtering in the neighborhoodCollabo...
View in text
Excerpt 8
in this chapter it’s crystal clear what you need to do now. If not, here’s a little list of things you’ll implement. They’re also shown in figure 8.11. Find...
View in text
Tags
AI categories
ProgrammingBackendData
ISBN: 1617292702
Publish Year: 2019
Language: English
Pages: 410
File Format: PDF
File Size: 14.8 MB
Text Preview (First 20 pages)
Registered users can read the full content for free

Register as a Gaohf Library member to read the complete e-book online for free and enjoy a better reading experience.

Generating text preview…