A Novel Bayesian Similarity Measure for Recommender Systems

Guibing Guo, Jie Zhang, Neil Yorke-Smith

Abstract

Traditional collaborative filtering metrics like Pearson Correlation Coefficient (PCC) and Cosine Similarity (COS) often struggle with data sparsity, as they primarily evaluate the direction of rating vectors while ignoring the amount of evidence (vector length). This paper presents a Bayesian Similarity (BS) measure that utilizes the Dirichlet distribution to model multi-level rating distances. By incorporating prior beliefs and explicitly removing "chance correlations," the BS measure achieves higher accuracy and greater stability than traditional geometric approaches.

Introduction

Collaborative filtering (CF) is a cornerstone of modern recommendation engines. At its heart lies the challenge of accurately measuring user similarity. Historically, metrics such as PCC and COS have been the standard. However, these metrics suffer from significant limitations, particularly the "flat-value," "opposite-value," "single-value," and "cross-value" problems. These issues stem from a fundamental flaw: traditional metrics treat similarity as a static geometric property, failing to account for the confidence or "evidence" provided by the number of co-rated items.

The Bayesian Similarity Framework

The proposed Bayesian Similarity (BS) measure addresses these shortcomings by treating similarity as an inference problem.

Modeling with the Dirichlet Distribution

Instead of comparing vectors directly, the BS measure analyzes the absolute distance between ratings for shared items ($d = |r_u - r_v|$). These distances are modeled using a Dirichlet distribution, which naturally handles multi-level categorical data.

Incorporating Evidence and Priors

The Bayesian approach starts with "pseudo-observations"—a prior assumption that user ratings are random. As more co-rated items (evidence) are observed, the posterior distribution is updated. This ensures that similarity scores are grounded in statistical significance rather than fluke overlaps.

Chance Correlation Removal

A key innovation of the BS measure is the mathematical subtraction of "chance correlation." This factor represents the probability that two users appear similar purely by luck due to a small sample size. By removing this noise, the system identifies truly similar users more reliably.

Figure 1: Stability of similarity measures as a function of rating vector length. Note how BS remains consistent while PCC is highly volatile with low evidence.

Experimental Evaluation

The researchers tested the BS measure against standard benchmarks (PCC, COS, MSD) and modern alternatives (PIP, SM) across six datasets: BookCrossing, Epinions, Flixster, FilmTrust, and MovieLens (100K and 1M).

Key Results

The BS measure consistently outperformed competing metrics in terms of Mean Absolute Error (MAE). Statistical tests (t-tests) confirmed that these improvements were significant ($p < 0.01$).

Figure 6: MAE comparison across FilmTrust, MovieLens 100K, and MovieLens 1M datasets. BS consistently achieves the lowest error across varying neighborhood sizes (K-NN).

Beyond accuracy, the BS measure demonstrated superior ranking performance, yielding higher Precision, Recall, and F-measure scores on the MovieLens 100K dataset.

Discussion and Future Work

The BS measure's strength lies in its stability over sparsity. While traditional PCC is highly volatile when users have few ratings in common, the Bayesian approach provides a consistent baseline that evolves gracefully.

Future research could enhance this model by:

  1. Incorporating Metadata: Integrating non-numeric data like item categories or user demographics.
  2. Temporal Weighting: Accounting for the time ratings were issued to capture shifting user preferences.
  3. Hyperparameter Optimization: Automating the tuning of the bias constant ($\delta$) and evidence scale ($c$).

Conclusion

By moving from simple geometric calculations to a Bayesian inference model, the BS measure effectively addresses the long-standing issues of sparsity and noise in collaborative filtering. It provides a more robust and accurate foundation for building next-generation recommender systems.

Summary updated

Abstract

Collaborative filtering, a widely-used user-centric recommendation technique, predicts an item's rating by aggregating its ratings from similar users. User similarity is usually calculated by cosine similarity or Pearson correlation coefficient. However, both of them consider only the direction of rating vectors, and suffer from a range of drawbacks. To solve these issues, we propose a novel Bayesian similarity measure based on the Dirichlet distribution, taking into consideration both the direction and length of rating vectors. Further, our principled method reduces correlation due to chance. Experimental results on six real-world data sets show that our method achieves superior accuracy.
BibTeX
@inproceedings{guo2013novel,
  author = {Guibing Guo and Jie Zhang and Neil Yorke-Smith},
  title = {{A Novel Bayesian Similarity Measure for Recommender Systems}},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year = {2013},
}
Figure