Who will accept my request? Predicting response of link initiation in two-way relation networks

• URL: http://arxiv.org/abs/2012.11172v1
• Date: Mon, 21 Dec 2020 08:14:37 GMT
• Title: Who will accept my request? Predicting response of link initiation in two-way relation networks
• Authors: Amin Javari, Mehrab Norouzitallab, Mahdi Jalili
• Abstract summary: This paper addresses an important problem in social networks analysis and mining that is how to predict link initiation feedback in two-way networks. Relationships between two individuals in a two-way network include a link invitation from one of the individuals, which will be an established link if accepted by the invitee. We propose a methodology to solve the link initiation feedback prediction problem in this multilayer fashion.
• Score: 7.547803601922528
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Popularity of social networks has rapidly increased over the past few years, and daily lives interrupt without their proper functioning. Social networking platform provide multiple interaction types between individuals, such as creating and joining groups, sending and receiving messages, sharing interests and creating friendship relationships. This paper addresses an important problem in social networks analysis and mining that is how to predict link initiation feedback in two-way networks. Relationships between two individuals in a two-way network include a link invitation from one of the individuals, which will be an established link if it is accepted by the invitee. We consider a sport gaming social networking platform and construct a multilayer social network between a number of users. The network formed by the link initiation process is on one of the layers, while the other two layers include a messaging relationships and interactions between the users. We propose a methodology to solve the link initiation feedback prediction problem in this multilayer fashion. The proposed method is based on features extracted from meta-paths, i.e. paths defined between different individuals from multiples layers in multilayer networks. We proposed a cluster-based approach to handle the sparsity issue in the dataset. Experimental results show that the proposed method can provide accurate prediction that outperforms state-of-the-art methods.

Related papers

• Community Detection for Heterogeneous Multiple Social Networks [6.863667633281842]
  The community plays a crucial role in understanding user behavior and network characteristics in social networks. This paper presents a community detection method based on nonnegative matrix tri-factorization for multiple social networks. The effectiveness of the proposed method is evaluated with new metrics on Twitter, Instagram, and Tumblr.
  arXiv  Detail & Related papers  (2024-05-07T14:52:34Z)
• Hierarchical Information Enhancement Network for Cascade Prediction in Social Networks [51.54002032659713]
  We propose a novel Hierarchical Information Enhancement Network (HIENet) for cascade prediction. Our approach integrates fundamental cascade sequence, user social graphs, and sub-cascade graph into a unified framework.
  arXiv  Detail & Related papers  (2024-03-22T14:57:27Z)
• Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees [81.6471440778355]
  We propose a Cross-network Social User Embedding framework, namely DP-CroSUE, to learn the comprehensive representations of users in a privacy-preserving way. In particular, for each heterogeneous social network, we first introduce a hybrid differential privacy notion to capture the variation of privacy expectations for heterogeneous data types. To further enhance user embeddings, a novel cross-network GCN embedding model is designed to transfer knowledge across networks through those aligned users.
  arXiv  Detail & Related papers  (2022-09-04T06:22:37Z)
• A General Method to Find Highly Coordinating Communities in Social Media through Inferred Interaction Links [13.264683014487376]
  Political misinformation, astroturfing and organised trolling are online malicious behaviours with significant real-world effects. We propose a novel temporal window approach that relies on account interactions and metadata alone. It detects groups of accounts engaging in various behaviours that, in concert, come to execute different goal-based strategies.
  arXiv  Detail & Related papers  (2021-03-05T00:48:23Z)
• Decoupled and Memory-Reinforced Networks: Towards Effective Feature Learning for One-Step Person Search [65.51181219410763]
  One-step methods have been developed to handle pedestrian detection and identification sub-tasks using a single network. There are two major challenges in the current one-step approaches. We propose a decoupled and memory-reinforced network (DMRNet) to overcome these problems.
  arXiv  Detail & Related papers  (2021-02-22T06:19:45Z)
• Multi-level Graph Convolutional Networks for Cross-platform Anchor Link Prediction [47.047999403900775]
  Cross-platform account matching plays a significant role in social network analytics. We propose a novel framework that considers multi-level graph convolutions on both local network structure and hypergraph structure. The proposed method overcomes data insufficiency problem of existing work and does not necessarily rely on user demographic information.
  arXiv  Detail & Related papers  (2020-06-02T22:01:27Z)
• A Social Search Model for Large Scale Social Networks [4.3835068018995935]
  Retrieval system treats social connections as indexing terms, and generates meaningful results sets by biasing towards close social connections. Deep neural network handles textual and social relevance in a two-tower approach, in which personalization and textual relevance are addressed jointly. System is deployed on Facebook and is helping billions of users finding postings from their connections efficiently.
  arXiv  Detail & Related papers  (2020-05-09T02:59:02Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36:24Z)
• DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation [50.08581302050378]
  Social recommendation has emerged to leverage social connections among users for predicting users' unknown preferences. We propose a preliminary work of a neural influence diffusion network (i.e., DiffNet) for social recommendation (Diffnet) In this paper, we propose DiffNet++, an improved algorithm of Diffnet that models the neural influence diffusion and interest diffusion in a unified framework.
  arXiv  Detail & Related papers  (2020-01-15T08:45:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.