Hybrid Recommendation Network Model with a Synthesis of Social Matrix Factorization and Link Probability Functions
Bibliographic record
Abstract
Recommender systems are becoming an integral part of routine life, as they are extensively used in daily decision-making processes such as online shopping for products or services, job references, matchmaking for marriage purposes, and many others. However, these recommender systems are lacking in producing quality recommendations owing to sparsity issues. Keeping this in mind, the present study introduces a hybrid recommendation model for recommending music artists to users which is hierarchical Bayesian in nature, known as Relational Collaborative Topic Regression with Social Matrix Factorization (RCTR-SMF). This model makes use of a lot of auxiliary domain knowledge and provides seamless integration of Social Matrix Factorization and Link Probability Functions into Collaborative Topic Regression-based recommender systems to attain better prediction accuracy. Here, the main emphasis is on examining the effectiveness of unified information related to social networking and an item-relational network structure in addition to item content and user-item interactions to make predictions for user ratings. RCTR-SMF addresses the sparsity problem by utilizing additional domain knowledge, and it can address the cold-start problem in the case that there is hardly any rating information available. Furthermore, this article exhibits the proposed model performance on a large real-world social media dataset. The proposed model provides a recall of 57% and demonstrates its superiority over other state-of-the-art recommendation algorithms.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".