User recommendation system based on MIND dataset

• URL: http://arxiv.org/abs/2209.06131v1
• Date: Tue, 6 Sep 2022 22:25:36 GMT
• Title: User recommendation system based on MIND dataset
• Authors: Niran A. Abdulhussein and Ahmed J Obaid
• Abstract summary: We will use the MIND dataset with our system, which was collected in 2019. The core of our system we have used the GloVe algorithm for word embeddings and representation. We achieve good results more than some other related works in AUC 71.211, MRR 35.72, nDCG@5 38.05, and nDCG@10 44.45.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Nowadays, it's a very significant way for researchers and other individuals to achieve their interests because it provides short solutions to satisfy their demands. Because there are so many pieces of information on the internet, news recommendation systems allow us to filter content and deliver it to the user in proportion to his desires and interests. RSs have three techniques: content-based filtering, collaborative filtering, and hybrid filtering. We will use the MIND dataset with our system, which was collected in 2019, the big challenge in this dataset because there is a lot of ambiguity and complex text processing. In this paper, will present our proposed recommendation system. The core of our system we have used the GloVe algorithm for word embeddings and representation. Besides, the Multi-head Attention Layer calculates the attention of words, to generate a list of recommended news. Finally, we achieve good results more than some other related works in AUC 71.211, MRR 35.72, nDCG@5 38.05, and nDCG@10 44.45.

Related papers

• GeMi: A Graph-based, Multimodal Recommendation System for Narrative Scroll Paintings [0.0]
  Graph Neural Network (GNN)-based recommendation systems are a special class of recommendation systems.<n>In this work, we present the design of a GNN-based recommendation system on a novel data set collected from field research.
  arXiv  Detail & Related papers  (2026-03-01T00:54:26Z)
• Knowledge-based Visual Question Answer with Multimodal Processing, Retrieval and Filtering [55.49652734090316]
  A knowledge-based visual question answering (KB-VQA) requires visual language models (VLMs) to integrate visual understanding with external knowledge retrieval.<n>We propose a novel three-stage method, termed Wiki-PRF, including Processing, Retrieval and Filtering stages.<n> Experiments on benchmark datasets (E-VQA and InfoSeek) show significant improvements in answer quality, achieving state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-10-16T12:10:00Z)
• Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors [18.796661826646616]
  Filtered Approximate Nearest Neighbor Search is a problem known as Filtered Approximate Nearest Neighbor Search (FANNS)<n>We present a comprehensive survey and taxonomy of FANNS methods and analyze how they are benchmarked in the literature.<n>We introduce a novel dataset consisting of embedding vectors for the abstracts of over 2.7 million research articles from the arXiv repository, accompanied by 11 real-world attributes such as authors and categories.
  arXiv  Detail & Related papers  (2025-07-29T16:39:54Z)
• CORONA: A Coarse-to-Fine Framework for Graph-based Recommendation with Large Language Models [37.31002764910533]
  Large language models (LLMs) have shown strong capabilities across domains.<n>We propose to leverage LLMs' reasoning abilities during the candidate filtering process.<n>We introduce Chain Of Retrieval ON grAphs (CORONA) to progressively narrow down the range of candidate items.
  arXiv  Detail & Related papers  (2025-06-14T08:20:15Z)
• Online and Offline Evaluations of Collaborative Filtering and Content Based Recommender Systems [0.0]
  This study provides a comparative analysis of a large-scale recommender system operating in Iran. The system employs user-based and item-based recommendations using content-based, collaborative filtering, trend-based methods, and hybrid approaches. Our methods of evaluation include manual evaluation, offline tests including accuracy and ranking metrics like hit-rate@k and nDCG, and online tests consisting of click-through rate (CTR)
  arXiv  Detail & Related papers  (2024-11-02T20:05:31Z)
• An Efficient Multi-threaded Collaborative Filtering Approach in Recommendation System [0.0]
  This research focuses on building a scalable recommendation system capable of handling numerous users efficiently. A multithreaded similarity approach is employed to achieve this, where users are divided into independent threads that run in parallel. This parallelization significantly reduces computation time compared to traditional methods, resulting in a faster, more efficient, and scalable recommendation system.
  arXiv  Detail & Related papers  (2024-09-28T06:33:18Z)
• Summary of a Haystack: A Challenge to Long-Context LLMs and RAG Systems [124.82815637571413]
  We design a procedure to synthesize Haystacks of documents, ensuring that specific textitinsights repeat across documents. The "Summary of a Haystack" (SummHay) task then requires a system to process the Haystack and generate, given a query, a summary that identifies the relevant insights and precisely cites the source documents.
  arXiv  Detail & Related papers  (2024-07-01T15:23:42Z)
• Embedding in Recommender Systems: A Survey [67.67966158305603]
  A crucial aspect is embedding techniques that covert the high-dimensional discrete features, such as user and item IDs, into low-dimensional continuous vectors. Applying embedding techniques captures complex entity relationships and has spurred substantial research. This survey covers embedding methods like collaborative filtering, self-supervised learning, and graph-based techniques.
  arXiv  Detail & Related papers  (2023-10-28T06:31:06Z)
• DAMO-NLP at SemEval-2023 Task 2: A Unified Retrieval-augmented System for Multilingual Named Entity Recognition [94.90258603217008]
  The MultiCoNER RNum2 shared task aims to tackle multilingual named entity recognition (NER) in fine-grained and noisy scenarios. Previous top systems in the MultiCoNER RNum1 either incorporate the knowledge bases or gazetteers. We propose a unified retrieval-augmented system (U-RaNER) for fine-grained multilingual NER.
  arXiv  Detail & Related papers  (2023-05-05T16:59:26Z)
• Multimodal Recommender Systems: A Survey [50.23505070348051]
  Multimodal Recommender System (MRS) has attracted much attention from both academia and industry recently. In this paper, we will give a comprehensive survey of the MRS models, mainly from technical views. To access more details of the surveyed papers, such as implementation code, we open source a repository.
  arXiv  Detail & Related papers  (2023-02-08T05:12:54Z)
• kNN-Embed: Locally Smoothed Embedding Mixtures For Multi-interest Candidate Retrieval [7.681386867564213]
  kNN-Embed represents each user as a smoothed mixture over learned item clusters that represent distinct "interests" of the user. We experimentally compare kNN-Embed to standard ANN candidate retrieval, and show significant improvements in overall recall and improved diversity across three datasets.
  arXiv  Detail & Related papers  (2022-05-12T16:42:24Z)
• Multi-task recommendation system for scientific papers with high-way networks [1.5229257192293197]
  We present a multi-task recommendation system (RS) that predicts a paper recommendation and generates its meta-data such as keywords. The motivation behind this approach is that the paper's topics expressed as keywords are a useful predictor of preferences of researchers. Our application uses Highway networks to train the system very deep, combine the benefits of RNN and CNN to find the most important factor and make latent representation.
  arXiv  Detail & Related papers  (2022-04-21T07:40:47Z)
• Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach [56.12815715932561]
  We propose a new broad recommender system called Broad Collaborative Filtering (BroadCF) Instead of Deep Neural Networks (DNNs), Broad Learning System (BLS) is used as a mapping function to learn the complex nonlinear relationships between users and items. Extensive experiments conducted on seven benchmark datasets have confirmed the effectiveness of the proposed BroadCF algorithm.
  arXiv  Detail & Related papers  (2022-04-20T01:25:08Z)
• Comprehensive Movie Recommendation System [0.0]
  This article implements a complete movie recommendation system prototype based on the Genre, Pearson Correlation Coefficient, Cosine Similarity, KNN-Based, Content-Based Filtering. We also present a novel idea that applies machine learning techniques to construct a cluster for the movie based on genres. The whole work has been done on the dataset Movie Lens present at the group lens website which contains 100836 ratings and 3683 tag applications across 9742 movies.
  arXiv  Detail & Related papers  (2021-12-23T11:02:57Z)
• Exploration in two-stage recommender systems [79.50534282841618]
  Two-stage recommender systems are widely adopted in industry due to their scalability and maintainability. A key challenge of this setup is that optimal performance of each stage in isolation does not imply optimal global performance. We propose a method of synchronising the exploration strategies between the ranker and the nominators.
  arXiv  Detail & Related papers  (2020-09-01T16:52:51Z)
• Filter Grafting for Deep Neural Networks [71.39169475500324]
  Filter grafting aims to improve the representation capability of Deep Neural Networks (DNNs) We develop an entropy-based criterion to measure the information of filters and an adaptive weighting strategy for balancing the grafted information among networks. For example, the grafted MobileNetV2 outperforms the non-grafted MobileNetV2 by about 7 percent on CIFAR-100 dataset.
  arXiv  Detail & Related papers  (2020-01-15T03:18:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.