Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Enhancing the robustness of recommender systems against spammers.

ABSTRACT: The accuracy and diversity of recommendation algorithms have always been the research hotspot of recommender systems. A good recommender system should not only have high accuracy and diversity, but also have adequate robustness against spammer attacks. However, the issue of recommendation robustness has received relatively little attention in the literature. In this paper, we systematically study the influences of different spammer behaviors on the recommendation results in various recommendation algorithms. We further propose an improved algorithm by incorporating the inner-similarity of user's purchased items in the classic KNN approach. The new algorithm effectively enhances the robustness against spammer attacks and thus outperforms traditional algorithms in recommendation accuracy and diversity when spammers exist in the online commercial systems.

SUBMITTER: Zhang C

PROVIDER: S-EPMC6211683 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Enhancing the robustness of recommender systems against spammers.

Zhang Chengjun C Liu Jin J Qu Yanzhen Y Han Tianqi T Ge Xujun X Zeng An A

PloS one 20181101 11

The accuracy and diversity of recommendation algorithms have always been the research hotspot of recommender systems. A good recommender system should not only have high accuracy and diversity, but also have adequate robustness against spammer attacks. However, the issue of recommendation robustness has received relatively little attention in the literature. In this paper, we systematically study the influences of different spammer behaviors on the recommendation results in various recommendatio ...[more]

PMID: 30383766

Similar Datasets

Adversarial Robustness of Deep Reinforcement Learning Based Dynamic Recommender Systems.

Project description:Adversarial attacks, e.g., adversarial perturbations of the input and adversarial samples, pose significant challenges to machine learning and deep learning techniques, including interactive recommendation systems. The latent embedding space of those techniques makes adversarial attacks challenging to detect at an early stage. Recent advance in causality shows that counterfactual can also be considered one of the ways to generate the adversarial samples drawn from different distribution as the training samples. We propose to explore adversarial examples and attack agnostic detection on reinforcement learning (RL)-based interactive recommendation systems. We first craft different types of adversarial examples by adding perturbations to the input and intervening on the casual factors. Then, we augment recommendation systems by detecting potential attacks with a deep learning-based classifier based on the crafted data. Finally, we study the attack strength and frequency of adversarial examples and evaluate our model on standard datasets with multiple crafting methods. Our extensive experiments show that most adversarial attacks are effective, and both attack strength and attack frequency impact the attack performance. The strategically-timed attack achieves comparative attack performance with only 1/3 to 1/2 attack frequency. Besides, our white-box detector trained with one crafting method has the generalization ability over several other crafting methods.

| S-EPMC9110778 | biostudies-literature

Enhancing the scalability of distance-based link prediction algorithms in recommender systems through similarity selection.

Project description:Slope One algorithm and its descendants measure user-score distance and use the statistical score distance between users to predict unknown ratings, as opposed to the typical collaborative filtering algorithm that uses similarity for neighbor selection and prediction. Compared to collaborative filtering systems that select only similar neighbors, algorithms based on user-score distance typically include all possible related users in the process, which needs more computation time and requires more memory. To improve the scalability and accuracy of distance-based recommendation algorithm, we provide a user-item link prediction approach that combines user distance measurement with similarity-based user selection. The algorithm predicts unknown ratings based on the filtered users by calculating user similarity and removing related users with similarity below a threshold, which reduces 26 to 29 percent of neighbors and improves prediction error, ranking, and prediction accuracy overall.

| S-EPMC9333256 | biostudies-literature

FPLV: Enhancing recommender systems with fuzzy preference, vector similarity, and user community for rating prediction

Project description:Rating prediction is crucial in recommender systems as it enables personalized recommendations based on different models and techniques, making it of significant theoretical importance and practical value. However, presenting these recommendations in the form of lists raises the challenge of improving the list’s quality, making it a prominent research topic. This study focuses on enhancing the ranking quality of recommended items in user lists while ensuring interpretability. It introduces fuzzy membership functions to measure user attributes on a multi-dimensional item label vector and calculates user similarity based on these features for prediction and recommendation. Additionally, the user similarity network is modeled to extract community information, leading to the design of a set of corresponding recommendation algorithms. Experimental results on two commonly used datasets demonstrate the effectiveness of the proposed algorithm in enhancing list ranking quality, reducing prediction errors, and maintaining recommendation diversity and accurate user preference classification. This research highlights the potential of integrating heuristic methods with complex network theory and fuzzy techniques to enhance recommendation system performance with interpretability in mind.

| S-EPMC10461840 | biostudies-literature

Health Recommender Systems: Systematic Review.

Project description:BackgroundHealth recommender systems (HRSs) offer the potential to motivate and engage users to change their behavior by sharing better choices and actionable knowledge based on observed user behavior.ObjectiveWe aim to review HRSs targeting nonmedical professionals (laypersons) to better understand the current state of the art and identify both the main trends and the gaps with respect to current implementations.MethodsWe conducted a systematic literature review according to the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analyses) guidelines and synthesized the results. A total of 73 published studies that reported both an implementation and evaluation of an HRS targeted to laypersons were included and analyzed in this review.ResultsRecommended items were classified into four major categories: lifestyle, nutrition, general health care information, and specific health conditions. The majority of HRSs use hybrid recommendation algorithms. Evaluations of HRSs vary greatly; half of the studies only evaluated the algorithm with various metrics, whereas others performed full-scale randomized controlled trials or conducted in-the-wild studies to evaluate the impact of HRSs, thereby showing that the field is slowly maturing. On the basis of our review, we derived five reporting guidelines that can serve as a reference frame for future HRS studies. HRS studies should clarify who the target user is and to whom the recommendations apply, what is recommended and how the recommendations are presented to the user, where the data set can be found, what algorithms were used to calculate the recommendations, and what evaluation protocol was used.ConclusionsThere is significant opportunity for an HRS to inform and guide health actions. Through this review, we promote the discussion of ways to augment HRS research by recommending a reference frame with five design guidelines.

| S-EPMC8278303 | biostudies-literature

Recommender Systems in Antiviral Drug Discovery.

Project description:Recommender systems (RSs), which underwent rapid development and had an enormous impact on e-commerce, have the potential to become useful tools for drug discovery. In this paper, we applied RS methods for the prediction of the antiviral activity class (active/inactive) for compounds extracted from ChEMBL. Two main RS approaches were applied: collaborative filtering (Surprise implementation) and content-based filtering (sparse-group inductive matrix completion (SGIMC) method). The effectiveness of RS approaches was investigated for prediction of antiviral activity classes ("interactions") for compounds and viruses, for which some of their interactions with other viruses or compounds are known, and for prediction of interaction profiles for new compounds. Both approaches achieved relatively good prediction quality for binary classification of individual interactions and compound profiles, as quantified by cross-validation and external validation receiver operating characteristic (ROC) score >0.9. Thus, even simple recommender systems may serve as an effective tool in antiviral drug discovery.

| S-EPMC7315437 | biostudies-literature

Crowdsourced audit of Twitter's recommender systems.

Project description:This research conducts an audit of Twitter's recommender system, aiming to examine the disparities between users' curated timelines and their subscription choices. Through the combined use of a browser extension and data collection via the Twitter API, our investigation reveals a high amplification of friends from the same community, a preference for amplifying emotionally charged and toxic tweets and an uneven algorithmic amplification across friends' political leaning. This audit emphasizes the importance of transparency, and increased awareness regarding the impact of algorithmic curation.

| S-EPMC10556069 | biostudies-literature

Optimizing the robustness of electrical power systems against cascading failures.

Project description:Electrical power systems are one of the most important infrastructures that support our society. However, their vulnerabilities have raised great concern recently due to several large-scale blackouts around the world. In this paper, we investigate the robustness of power systems against cascading failures initiated by a random attack. This is done under a simple yet useful model based on global and equal redistribution of load upon failures. We provide a comprehensive understanding of system robustness under this model by (i) deriving an expression for the final system size as a function of the size of initial attacks; (ii) deriving the critical attack size after which system breaks down completely; (iii) showing that complete system breakdown takes place through a first-order (i.e., discontinuous) transition in terms of the attack size; and (iv) establishing the optimal load-capacity distribution that maximizes robustness. In particular, we show that robustness is maximized when the difference between the capacity and initial load is the same for all lines; i.e., when all lines have the same redundant space regardless of their initial load. This is in contrast with the intuitive and commonly used setting where capacity of a line is a fixed factor of its initial load.

| S-EPMC4914930 | biostudies-literature

Promoting cold-start items in recommender systems.

Project description:As one of the major challenges, cold-start problem plagues nearly all recommender systems. In particular, new items will be overlooked, impeding the development of new products online. Given limited resources, how to utilize the knowledge of recommender systems and design efficient marketing strategy for new items is extremely important. In this paper, we convert this ticklish issue into a clear mathematical problem based on a bipartite network representation. Under the most widely used algorithm in real e-commerce recommender systems, the so-called item-based collaborative filtering, we show that to simply push new items to active users is not a good strategy. Interestingly, experiments on real recommender systems indicate that to connect new items with some less active users will statistically yield better performance, namely, these new items will have more chance to appear in other users' recommendation lists. Further analysis suggests that the disassortative nature of recommender systems contributes to such observation. In a word, getting in-depth understanding on recommender systems could pave the way for the owners to popularize their cold-start products with low costs.

| S-EPMC4257537 | biostudies-literature

Uncovering the information core in recommender systems.

Project description:With the rapid growth of the Internet and overwhelming amount of information that people are confronted with, recommender systems have been developed to effectively support users' decision-making process in online systems. So far, much attention has been paid to designing new recommendation algorithms and improving existent ones. However, few works considered the different contributions from different users to the performance of a recommender system. Such studies can help us improve the recommendation efficiency by excluding irrelevant users. In this paper, we argue that in each online system there exists a group of core users who carry most of the information for recommendation. With them, the recommender systems can already generate satisfactory recommendation. Our core user extraction method enables the recommender systems to achieve 90% of the accuracy of the top-L recommendation by taking only 20% of the users into account. A detailed investigation reveals that these core users are not necessarily the large-degree users. Moreover, they tend to select high quality objects and their selections are well diversified.

| S-EPMC4139954 | biostudies-literature

Integrating contextual sentiment analysis in collaborative recommender systems.

Project description:Recently. recommender systems have become a very crucial application in the online market and e-commerce as users are often astounded by choices and preferences and they need help finding what the best they are looking for. Recommender systems have proven to overcome information overload issues in the retrieval of information, but still suffer from persistent problems related to cold-start and data sparsity. On the flip side, sentiment analysis technique has been known in translating text and expressing user preferences. It is often used to help online businesses to observe customers' feedbacks on their products as well as try to understand customer needs and preferences. However, the current solution for embedding traditional sentiment analysis in recommender solutions seems to have limitations when involving multiple domains. Therefore, an issue called domain sensitivity should be addressed. In this paper, a sentiment-based model with contextual information for recommender system was proposed. A novel solution for domain sensitivity was proposed by applying a contextual information sentiment-based model for recommender systems. In evaluating the contributions of contextual information in sentiment-based recommendations, experiments were divided into standard rating model, standard sentiment model and contextual information model. Results showed that the proposed contextual information sentiment-based model illustrates better performance as compared to the traditional collaborative filtering approach.

| S-EPMC7984640 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data