The paper analyzes and optimizes recommendation systems using user-user and item-item collaborative filtering.
problem Optimizing recommendation systems to minimize disliked recommendations.
method Proposes algorithms inspired by user-user and item-item collaborative filtering, proving performance guarantees in terms of expected regret.
result Information-theoretic lower bounds on regret match upper bounds up to logarithmic factors in two model parameter regimes.
New bandit model accounts for user departures in recommender systems.
problem Capturing user departures in recommender systems with multi-armed bandits.
method Proposes a novel multi-armed bandit setup with two types of users and analyzes optimal and efficient algorithms.
result Achieves optimal and efficient learning algorithms for user types and reward probabilities.
Unified neural framework for multi-relational recommender systems.
problem Accurately capturing users' fine-grained preferences from diverse feedback types.
method Multi-Relational Memory Network (MRMN) framework that models fine-grained user-item relations and discriminates between feedback types.
result The proposed MRMN model outperforms state-of-the-art algorithms in various recommender scenarios.
AI agents learn to cooperate with users of unknown type.
problem Designing AI agents that can cooperate with new users effectively.
method Modeling user behavior as parameters, observing user actions to infer type, and adapting policies.
result Adaptive AI agents perform significantly better than non-adaptive ones in real scenarios.
Spotify improves content mix using contextual bandits.
problem Skewed historical data and varying user preferences across contexts.
method Contextual bandits to dynamically learn optimal content type distribution.
result Improved precision and user engagement with under-represented content types.
Optimal recommendation system using user and item clustering.
problem Maximizing recommendation accuracy with limited feedback.
method Latent variable model with user and item clustering, exploiting i.i.d. structure.
result Near-optimal algorithm that combines item and user structures.
Paper fine-tunes LLMs using user edits, unifying preference, supervision, and reward feedback.
problem Adapting LLMs to user preferences and feedback types.
method Derives bounds for learning algorithms from user edits, proposes an ensembling procedure.
result Ensembling procedure outperforms individual feedback methods and robustly adapts to different user-edit distributions.
Improves relevancy of black-box anomaly detectors with user feedback.
problem Users often ignore many detected anomalies, requiring a method to identify and prioritize relevant ones.
method Uses user feedback to adjust anomaly selection process based on identified anomaly types.
result Significant improvements in precision and recall over various anomaly detectors.
Despite the prevalence of collaborative filtering in recommendation systems, there has been little theoretical development on why and how well it works, especially in the "online" setting, where items are recommended to users over time. We address this theoretical gap by introducing a model for online recommendation sy…
A new personality-based recommender system tackles data sparsity without feedback.
problem Data sparsity without common feedback among users.
method Implicitly identifying users' personality type and incorporating it with personal interests and knowledge level.
result The model's effectiveness, especially in data sparsity situations, demonstrated on a real-world dataset.
Paper proposes a combined model for better recommendation by integrating explicit and implicit feedbacks.
problem Improve recommendation accuracy by considering both explicit and implicit feedbacks.
method Developed three models (RHC-PMF, RV-PMF, RHCV-PMF) that incorporate users' explicit and implicit feedbacks for better rating prediction.
result RHCV-PMF model outperforms other models in cold start scenarios for both users and items.
Formulates approach for guiding explanation types based on user specifications.
problem Creating explainable AI components from user-defined specifications.
method Develops a method for generating explanations based on user-defined specifications.
result Demonstrates feasibility of user-defined explanations for complex models like Bayesian networks and graph neural networks.
Ludwig simplifies deep learning for non-experts.
problem Making deep learning accessible to non-experts.
method Type-based data abstraction and declarative configuration files.
result Ludwig democratizes deep learning, making it accessible to a broader audience.
Given a set of pairwise comparisons, the classical ranking problem computes a single ranking that best represents the preferences of all users. In this paper, we study the problem of inferring individual preferences, arising in the context of making personalized recommendations. In particular, we assume that there are …
Defense against user shilling attacks in collaborative filtering using edge reweighting.
problem Vulnerability of collaborative filtering to profile injection attacks.
method Adversarial robustness based edge reweighting to attenuate non-robust edges.
result Effective defense against various types of attacks demonstrated through experiments.
Survey visual analytics methods for detecting anomalous user behaviors.
problem Understanding and detecting anomalous user behaviors in various domains.
method Survey and classification of visual analytics methods in four categories.
result Discussion of findings and potential research directions.
Platform learns user types while matching limited supply to demand.
problem Matching limited supply to demand while learning user types.
method Multi-armed bandit framework with capacity constraints.
result Optimal policy characterized in the limit of many jobs per worker.
Improved neural models for diverse user event sequences.
problem Challenges in modeling diverse user event sequences.
method Mixtures of latent embeddings with amortized variational inference.
result Systematic improvements over existing work for various predictive metrics.
Hybrid approach combines user feedback and machine learning for predicting user satisfaction.
problem Measuring user satisfaction in large-scale conversational agent systems.
method Fusion of explicit user feedback and predictions from two machine-learned models trained on different data types.
result Hybrid approach significantly improves user satisfaction predictions.
The paper uses NMF to detect political communities in Twitter networks.
problem Detecting pure political communities in Twitter networks.
method Developed three NMF frameworks to analyze user connectivity and content.
result User content and endorsement filtered connectivity are complementary.
The paper shows how machine learning models can be fooled by fake users.
problem How machine learning recommendation models can be fooled by fake users.
method A framework for generating fake user profiles that mimic real users and achieve adversarial intent.
result Machine learning recommendation models can be easily fooled by fake users.
Etsy uses novel embeddings to improve user recommendations based on item interactions.
problem Improving personalized recommendations for users based on diverse item interactions.
method Learning interaction-based item embeddings to encode co-occurrence patterns of item and interaction types.
result Taking interaction type into account improves user shopping behavior modeling accuracy.
Proposes a semi-supervised approach to predict user-level sentiments in social media.
problem Detect and analyze sentiment in social media, especially user-level sentiments.
method Semi-supervised approach using a heterogeneous graph built from social networks, incorporating user influences and multiple types of links.
result Predicts user-level sentiments for specific topics more effectively than previous supervised learning approaches.
DeepCF combines representation learning and matching function learning for better recommendation.
problem Matching users and items with semantic gap in initial spaces.
method Unified framework combining representation learning and matching function learning.
result Demonstrates effectiveness on four datasets.
Study active learning for multi-level user preferences in recommendation systems.
problem Efficiently learning user preferences through active querying in recommendation systems.
method Proposes a theoretically optimal active learning strategy based on Fisher information matrix for collective matrix factorization.
result Demonstrates strong improvements over active learning methods in personalized, cold-start, and noisy data settings.
Deep neural networks improve recommendation accuracy in marketplaces.
problem Measuring and optimizing recommender performance in marketplaces.
method Hybrid item representation models, sequence-based models, and multi-armed bandit models.
result Promising deep neural network recommenders are currently in production at FINN.no.
Collaborative recommendation is an information-filtering technique that attempts to present information items (movies, music, books, news, images, Web pages, etc.) that are likely of interest to the Internet user. Traditionally, collaborative systems deal with situations with two types of variables, users and items. In…
Model combines user preferences and side information for better recommendation.
problem Addressing data sparsity and improving user intent representation.
method Tensor-based model that fuses user preferences with side information.
result Demonstrates effectiveness on standard benchmark datasets.
The study compares prepaid and postpaid mobile phone users and predicts their subscription type.
problem Predicting mobile phone subscription type based on usage and network connections.
method Graph labelling approach using max-flow min-cut algorithms and indirect inference methods.
result Graph labelling approach achieves 87% classification accuracy, outperforming supervised learning methods.
The paper proposes a method to infer user profiles from multiple sources of social media data.
problem Mining user profiles from social media data using a single type of information.
method Hinge-loss Markov Random Fields (HL-MRFs) integrated with multiple sources of UGC and social relations.
result HL-MRFs successfully incorporate multiple sources of information and outperform competing methods.
CalBehav models individual smartphone user behavior for calendar events.
problem Static calendar models do not reflect individual user behavior.
method Machine learning, context-aware, personalized model using time-series smartphone data.
result Data-driven model more effective for managing incoming mobile communications.
Deep User Perception Network learns universal user representations from multiple e-commerce tasks.
problem Lack of shared user information across diverse e-commerce tasks.
method Model user behavior sequences using LSTM and attention mechanism, sharing user representations across multiple tasks.
result Our approach consistently achieves better results in personalization across multiple e-commerce tasks.
The paper introduces subgraph nomination for finding similar subgraphs in networks.
problem Finding similar subgraphs in networks using example subgraphs.
method Formalizes subgraph nomination framework with user-supervised retrieval.
result User-supervised retrieval improves performance in subgraph nomination.
Most users of online services have unique behavioral or usage patterns. These behavioral patterns can be exploited to identify and track users by using only the observed patterns in the behavior. We study the task of identifying users from statistics of their behavioral patterns. Specifically, we focus on the setting i…
Podcast recommendations improved by analyzing user listening paths.
problem Challenges in recommending podcasts effectively.
method Analyzes user listening paths as sequential trajectories for recommendations.
result 450% increase in effectiveness over baseline.
In this paper, we explore salient questions about user interests, conversations and friendships in the Facebook social network, using a novel latent space model that integrates several data types. A key challenge of studying Facebook's data is the wide range of data modalities such as text, network links, and categoric…
A novel deep learning method predicts Twitter users' locations using multiple data types.
problem Predicting Twitter users' locations on large social networks.
method Combines content-based and network-based approaches using a multi-entry neural network architecture (MENET).
result MENET outperforms state-of-the-art methods by a large margin on three benchmark datasets.
We propose a decomposition technique to reduce user cognitive load in constructive preference elicitation.
problem Learning user preferences in large combinatorial decision problems.
method Part-wise inference and feedback over partial configurations.
result Significantly reduced user cognitive load and up to exponentially less computational demand.
RLINK uses deep reinforcement learning to improve user identity linkage across social networks.
problem Recognizing the same user across different social networks.
method Converts user identity linkage into a sequence decision problem and uses deep reinforcement learning to optimize the linkage strategy.
result Achieves better performance than state-of-the-art methods in experiments on various datasets.
Mechanisms for fair resource allocation learn user preferences online.
problem Fair resource allocation among users with unknown requirements.
method Repeated allocation rounds with user feedback for learning preferences.
result Mechanisms achieve efficiency, fairness, and strategy-proofness.
Federated Learning leaks user-specific information, making devices deanonymizable.
problem Federated Learning leaks user-specific information, making devices deanonymizable.
method Identified subtle variations in model updates that encode user-specific data. Proposed data-augmentation strategies to mitigate deanonymization.
result Data-augmentation strategies offer substantial protection against deanonymization threats with little effect on utility.
Projective preferential Bayesian optimization learns user preferences in high dimensions.
problem Finding extrema of a black-box function in high-dimensional spaces.
method Projective preferential queries for feedback in human-interaction.
result Framework finds global minimum of high-dimensional black-box function.
The paper clusters hypergraphs to find diverse and experienced groups based on past experiences.
problem Finding diverse and experienced groups with respect to past experiences.
method Regularized edge-based hypergraph clustering objective with a 2-approximation algorithm.
result Demonstrates an efficient 2-approximation algorithm for clustering hypergraphs.
The paper analyzes user activities in OSNs using a vector space model.
problem Understanding user interactions and activity patterns in OSNs.
method TF-IDF scheme of Vector Space Model to analyze object-viewer relationships.
result Identified activity relationships among users and objects in OSNs.
Introduces generalized complex geometry for studying type II supergravity backgrounds.
problem Understanding supersymmetric backgrounds in type II supergravity.
method Introduction to generalized complex geometry and review of past and recent results.
result Exploration of generalized complex structures in type II vacua.
The paper identifies and analyzes subjective class issues in user-generated data.
problem Subjective labels in user-generated data can lead to biased and manipulated results.
method Defined subjective and objective classes, proposed a framework for detecting subjective labels.
result Data mining practitioners can detect and avoid subjective class issues early in their projects.
Enhanced HMM for keystroke dynamics improves biometric accuracy.
problem Improving biometric authentication through keystroke dynamics.
method Partially observable hidden Markov model with user state assumption.
result The model outperforms standard HMM and other anomaly detectors.
LoCEC classifies user relationships in large social networks, addressing sparsity issues.
problem Sparse relationship feature and label data in real social platforms.
method Local Community-based Edge Classification (LoCEC) framework with three-phase processing.
result Effective and efficient classification of user relationships in large-scale networks.