A Novel Context-Aware Deep Learning Algorithm for Enhanced Movie Recommendation Systems
Bibliographic record
Abstract
Recommendation systems serve as a pivotal solution to address the increasing issue of information overload.While traditional recommendation algorithms have been grounded primarily on user-item interactions, the significance of a user's contextual information influencing decision-making has often been overlooked.Such neglect becomes more evident in the realm of systems integrating contextual mechanisms, which encounter pronounced data sparsity challenges.Existing studies in contextual recommendation systems tend to treat all contextual features uniformly as influencers of user decisions.Yet, a prevalent dilemma is the frequent absence of contextual data, leading to potential misallocations of contextual features.To mitigate these challenges, a novel deep learning-based recommendation system, termed the CAW-NeuMF Model, has been designed.Accompanying this model, a Context-aware Weighted high-order Tensor Factorization algorithm (CAWTF) has been introduced.This algorithm facilitates the calculation of correlations between user ratings in varied contexts, relying on the said context.Additionally, it ascertains the weight of context features grounded on the user ratings correlation.Such a process aids in isolating the most influential contextual features, thereby amplifying the efficiency of personalized recommendations.Empirical evaluations using the LDOS CoMoDa dataset revealed that the proposed model substantially enhances prediction score accuracy.Comparative analyses against alternative recommendation models further affirmed the superior efficacy of the introduced approach.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".