12 April 2024 in ACM Transactions on Knowledge Discovery From Data
How can we adapt the composition of a post over a series of rounds to make it more appealing in a social network? Techniques that progressively learn how to make a fixed post more influential over rounds have been studied in the context of the Influence Maximization (IM) problem, which seeks a set of seed users that maximize a post’s influence. However, there is no work on progressively learning how a post’s features affect its influence. In this article, we propose and study the problem of Adaptive Content-Aware Influence Maximization (ACAIM), which calls to find k features to form a post in each round so as to maximize the cumulative influence of those posts over all rounds. We solve ACAIM by applying, for the first time, an Online Learning to Rank (OLR) framework for IM purposes. We introduce the CATRID propagation model , which expresses how posts disseminate in a social network using click probabilities and post visibility criteria and develop a simulator that runs CATRID via a training-testing scheme based on real posts of the VK social network, so as to realistically represent the learning environment. We deploy three learners that solve ACAIM in an online (real-time) manner. We experimentally prove the practical suitability of our solutions via exhaustive experiments on multiple brands (operating as different case studies ) and several VK datasets; the best learner is evaluated on 45 separate case studies yielding convincing results.
4 February 2026 in IEEE Transactions on Computational Social Systems
In a series of our prior works, we study influence and subscription maximization problems in social networks that are based on posts having influential content; as content we consider a set of features where each feature corresponds to a specific social network page, whereas influence and subscription relate to gaining the postlike and subscription-to-brand page of targeted users, respectively; subscription is conceptually achieved as repetitive influence on users. So, both influence and subscription depend on content that gains the likes of users; however, to be realistic, modeling and estimating such likes is a complex problem that has not been adequately studied via a computational way. In this article, we propose a novel perspective on the mentioned content-aware research that has the potential to really understand the user likes to social network posts. By the term $\mathsf{feelit}$ system, we refer to the combined result of this proposal with our previous content-aware research, so as to estimate the user likes in a much more analytical way than before. We provide realistic examples to clarify the operation of $\mathsf{feelit}$ , and we discuss a number of technical challenges associated with it. Our contributions are beneficial to several formulations of influence maximization in the literature since $\mathsf{feelit}$ provides an accurate and advanced way for brands to estimate the user likes to their posts.
1 October 2026 in IEEE Transactions on Computational Social Systems