A new model considers fatigue in online content recommendation systems.
problem Fatigue in users due to overexposure and boredom from similar recommendations.
method Proposed a fatigue-aware Dependent Click Model (DCM) and two learning algorithms.
result Developed algorithms with regret bounds for learning content relevance and fatigue effects.
Data science predicts user interest for midwifery content.
problem Improving midwives' learning and preventing maternal and newborn deaths.
method Forecasting methods using user-generated logs from online learning apps.
result Determining future user interest in midwifery content types.
New study shows personalized content recommendations can lead to polarization of user preferences.
problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.
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.
Detects anomalous behavior in social media users by analyzing content and connections.
problem Identifying disruptive patterns in user behavior on social media platforms.
method Joint representation learning of content and connection to detect anomalous behavior.
result Observed densely connected users engaging in local politics and exhibiting troll-like behavior.
Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore t…
Study shows online learning algorithms incentivize low-quality content, proposing new algorithms to improve quality.
problem Online learning algorithms in content recommender systems incentivize producers to create low-quality content.
method Analyzed the game between producers and content quality, designed new learning algorithms to incentivize high effort and quality.
result New algorithms incentivize producers to invest high effort and achieve high user welfare, improving content quality.
One of the major hurdles preventing the full exploitation of information from online communities is the widespread concern regarding the quality and credibility of user-contributed content. Prior works in this domain operate on a static snapshot of the community, making strong assumptions about the structure of the dat…
We quantify content availability and user discovery opportunities in recommender systems.
problem Determining the maximum probability of recommending content to users.
method Stochastic reachability to compute upper bounds on recommendation likelihood.
result Reachability metrics can detect biases and diagnose user discovery limitations.
Modeling dynamic user interests using neural matrix factorization.
problem Challenging extraction of valuable insights from unstructured, high-dimensional, and dynamic online content data.
method Combines matrix factorization with neural networks to model nonlinear user and content factors.
result Accurately identifies nuanced and coherent consumption patterns of Boston Globe readers over five years.
In recommender systems, cold-start issues are situations where no previous events, e.g. ratings, are known for certain users or items. In this paper, we focus on the item cold-start problem. Both content information (e.g. item attributes) and initial user ratings are valuable for seizing users' preferences on a new ite…
Predicts user age and gender on Tumblr using rich content.
problem Challenges in targeting specific demographic groups on Tumblr.
method Graph based and deep learning models, including network embedding, label propagation, CNN, and MLP.
result Significantly improved accuracy for age and gender predictions.
Modeling incentives for content creators on algorithm-curated platforms.
problem Maximizing exposure for content creators on algorithmic platforms.
method Formalized exposure game model, proving effects of algorithmic choices on equilibria, proposing tools for finding equilibria.
result Algorithmic choices significantly affect content exposure and creator behavior.
Community detection is a fundamental task in social network analysis. In this paper, first we develop an endorsement filtered user connectivity network by utilizing Heider's structural balance theory and certain Twitter triad patterns. Next, we develop three Nonnegative Matrix Factorization frameworks to investigate th…
Proposes D2D-LSTM for predicting mobile social network content diffusion paths.
problem Lack of accurate content popularity prediction considering time and location in mobile social networks.
method D2D-LSTM, a deep neural network combining user social features and files features.
result Significantly improved prediction accuracy (up to 85.858%) and faster convergence (less than 100 steps).
Proposes a model to optimize feedback for content creators on social media.
problem Nurturing content creation on social media platforms.
method Modeling feedback distribution to incentivize creators and optimize newsfeed experience.
result Optimized newsfeed for content creators without compromising user experience.
A framework combines multiple types of data for better item recommendations.
problem Limited performance of top-N recommendation systems using only one or two types of information.
method Design and implement GraFC2T2, a graph-based framework that encodes and combines content, temporal, and trust information.
result Combining different types of information improves recommendation performance.
Study predicts email triage actions using content-based approach.
problem Predicting user triage actions on incoming emails.
method Formulated as a recommendation problem, uses content-based approach with additional similarity features.
result Proposed framework achieves better performance than state-of-the-art deep recommendation methods.
Social media systems rely on user feedback and rating mechanisms for personalization, ranking, and content filtering. However, when users evaluate content contributed by fellow users (e.g., by liking a post or voting on a comment), these evaluations create complex social feedback effects. This paper investigates how ra…
With the growth of user-generated content, we observe the constant rise of the number of companies, such as search engines, content aggregators, etc., that operate with tremendous amounts of web content not being the services hosting it. Thus, aiming to locate the most important content and promote it to the users, the…
SAIN integrates user-item feedback with content attributes for better recommendation.
problem Cold start problems in recommendation models due to sparse user-item interactions.
method SAIN uses a self-attention mechanism to capture feature interactions and an information integration layer to combine feedback and content information.
result SAIN outperforms state-of-the-art models by 2.13% on public datasets.
The study aims to prevent unfair content presentation in recommender systems.
problem Over- and under-presentation of content leads to biased user preference estimates.
method Two models are considered: one that ignores systematic and limited exposure, and another that conditions on limited exposure.
result Ignoring systematic presentations overestimates promoted options and underestimates censored alternatives.
RALM extends exposure for long-tail contents in real-time recommender systems.
problem Lack of timely exposure for long-tail contents in recommender systems.
method Real-time attention-based look-alike model (RALM) with seeds-to-user similarity prediction and user representation learning.
result RALM outperforms traditional look-alike models in effectiveness and real-time performance.
A new approach uses deep learning to manage vehicular content efficiently.
problem Managing content replication and caching in vehicular networks efficiently.
method Data-driven, centralized approach using a Convolutional Neural Network (CNN).
result Effective strategies derived to modulate FC operation in space and adapt to mobility changes.
The problem of predicting the location of users on large social networks like Twitter has emerged from real-life applications such as social unrest detection and online marketing. Twitter user geolocation is a difficult and active research topic with a vast literature. Most of the proposed methods follow either a conte…
The paper presents a dataset and evaluates context-aware TV content recommendations.
problem Lack of data supporting context-aware TV content recommendation systems.
method Developed a dataset of TV consumption with contextual information and evaluated prediction performance.
result Including contextual features improves prediction accuracy, with social and temporal context contributing significantly.
In recent years, content recommendation systems in large websites (or \emph{content providers}) capture an increased focus. While the type of content varies, e.g.\ movies, articles, music, advertisements, etc., the high level problem remains the same. Based on knowledge obtained so far on the user, recommend the most d…
LOLA uses LLMs to optimize content delivery, outperforming traditional methods.
problem Identifying the most engaging headlines for user engagement.
method LOLA integrates LLMs with adaptive experimentation to optimize content delivery.
result LOLA outperforms traditional methods in optimizing user engagement.
Applying traditional collaborative filtering to digital publishing is challenging because user data is very sparse due to the high volume of documents relative to the number of users. Content based approaches, on the other hand, is attractive because textual content is often very informative. In this paper we describe …
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.
Kernel Mean Matching enhances GANs for content-addressable generation.
problem Creating models that can generate images consistent with specified examples.
method Kernel Mean Matching applied to GANs.
result The method generates images consistent with specified input sets while maintaining original model quality.
Measures policy-violating content prevalence with ML-assisted sampling and LLM labeling.
problem Accurate measurement of content violations that are often rare and costly to label.
method Design-based measurement system using ML-assisted probability sampling and LLM labeling.
result Produces unbiased prevalence estimates with confidence intervals and dashboard drilldowns.
This research predicts the popularity of new video contents using a hybrid machine learning approach.
problem Predicting the popularity of new video contents before they are published.
method Hybrid machine learning approach combining XGBoosting and deep neural nets, using metadata and categorical embedding techniques.
result Achieved better performance than standalone methods, validated on a dataset from a top streaming service.
New algorithm poLinUCB improves online learning in content recommendation platforms.
problem Improving efficiency in content recommendation platforms with post-serving context.
method Novel contextual bandit problem with post-serving contexts and a new algorithm, poLinUCB.
result Achieves tight regret under standard assumptions and significant benefit of utilizing post-serving contexts.
Lambda Learner improves model freshness in data streams.
problem Balancing model freshness and computational costs in data streams.
method Incremental updates in response to mini-batches from data streams.
result Lambda Learner outperforms offline models in time-sensitive updates.
Understanding and predicting the popularity of online items is an important open problem in social media analysis. Considerable progress has been made recently in data-driven predictions, and in linking popularity to external promotions. However, the existing methods typically focus on a single source of external influ…
A graph traversal algorithm for cold-start news recommendation using named entities.
problem Cold-start news recommendation for articles without user-specific information.
method Graph traversal algorithm and novel weighting scheme for named entities over a knowledge graph.
result Our method produces stronger Pearson correlation to human similarity scores than other cold-start methods.
Mathematical model audits social media algorithms to prevent bias.
problem Algorithmic filtering can bias users' decisions and societal norms.
method Formalized mathematical framework for auditing social media algorithms.
result Data-driven statistical auditing procedure to regulate algorithmic bias.
SeER hybrid model improves song recommendations and explains them.
problem Improving song recommendations and explaining them.
method Collaborative filtering and deep learning sequence models on MIDI content.
result Personalized explanations capture user preferences.
ITAL uses mutual information for active learning in image retrieval.
problem Acquiring meaningful user feedback for content-based image retrieval.
method Information-Theoretic Active Learning (ITAL) maximizing mutual information between predicted relevance and user feedback.
result ITAL achieves state-of-the-art performance across various datasets.
Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and (largely ad-hoc) hybrid systems. We propose a unified probabilistic framework for merging collaborative and content-based recommendations…
In online social media systems users are not only posting, consuming, and resharing content, but also creating new and destroying existing connections in the underlying social network. While each of these two types of dynamics has individually been studied in the past, much less is known about the connection between th…
Proposes a graph neural network for personalized news recommendation.
problem Data sparsity in news recommendation systems.
method Heterogeneous graph model + Graph Neural Networks + LSTM attention mechanism.
result Significantly outperforms state-of-the-art methods on news recommendation datasets.
Study analyzes Facebook reactions to scholarly articles.
problem Lack of analysis on click-based responses to scholarly content.
method Developed a new dataset of Facebook Reactions, analyzed statistical trends, and trained/tested supervised learning algorithms.
result Preliminary tests suggest stratification in user following based on page subject matter.
Optimizes long-term social welfare in recommender systems by matching users to providers.
problem Realistic recommender systems dynamics affect all agents, not just users.
method Formulated as an optimal constrained matching problem, solved using dynamical system equilibrium selection.
result Ensures maximal social welfare with diverse viable providers, improving over myopic matching.
New term ADS describes how machine learning can change user behavior.
problem Machine learning systems can unintentionally change user behavior, affecting performance.
method Introduced `unit tests` and mitigation strategy for hidden incentives in auto-induced distributional shift.
result Meta-learning and Q-learning sometimes fail unit tests but pass with mitigation strategy.
Paper ranks influential Tor Darknet onion domains using content features.
problem Measuring influence of criminal onion domains in Tor Darknet.
method Content-based features from multiple sources, Learning-to-Rank approach.
result Listwise approach outperforms other methods with NDCG of 0.95 for top-10.
Study uses attention-based method to detect different types of online harassment.
problem Detecting different types of online harassment in social media content.
method Multi-attention based approach using Recurrent Neural Networks to address imbalanced data.
result Demonstrates effectiveness of attention-based mechanism for detecting various types of online harassment.