Personal Assistant Systems
End-to-end solution for linked open data query logs analytics
In big data Era, significant advances in e-commerce, targeted marketing, social shopping, e-tourism, etc. are derived basically from collective intelligence. Such applications mainly exploit data generated by users to extract different valuable information. User content represents data, information, or media content voluntarily provided by people Krumm et al. [2008], when they interact with web sites, social media, and data sources, etc. This data regroups social data, YouTube videos, blogs and micro-blogs, query-logs, etc. Analysis of this data provides useful information helping to understand user behavior, user opinions, topics of interest, etc. It helps to detect hidden patterns and to construct users' profiles, in order to propose user-centric solutions like: recommendation systems, content personalization, cache improvement, etc. for successful user experience.
Personalizing explanations of AI-driven hints to users' cognitive abilities: an empirical evaluation
Bahel, Vedant, Sriram, Harshinee, Conati, Cristina
We investigate personalizing the explanations that an Intelligent Tutoring System generates to justify the hints it provides to students to foster their learning. The personalization targets students with low levels of two traits, Need for Cognition and Conscientiousness, and aims to enhance these students' engagement with the explanations, based on prior findings that these students do not naturally engage with the explanations but they would benefit from them if they do. To evaluate the effectiveness of the personalization, we conducted a user study where we found that our proposed personalization significantly increases our target users' interaction with the hint explanations, their understanding of the hints and their learning. Hence, this work provides valuable insights into effectively personalizing AI-driven explanations for cognitively demanding tasks such as learning.
Multi-Tower Multi-Interest Recommendation with User Representation Repel
In the era of information overload, the value of recommender systems has been profoundly recognized in academia and industry alike. Multi-interest sequential recommendation, in particular, is a subfield that has been receiving increasing attention in recent years. By generating multiple-user representations, multi-interest learning models demonstrate superior expressiveness than single-user representation models, both theoretically and empirically. Despite major advancements in the field, three major issues continue to plague the performance and adoptability of multi-interest learning methods, the difference between training and deployment objectives, the inability to access item information, and the difficulty of industrial adoption due to its single-tower architecture. We address these challenges by proposing a novel multi-tower multi-interest framework with user representation repel. Experimental results across multiple large-scale industrial datasets proved the effectiveness and generalizability of our proposed framework.
Personalized Audiobook Recommendations at Spotify Through Graph Neural Networks
De Nadai, Marco, Fabbri, Francesco, Gigioli, Paul, Wang, Alice, Li, Ang, Silvestri, Fabrizio, Kim, Laura, Lin, Shawn, Radosavljevic, Vladan, Ghael, Sandeep, Nyhan, David, Bouchard, Hugues, Lalmas-Roelleke, Mounia, Damianou, Andreas
In the ever-evolving digital audio landscape, Spotify, well-known for its music and talk content, has recently introduced audiobooks to its vast user base. While promising, this move presents significant challenges for personalized recommendations. Unlike music and podcasts, audiobooks, initially available for a fee, cannot be easily skimmed before purchase, posing higher stakes for the relevance of recommendations. Furthermore, introducing a new content type into an existing platform confronts extreme data sparsity, as most users are unfamiliar with this new content type. Lastly, recommending content to millions of users requires the model to react fast and be scalable. To address these challenges, we leverage podcast and music user preferences and introduce 2T-HGNN, a scalable recommendation system comprising Heterogeneous Graph Neural Networks (HGNNs) and a Two Tower (2T) model. This novel approach uncovers nuanced item relationships while ensuring low latency and complexity. We decouple users from the HGNN graph and propose an innovative multi-link neighbor sampler. These choices, together with the 2T component, significantly reduce the complexity of the HGNN model. Empirical evaluations involving millions of users show significant improvement in the quality of personalized recommendations, resulting in a +46% increase in new audiobooks start rate and a +23% boost in streaming rates. Intriguingly, our model's impact extends beyond audiobooks, benefiting established products like podcasts.
Facebook is using AI to supercharge the algorithm that recommends you videos
Meta is revamping how Facebook recommends videos across Reels, Groups, and the main Facebook Feed, by using AI to power its video recommendation algorithm, Facebook head Tom Alison revealed on Wednesday. The world's largest social network has already switched Reels, its TikTok competitor, to the new engine, and plans to use it in all places within Facebook that show video -- the main Facebook feed and Groups -- as part of a "technology roadmap" through 2026, Alison said at a Morgan Stanley tech conference in San Francisco. Meta has made competing with TikTok a top priority ever since the app, which serves up vertical video clips and is known for its powerful recommendation engine that seems to know exactly what will keep users hooked, started exploding in popularity in the US in the last few years. When Facebook tested the new AI-powered recommendation engine with Reels, watch time went up by roughly 8 to 10 percent, Alison revealed. "So what that told us was this new model architecture is learning from the data much more efficiently than the previous generation," Alison said. "So that was like a good sign that says, OK, we're on the right track."
Uncovering the Deep Filter Bubble: Narrow Exposure in Short-Video Recommendation
Sukiennik, Nicholas, Gao, Chen, Li, Nian
Filter bubbles have been studied extensively within the context of online content platforms due to their potential to cause undesirable outcomes such as user dissatisfaction or polarization. With the rise of short-video platforms, the filter bubble has been given extra attention because these platforms rely on an unprecedented use of the recommender system to provide relevant content. In our work, we investigate the deep filter bubble, which refers to the user being exposed to narrow content within their broad interests. We accomplish this using one-year interaction data from a top short-video platform in China, which includes hierarchical data with three levels of categories for each video. We formalize our definition of a "deep" filter bubble within this context, and then explore various correlations within the data: first understanding the evolution of the deep filter bubble over time, and later revealing some of the factors that give rise to this phenomenon, such as specific categories, user demographics, and feedback type. We observe that while the overall proportion of users in a filter bubble remains largely constant over time, the depth composition of their filter bubble changes. In addition, we find that some demographic groups that have a higher likelihood of seeing narrower content and implicit feedback signals can lead to less bubble formation. Finally, we propose some ways in which recommender systems can be designed to reduce the risk of a user getting caught in a bubble.
Improving Matrix Completion by Exploiting Rating Ordinality in Graph Neural Networks
Lee, Jaehyun, Kang, SeongKu, Yu, Hwanjo
Matrix completion is an important area of research in recommender systems. Recent methods view a rating matrix as a user-item bi-partite graph with labeled edges denoting observed ratings and predict the edges between the user and item nodes by using the graph neural network (GNN). Despite their effectiveness, they treat each rating type as an independent relation type and thus cannot sufficiently consider the ordinal nature of the ratings. In this paper, we explore a new approach to exploit rating ordinality for GNN, which has not been studied well in the literature. We introduce a new method, called ROGMC, to leverage Rating Ordinality in GNN-based Matrix Completion. It uses cumulative preference propagation to directly incorporate rating ordinality in GNN's message passing, allowing for users' stronger preferences to be more emphasized based on inherent orders of rating types. This process is complemented by interest regularization which facilitates preference learning using the underlying interest information. Our extensive experiments show that ROGMC consistently outperforms the existing strategies of using rating types for GNN. We expect that our attempt to explore the feasibility of utilizing rating ordinality for GNN may stimulate further research in this direction.
Modeling User Viewing Flow Using Large Language Models for Article Recommendation
Liu, Zhenghao, Chen, Zulong, Zhang, Moufeng, Duan, Shaoyang, Wen, Hong, Li, Liangyue, Li, Nan, Gu, Yu, Yu, Ge
This paper proposes the User Viewing Flow Modeling (SINGLE) method for the article recommendation task, which models the user constant preference and instant interest from user-clicked articles. Specifically, we first employ a user constant viewing flow modeling method to summarize the user's general interest to recommend articles. In this case, we utilize Large Language Models (LLMs) to capture constant user preferences from previously clicked articles, such as skills and positions. Then we design the user instant viewing flow modeling method to build interactions between user-clicked article history and candidate articles. It attentively reads the representations of user-clicked articles and aims to learn the user's different interest views to match the candidate article. Our experimental results on the Alibaba Technology Association (ATA) website show the advantage of SINGLE, achieving a 2.4% improvement over previous baseline models in the online A/B test. Our further analyses illustrate that SINGLE has the ability to build a more tailored recommendation system by mimicking different article viewing behaviors of users and recommending more appropriate and diverse articles to match user interests.
The job applicants shut out by AI: 'The interviewer sounded like Siri'
When Ty landed an introductory phone interview with a finance and banking company last month, they assumed it would be a quick chat with a recruiter. And when they got on the phone, Ty assumed the recruiter, who introduced herself as Jaime, was human. "The voice sounded similar to Siri," said Ty, who is 29 and lives in the DC metro area. Ty realized they weren't speaking to a living, breathing person. Their interviewer was an AI system, and one with a rather rude habit.
Dating apps have gotten so bad that speed dating is in again
Tierney had discovered this event in the most analog way possible: He spotted a paper flier on a nearby telephone pole. It had led him to a site called Shuffle, a speed-dating service he and other participants said seems like a "nice break" from the "discouraging" process of app dating. They had paid 24.99 to attend -- and would be charged twice that if they didn't show, a penalty meant to prevent the flakiness endemic to online dating. The event has no in-person host, relying instead on Shuffle's website to signal the start and end of each conversation. At the end of the night they'll "match" or pass on each 10-minute date, and the next day they'll learn whether any prospects return their interest.