Contextual Preference Collaborative Measure Framework Based on Belief System

Hang Yu, Wei Wei, Zheng Tan, Jinglei Liu

This paper, published in the journal Computer Science (计算机科学), presents a novel approach to understanding user preferences by moving beyond simple "like/dislike" ratings and into the nuanced world of contextual preferences.

TL;DR

The authors propose a collaborative framework that builds a "belief system" based on user consensus to measure the "interestingness" of contextual preference rules. By balancing common consensus (belief) with unique user behavior (deviation), the framework identifies both highly reliable and deeply personalized recommendations, outperforming state-of-the-art methods like CONTENUM and TKO.

What Problem Does This Paper Address?

Traditional recommendation systems often rely on association rules (e.g., "people who buy milk also buy bread"). However, these ignore context (e.g., "I prefer milk over soy milk only when I'm buying bread for breakfast").

The authors identify four major hurdles in current contextual preference research:

  1. Human Intervention: Many systems require users to manually define their preferences, which is tedious and often inaccurate.
  2. Data Sparsity: The number of known user preferences is tiny compared to the vast space of possible contextual combinations.
  3. High Dimensionality: Adding context (location, time, weather) makes the data mathematically complex to process.
  4. The "Interestingness" Gap: Standard metrics like "support" and "confidence" tend to find obvious, boring rules while missing the "hidden gems" that are unique to specific users.

Methods

The researchers built a multi-stage framework to automate the discovery and measurement of these preferences:

  • Rule Representation: They define rules in the format $i^+ \succ i^- | X$, meaning "prefer item $i^+$ over $i^-$ given context $X$."
  • PRA (Preference Rules Aggregation) Algorithm: To find a baseline of "common sense," the authors developed PRA. It calculates the "average internal distance" between rules to prune redundant information, creating a concise set of consensus preferences with minimal information loss.
  • The Belief System: Inspired by belief functions in AI, they treat the consensus preferences as a "Common Belief."
  • Belief vs. Deviation: They introduce two key metrics:
  • Belief Degree: How well a specific rule aligns with the general consensus.
  • Deviation Degree: How much a rule differs from the norm.
  • Scalable Interestingness Framework: They propose a formula where a rule is "interesting" if it is either extremely reliable (high belief) or uniquely personalized (high deviation).
  • Specific Algorithms: They implemented two versions of this framework: IMCos (using weighted cosine similarity) and IMCov (using correlation coefficients).

Datasets

The framework was evaluated using two massive, industry-standard datasets:

  • MovieLens-10M: ~10 million ratings from ~71,000 users.
  • MovieLens-20M: ~20 million ratings from ~138,000 users. These datasets were used to extract contextual preference rules based on movie genres and user tags.

Key Insights and Ideas

  • Consensus as a Filter: By establishing what "most people" think first, the system can more easily spot when a user is following a general trend versus when they have a unique, "personalized" taste.
  • Vectorization for Speed: By representing rules as high-dimensional vectors, the authors could use matrix calculations to significantly speed up the discovery process compared to traditional symbolic logic.
  • The PRA "Sweet Spot": The PRA algorithm managed to prune about 25% of redundant rules while only losing 4-5% in recall, proving that a smaller, smarter "belief system" is more efficient than a massive, raw one.

Key Results

The authors compared their IMCos and IMCov algorithms against two recent benchmarks, CONTENUM and TKO:

  • Superior Accuracy: IMCov consistently showed the highest precision. At a "Top-10" recommendation level, its accuracy was roughly 17% higher than unfiltered results and beat the benchmarks by 5-10%.
  • Better Recall: The framework was much better at "covering" the actual preferences of users, especially in cases where contextual data was sparse.
  • Personalization: Unlike traditional methods that favor the most popular rules, this framework successfully identified "personalized" rules (high deviation) that were highly accurate for specific sub-groups of users.

Limitations and Future Work

  • Cold Start for Consensus: The "Common Belief" system relies on having a large enough pool of users to establish a baseline. If the user base is too small, the consensus becomes unstable.
  • Negative Preferences: The current model focuses on "A is better than B." The authors note that explicitly accounting for "negative preferences" (what users actively dislike) could further refine the model.
  • Machine Learning Integration: The authors suggest that future versions could use machine learning to automatically "learn" the best weights for the belief and deviation functions, rather than using fixed mathematical formulas.

Summary updated

Abstract

To reduce the human intervention in the preference measure process,this article proposes a preference collaborative measure framework based on an updated belief system,which is also capable of improving the accuracy and efficiency of preferen-ce measure algorithms.Firstly,the distance of rules and the average internal distance of rulesets are proposed for specifying the relationship between the rules.For discovering the most representative preferences that are common in all users,namely common preference,a algorithm based on average internal distance of ruleset,PRA algorithm,is proposed,which aims to finish the discoveryprocess with minimum information loss rate.Furthermore,the concept of Common belief is proposed to update the belief system,and the common preferences are the evidences of updated belief system.Then,under the belief system,the proposed belief degree and deviation degree are used to determine whether a rule confirms the belief system or not and classify the preference rules into two kinds(generalized or personalized),and eventually filters out Top-K interesting rules relying on belief degree and deviation degree.Based on above,a scalable interestingness calculation framework that can apply various formulas is proposed for accurately calculating interestingness in different conditions.At last,IMCos algorithm and IMCov algorithm are proposed as exemplars to verify the accuracy and efficiency of the framework by using weighted cosine similarity and correlation coefficients as belief degree.In experiments,the proposed algorithms are compared to two state-of-the-art algorithms and the results show that IMCos and IMCov outperform than the other two in most aspects.
BibTeX
@misc{yu2025contextual,
  author = {Hang Yu and Wei Wei and Zheng Tan and Jinglei Liu},
  title = {{Contextual Preference Collaborative Measure Framework Based on Belief System}},
  year = {2025},
  eprint = {2503.24328},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2503.24328},
}
Figure