A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Content-Based Filtering

Graduate Depth 90 in the knowledge graph I know this Set as goal
502prerequisites beneath it
See this on the map →
Recommendation SystemsFeature Engineering and Selection
content-based item-features user-profile

Core Idea

Content-based filtering recommends items similar to those a user previously liked, using rich item features (genre, actors, keywords). User profiles aggregate interaction history; recommendations match profiles to item features using similarity metrics. This approach handles new items well but requires detailed metadata and can lead to narrow recommendations.

Explainer

From your introduction to recommendation systems, you know the basic challenge: given a user's history, predict what they will like next. Content-based filtering approaches this by focusing on *what* items are, rather than *who else* liked them. If you enjoyed a science fiction novel with themes of artificial intelligence and a dystopian setting, a content-based system looks for other items sharing those features — regardless of whether any other user has rated them. This stands in contrast to collaborative filtering, which relies on finding similar users.

The system works in two stages. First, each item is represented as a feature vector describing its attributes. For movies, features might include genre, director, cast, plot keywords, and release year. For articles, features could be extracted using techniques from feature engineering — TF-IDF vectors of the text, named entities, topic tags. Second, the system builds a user profile by aggregating the feature vectors of items the user has interacted with, weighted by their ratings or engagement signals. If a user has watched and rated highly ten action movies and two romantic comedies, their profile will have strong weights on action-related features. Recommendation then becomes a similarity computation: score each candidate item by how closely its feature vector matches the user profile, typically using cosine similarity or dot product.

Content-based filtering has a distinctive strength: it handles the cold-start problem for items elegantly. A brand-new movie that no one has rated yet can still be recommended based on its metadata — its genre, director, and plot description are enough to match it against user profiles. Collaborative filtering cannot do this because it needs rating data from other users. Content-based systems are also transparent: you can explain a recommendation by pointing to the matching features ("recommended because you liked other films by this director").

The approach has real limitations, however. It requires rich, structured metadata for every item, which can be expensive to create and maintain. More fundamentally, content-based filtering tends toward over-specialization: it recommends items similar to what the user already likes, creating a filter bubble that never surfaces surprising or diverse content. A user who has only watched comedies will never be recommended a documentary, no matter how much they might enjoy it. This is why production systems often combine content-based filtering with collaborative methods in hybrid approaches, using content features to handle new items and cold starts while relying on collaborative signals to introduce serendipity and capture preferences that metadata alone cannot express.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionSine, Cosine, and Tangent RatiosTrigonometric Ratios ReviewVectors in Two DimensionsVector Operations: Addition, Subtraction, and Scalar MultiplicationDot Product (Inner Product in R^n)Matrix MultiplicationDeterminants of 2×2 and 3×3 MatricesInvertible Matrices and Matrix InversesSystems of Linear Equations and Matrix FormGaussian Elimination and Row ReductionRow Echelon Form and Back SubstitutionThe Standard Matrix of a Linear TransformationComposition of Linear TransformationsChange of Basis and Coordinate SystemsDiagonalizationPrincipal Component AnalysisDimensionality Reduction TechniquesFeature Engineering and SelectionContent-Based Filtering

Longest path: 91 steps · 502 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.