A Comprehensive Survey on Recommender Systems Techniques and Challenges in Big Data Analytics with IoT Applications
Bibliographic record
Abstract
Purpose: Purpose of this research is to carry out survey on Recommendation systems techniques in Big Data Analytics. This article presents designing of recommender systems and evaluates it with help of various performance metrics in IoT applications. Theoretical framework: With fast development and applications of Internet of Things, large amount of user data is generated and accumulated every day. Growth of media consumption in online social networks is exponential which requires an efficient and effective recommendation system to enhance excellence in experience for users. Recommender systems help users to overcome Information Overload problem by providing them relevant contents. Method/design/approach: The main aspect of recommender system is how to take complete advantage of this ubiquitous data. Recommender system is mainly used to guess or predict users’ interests and make relevant recommendations. Collaborative filtering is the technique that uses the relationships between users and between items in order to build a prediction. Collaborative filtering algorithms are mainly categorized as model-based methods and memory-based methods. In this article, various methods to build recommender system are described. Similarly, Collaborative filtering uses Pearson cosine, cosine vector, Jaccard similarity to identify same users or items. Recommender system has various applications in domain such as healthcare, transportation, agriculture, e-media etc. Findings: Evaluation of recommender system with help of metrics such as Precision and Recall is presented. Comparison of experimental results is presented with help of MAE and RMSE. Recommendation system helps to discover relevant insights and can be one of the vital technologies in future IoT solutions. Research, Practical & social implications: The research makes significant contribution by providing survey of existing recommender systems along with challenges faced while designing effective and accurate recommender. Various similarity measures to find similar users or items are investigated with future pointer direction. Recommender system help in decision making process. Originality/value: The results and conclusion obtained in this research are helpful in development of novel Recommender systems which definitely assist users to overcome Information Overload issue. It helps user to save network load as well.
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.006 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.003 |
| Bibliometrics | 0.004 | 0.008 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.003 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".