English
Related papers

Related papers: Roundtable Gossip Algorithm: A Novel Sparse Trust …

200 papers

While recommender systems (RSs) traditionally rely on extensive individual user data, regulatory and technological shifts necessitate reliance on aggregated user information. This shift significantly impacts the recommendation process,…

Information Retrieval · Computer Science 2025-02-27 Gur Keinan , Omer Ben-Porat

Mitigating the new user cold-start problem has been critical in the recommendation system for online service providers to influence user experience in decision making which can ultimately affect the intention of users to use a particular…

Artificial Intelligence · Computer Science 2020-11-26 Po-Lin Lai , Chih-Yun Chen , Liang-Wei Lo , Chien-Chin Chen

Social recommendation, which utilizes social relations to enhance recommender systems, has been gaining increasing attention recently with the rapid development of online social network. Existing social recommendation methods are based on…

Information Retrieval · Computer Science 2018-09-06 Tzu-Heng Lin , Chen Gao , Yong Li

The primary goal of a recommender system is often known as "helping users find relevant items", and a lot of recommendation algorithms are proposed accordingly. However, these accuracy-oriented methods usually suffer the problem of…

Social and Information Networks · Computer Science 2020-04-23 Qiang Dong , Quan Yuan , Yang-Bo Shi

In social systems subject to indirect reciprocity, a positive reputation is key for increasing one's likelihood of future positive interactions. The flow of gossip can amplify the impact of a person's actions on their reputation depending…

Social and Information Networks · Computer Science 2023-08-30 Julian Kates-Harbeck , Martin A. Nowak

User cold-start problem is a long-standing challenge in recommendation systems. Fortunately, cross-domain recommendation (CDR) has emerged as a highly effective remedy for the user cold-start challenge, with recently developed diffusion…

Information Retrieval · Computer Science 2026-03-04 Xiaodong Li , Juwei Yue , Xinghua Zhang , Jiawei Sheng , Wenyuan Zhang , Taoyu Su , Zefeng Zhang , Tingwen Liu

Recent social recommender systems benefit from friendship graph to make an accurate recommendation, believing that friends in a social network have exactly the same interests and preferences. Some studies have benefited from hard clustering…

Social and Information Networks · Computer Science 2020-01-09 Marzieh Pourhojjati-Sabet , Azam Rabiee

The sparse portfolio selection problem is one of the most famous and frequently-studied problems in the optimization and financial economics literatures. In a universe of risky assets, the goal is to construct a portfolio with maximal…

Optimization and Control · Mathematics 2022-02-22 Dimitris Bertsimas , Ryan Cory-Wright

Reputation systems aim to reduce the risk of loss due to untrustworthy participants. This loss is aggravated by dishonest advisors trying to pollute the e-market environment for their self-interest. A major task of a reputation system is to…

Social and Information Networks · Computer Science 2012-01-19 Vibha Gaur , Neeraj Kumar Sharma , Punam Bedi

Pairwise clustering, in general, partitions a set of items via a known similarity function. In our treatment, clustering is modeled as a transductive prediction problem. Thus rather than beginning with a known similarity function, the…

Machine Learning · Computer Science 2017-06-21 Stephen Pasteris , Fabio Vitale , Claudio Gentile , Mark Herbster

In the last years, crowdsourcing is transforming the way classification training sets are obtained. Instead of relying on a single expert annotator, crowdsourcing shares the labelling effort among a large number of collaborators. For…

Machine Learning · Computer Science 2019-11-06 Pablo Morales-Álvarez , Pablo Ruiz , Scott Coughlin , Rafael Molina , Aggelos K. Katsaggelos

Several methods have been recently proposed for estimating sparse Gaussian graphical models using $\ell_{1}$ regularization on the inverse covariance matrix. Despite recent advances, contemporary applications require methods that are even…

Computation · Statistics 2014-05-15 Onkar Dalal , Bala Rajaratnam

This paper provides a theoretical analysis of a new learning problem for recommender systems where users provide feedback by comparing pairs of items instead of rating them individually. We assume that comparisons stem from latent user and…

Machine Learning · Computer Science 2025-08-20 Suryanarayana Sankagiri , Jalal Etesami , Matthias Grossglauser

Recommender systems have become an essential instrument in a wide range of industries to personalize the user experience. A significant issue that has captured both researchers' and industry experts' attention is the cold start problem for…

Machine Learning · Computer Science 2020-12-03 Ivan Maksimov , Rodrigo Rivera-Castro , Evgeny Burnaev

As decentralized AI and edge intelligence become increasingly prevalent, ensuring robustness and trustworthiness in such distributed settings has become a critical issue-especially in the presence of corrupted or adversarial data.…

Machine Learning · Statistics 2025-09-12 Anna Van Elst , Igor Colin , Stephan Clémençon

Motivated by cutting-edge applications like cryo-electron microscopy (cryo-EM), the Multi-Reference Alignment (MRA) model entails the learning of an unknown signal from repeated measurements of its images under the latent action of a group…

Statistics Theory · Mathematics 2022-03-11 Subhro Ghosh , Philippe Rigollet

In this paper, we study random gossip processes in communication models that describe the peer-to-peer networking functionality included in standard smartphone operating systems. Random gossip processes spread information through the basic…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-02-08 Calvin Newport , Alex Weaver

Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with providing useful P2P middleware services capable of dealing…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-12-27 Antonio Fernandez , Vincent Gramoli , Ernesto Jimenez , Anne-Marie Kermarrec , Michel Raynal

In this paper, we present a new BFT consensus mechanism which enables thousands of nodes to participate in the consensus process, and supports very high transaction throughput. This is achieved via an aggregated signature gossip protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-13 Jieyi Long , Ribao Wei

Recommender systems help people find relevant content in a personalized way. One main promise of such systems is that they are able to increase the visibility of items in the long tail, i.e., the lesser-known items in a catalogue. Existing…

Information Retrieval · Computer Science 2024-07-03 Anastasiia Klimashevskaia , Dietmar Jannach , Mehdi Elahi , Christoph Trattner