WMEgo: Willingness Maximization for Ego Network Data Extraction in Online Social Networks

Abstract

The data of egocentric networks (ego networks) are very important for evaluating and validating the algorithms and machine learning approaches in Online Social Networks (OSNs). Nevertheless, obtaining the ego network data from OSNs is not a trivial task. Conventional manual approaches are time-consuming, and only a small number of users would agree to contribute their data. This is because there are two important factors that should be considered simultaneously for this data acquisition task: i) users' willingness to contribute their data, and ii) the structure of the ego network. However, addressing the above two factors to obtain the more complete ego network data has not received much research attention. Therefore, in this paper, we make our first attempt to address this issue by proposing a new research problem, named Willingness Maximization for Ego Network Extraction in Online Social Networks (WMEgo), to identify a set of ego networks from the OSN such that the willingness of the users to contribute their data is maximized. We prove that WMEgo is NP-hard and propose a 1 2 (1 − 1)approximation algorithm, named Ego Network Identification with Maximum Willingness (EIMW). We conduct an evaluation study with 672 volunteers to validate the proposed WMEgo and EIMW, and perform extensive experiments on multiple real datasets to demonstrate the effectiveness and efficiency of our approach.

Social-Aware Group Display Configuration in VR Conference

“…Here, SVGD includes two additional constraints: i) Personal preference constraint θ, which requires that for a user u, any user v rendered in u's VR display must have a personal preference at least θ, i.e., p(u, v) ≥ θ, ∀u ∈ V, v ∈ A u . Following (Hsu, Shen, and Chang 2020;Hsu, Lan, and Shen 2018), the above constraint aims to meet the minimum required personal preferences to prevent users from becoming extremely dissatisfied. In SVGD, this personal preference constraint (referred to as preference constraint hereafter) avoids rendering users that receive a low personal preference; ii) Display slot k u for all u ∈ V , which specifies the maximum number of other users that can be rendered on user u's VR display, to prevent too many people being rendered on users' VR displays, making the displays too crowded 1 .…”

Enhancing Link Prediction with Self-Discriminating Augmentation for Structure-Aware Contrastive Learning

“…Among the wide application spectrum of GNNs, link prediction is one of the most important tasks and has been receiving significant research attention as the connectivity of entities is the most essential component in a network. Application scenarios of link prediction include recommendation, e-commerce, friend recommendation in social networks, and much more [32,29,31,18,12,30].…”