1 code implementation • 5 Mar 2024 • Keke Huang, Ruize Gao, Bogdan Cautis, Xiaokui Xiao
Furthermore, we undertake an analysis of the approximation error of FIM for network inference.
no code implementations • 2 Jun 2023 • Yuting Feng, Ankitkumar Patel, Bogdan Cautis, Hossein Vahabi
In this paper, we revisit the problem of influence maximization with fairness, which aims to select k influential nodes to maximise the spread of information in a network, while ensuring that selected sensitive user attributes are fairly affected, i. e., are proportionally similar between the original network and the affected users.
no code implementations • 4 Oct 2022 • Yuting Feng, Bogdan Cautis
Similarly, a time-sensitive user encoder enables us to capture the dynamic preferences of users with an attention-based bidirectional LSTM.
no code implementations • 13 Jan 2022 • Alexandra Iacob, Bogdan Cautis, Silviu Maniu
During a campaign, spread seeds are selected sequentially at consecutive rounds, and feedback is collected in the form of the activated nodes at each round.
no code implementations • 21 Sep 2020 • Silviu Maniu, Stratis Ioannidis, Bogdan Cautis
Our bandit algorithms are tailored precisely to recommendation scenarios where user interests evolve under social influence.