In food diet communication domain, images convey important information to capture users' attention beyond the traditional ingredient content, making it crucial to influence user-decision about the relevancy of a given diet. By using a deep learning-based image clustering method, this paper proposes an Explainable Food Recommendation system that uses the visual content of food to justify their recommendations. n the recommendation system. Especially, a new similarity score based on a tendency measure that quantifies the extent to which user community prefers a given food category is introduced and incorporated in the recommendation. Finally, a rule-based explainability is introduced to enhance transparency and interpretability of the recommendation outcome. Our experiments on a crawled dataset showed that the proposed method enhances recommendation quality in terms of precision, recall, F1, and Normalized Discounted Cumulative Gain (NDCG) by 7.35%, 6.70%, 7.32% and 14.38%, respectively, when compared to other existing methodologies for food recommendation. Besides ablation study is performed to demonstrate the technical soundness of the various components of our recommendation system. 

An effective explainable food recommendation using deep image clustering and community detection

Guest Editorial: Deep Neural Networks for Graphs: Theory, Models, Algorithms, and Applications

The increasing popularity of mobile phones has led to an abundance of online reviews, making it challenging for consumers to make well-informed purchasing decisions. This study proposes a novel recommendation system-based mobile phone rating classification approach using federated learning and Term Frequency-Inverse Document Frequency (TF-IDF) features. We created a novel dataset by scraping over 13,000 mobile phone reviews from Flipkart’s website. The proposed approach involves the development of a federated deep neural network (FDNN) to classify the newly created Flipkart dataset. This approach includes data cleaning, balancing, TF-IDF feature extraction, and prediction using federated learning. We employ two clients and one server and conduct three rounds of experiments. The experimental results demonstrate that the proposed approach achieved an accuracy of 96.68% on the aggregated server side while maintaining the security of customer data on their local devices. The proposed approach has the potential to assist consumers in making well-informed purchasing decisions and can be extended to other e-commerce platforms with large datasets of online reviews. 

Privacy Preserved and Decentralized Smartphone Recommendation System

Recommender Systems (RSs) are used to provide users with personalized item recommendations and help them overcome the problem of information overload. Currently, recommendation methods based on deep learning are gaining ground over traditional methods such as matrix factorization due to their ability to represent the complex relationships between users and items and to incorporate additional information. The fact that these data have a graph structure and the greater capability of Graph Neural Networks (GNNs) to learn from these structures has led to their successful incorporation into recommender systems. However, the bias amplification issue needs to be investigated while using these algorithms. Bias results in unfair decisions, which can negatively affect the company’s reputation and financial status due to societal disappointment and environmental harm. In this paper, we aim to comprehensively study this problem through a literature review and an analysis of the behavior against biases of different GNN-based algorithms compared to state-of-the-art methods. We also intend to explore appropriate solutions to tackle this issue with the least possible impact on the model’s performance.

/pdf/a-comparative-analysis-of-bias-amplification-in-graph-neural-3sor2ip7.pdf

A Comparative Analysis of Bias Amplification in Graph Neural Network Approaches for Recommender Systems

Network operation and maintenance rely heavily on network traffic monitoring. Due to the measurement overhead reduction, lack of measurement infrastructure, and unexpected transmission error, network traffic monitoring systems suffer from incomplete observed data and high data sparsity problems. Recent studies model missing data recovery as a tensor completion task and show good performance. Although promising, the current tensor completion models adopted in network traffic data recovery lack an effective and efficient retraining scheme to adapt to newly arrived data while retaining historical information. To solve the problem, we propose LightNestle, a novel sequential tensor completion scheme based on meta-learning, which designs (1) an expressive neural network to transfer spatial knowledge from previous embeddings to current embeddings; (2) an attention-based module to transfer temporal patterns into current embeddings in linear complexity; and (3) meta-learning-based algorithms to iteratively recover missing data and update transfer modules to catch up with learned knowledge. We conduct extensive experiments on two real-world network traffic datasets to assess our performance. Results show that our proposed methods achieve both fast retraining and high recovery accuracy. 

LightNestle: Quick and Accurate Neural Sequential Tensor Completion via Meta Learning

Real-world recommender system needs to be regularly retrained to keep with the new data. In this work, we consider how to efficiently retrain graph convolution network (GCN) based recommender models, which are state-of-the-art techniques for collaborative recommendation. To pursue high efficiency, we set the target as using only new data for model updating, meanwhile not sacrificing the recommendation accuracy compared with full model retraining. This is non-trivial to achieve, since the interaction data participates in both the graph structure for model construction and the loss function for model learning, whereas the old graph structure is not allowed to use in model updating. Towards the goal, we propose a \textit{Causal Incremental Graph Convolution} approach, which consists of two new operators named \textit{Incremental Graph Convolution} (IGC) and \textit{Colliding Effect Distillation} (CED) to estimate the output of full graph convolution. In particular, we devise simple and effective modules for IGC to ingeniously combine the old representations and the incremental graph and effectively fuse the long-term and short-term preference signals. CED aims to avoid the out-of-date issue of inactive nodes that are not in the incremental graph, which connects the new data with inactive nodes through causal inference. In particular, CED estimates the causal effect of new data on the representation of inactive nodes through the control of their collider. Extensive experiments on three real-world datasets demonstrate both accuracy gains and significant speed-ups over the existing retraining mechanism.

Causal Incremental Graph Convolution for Recommender System Retraining.

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Ding Sihao

Author Tools

Chat about Author

Papers

Causal Incremental Graph Convolution for Recommender System Retraining.