scholarly journals HID: Hierarchical Multiscale Representation Learning for Information Diffusion

2020 ◽  
Author(s):  
Honglu Zhou ◽  
Shuyuan Xu ◽  
Zuohui Fu ◽  
Gerard de Melo ◽  
Yongfeng Zhang ◽  
...  
Keyword(s):  
Multiscale Modeling ◽  
Online Social Networks ◽  
Information Diffusion ◽  
Representation Learning ◽  
Complex Interactions ◽  
Learning Tasks ◽  
Current State ◽  
Real World Datasets ◽  
Vector Representations ◽  
Hierarchical Multiscale

Multiscale modeling has yielded immense success on various machine learning tasks. However, it has not been properly explored for the prominent task of information diffusion, which aims to understand how information propagates along users in online social networks. For a specific user, whether and when to adopt a piece of information propagated from another user is affected by complex interactions, and thus, is very challenging to model. Current state-of-the-art techniques invoke deep neural models with vector representations of users. In this paper, we present a Hierarchical Information Diffusion (HID) framework by integrating user representation learning and multiscale modeling. The proposed framework can be layered on top of all information diffusion techniques that leverage user representations, so as to boost the predictive power and learning efficiency of the original technique. Extensive experiments on three real-world datasets showcase the superiority of our method.

scholarly journals Exponential Family Graph Embeddings

2020 ◽  
Vol 34 (04) ◽  
pp. 3357-3364
Author(s):  
Abdulkadir Celikkanat ◽  
Fragkiskos D. Malliaros
Keyword(s):  
Random Walk ◽  
Exponential Family ◽  
Representation Learning ◽  
Learning Problems ◽  
Interaction Patterns ◽  
Network Representation ◽  
Learning Tasks ◽  
Learning Techniques ◽  
Real World Datasets ◽  
Low Dimensional

Representing networks in a low dimensional latent space is a crucial task with many interesting applications in graph learning problems, such as link prediction and node classification. A widely applied network representation learning paradigm is based on the combination of random walks for sampling context nodes and the traditional Skip-Gram model to capture center-context node relationships. In this paper, we emphasize on exponential family distributions to capture rich interaction patterns between nodes in random walk sequences. We introduce the generic exponential family graph embedding model, that generalizes random walk-based network representation learning techniques to exponential family conditional distributions. We study three particular instances of this model, analyzing their properties and showing their relationship to existing unsupervised learning models. Our experimental evaluation on real-world datasets demonstrates that the proposed techniques outperform well-known baseline methods in two downstream machine learning tasks.

scholarly journals A novel information diffusion model based on psychosocial factors with automatic parameter learning

2020 ◽  
pp. 50-50
Author(s):  
Sabina-Adriana Floria ◽  
Florin Leon
Keyword(s):  
Online Social Networks ◽  
Information Diffusion ◽  
Gregarious Behavior ◽  
Proposed Model ◽  
Transmission Of Information ◽  
Two Factors ◽  
Information Diffusion Model ◽  
Real World Datasets ◽  
Sociological Factor ◽  
Novel Model

Online social networks are the main choice of people to maintain their social relationships and share information or opinions. Estimating the actions of a user is not trivial because an individual can act spontaneously or be influenced by external factors. In this paper we propose a novel model for imitating the evolution of the information diffusion in a network as well as possible. Each individual is modeled as a node with two factors (psychological and sociological) that control its probabilistic transmission of information. The psychological factor refers to the node?s preference for the topic discussed, i.e. the information diffused. The sociological factor takes into account the influence of the neighbors? activity on the node, i.e. the gregarious behavior. A genetic algorithm is used to automatically tune the parameters of the model in order to fit the evolution of information diffusion observed in two real-world datasets with three topics. The reproduced diffusions show that the proposed model imitates the real diffusions very well.

scholarly journals Unsupervised Representation Learning by Predicting Random Distances

2020 ◽  
Author(s):  
Hu Wang ◽  
Guansong Pang ◽  
Chunhua Shen ◽  
Congbo Ma
Keyword(s):  
Neural Networks ◽  
Anomaly Detection ◽  
Unsupervised Learning ◽  
Large Scale ◽  
Deep Neural Networks ◽  
State Of The Art ◽  
Representation Learning ◽  
Great Success ◽  
Learning Tasks ◽  
Real World Datasets

Deep neural networks have gained great success in a broad range of tasks due to its remarkable capability to learn semantically rich features from high-dimensional data. However, they often require large-scale labelled data to successfully learn such features, which significantly hinders their adaption in unsupervised learning tasks, such as anomaly detection and clustering, and limits their applications to critical domains where obtaining massive labelled data is prohibitively expensive. To enable unsupervised learning on those domains, in this work we propose to learn features without using any labelled data by training neural networks to predict data distances in a randomly projected space. Random mapping is a theoretically proven approach to obtain approximately preserved distances. To well predict these distances, the representation learner is optimised to learn genuine class structures that are implicitly embedded in the randomly projected space. Empirical results on 19 real-world datasets show that our learned representations substantially outperform a few state-of-the-art methods for both anomaly detection and clustering tasks. Code is available at: \url{https://git.io/RDP}

Rumour detection based on deep hybrid structural and sequential representation networks

2021 ◽  
pp. 016555152110565
Author(s):  
He Zhu
Keyword(s):  
Online Social Networks ◽  
Network Architecture ◽  
Early Stage ◽  
Rapid Development ◽  
Practical Importance ◽  
Representation Learning ◽  
Economic Losses ◽  
Stream Network ◽  
Fine Grained ◽  
Real World Datasets

The rapid development of online social networks significantly facilitates the interaction of people and dramatically expands the diffusion sphere of information. Rumours, however, are not excluded from the list of beneficiaries. The widespread of rumours has lengthened the psychological distance and caused tremendous economic losses, and rumour detection has become an inescapable and challenging task of great practical importance. In this work, we propose a novel neural network architecture for rumour classification and early rumour detection of fine-grained categories. Unlike using tree-like modules for structural feature extraction, we build an information stream network and employ graph convolutional networks to explore the relations among the hierarchical nodes in the network. To enhance the sequential representation learning, the module of deep bilateral gated recurrent units is further incorporated to reveal the crucial features hiding behind the information flow. Moreover, to organically fuse the learned high-dimensionally structural and sequential features, attention mechanism is applied to automatically adjust the trainable weights. Comparative experiments on two real-world datasets demonstrate that our proposed model outperforms the state-of-the-art methods in the task of fine-grained rumour classification and is capable of identifying rumours at an early stage.

Scholar2vec: Vector Representation of Scholars for Lifetime Collaborator Prediction

2021 ◽  
Vol 15 (3) ◽  
pp. 1-19
Author(s):  
Wei Wang ◽  
Feng Xia ◽  
Jian Wu ◽  
Zhiguo Gong ◽  
Hanghang Tong ◽  
...  
Keyword(s):  
Scientific Collaboration ◽  
Early Stage ◽  
Collaboration Network ◽  
Vector Representation ◽  
Network Embedding ◽  
Machine Learning Methods ◽  
Academic Networks ◽  
Special Relationships ◽  
Real World Datasets ◽  
Vector Representations

While scientific collaboration is critical for a scholar, some collaborators can be more significant than others, e.g., lifetime collaborators. It has been shown that lifetime collaborators are more influential on a scholar’s academic performance. However, little research has been done on investigating predicting such special relationships in academic networks. To this end, we propose Scholar2vec, a novel neural network embedding for representing scholar profiles. First, our approach creates scholars’ research interest vector from textual information, such as demographics, research, and influence. After bridging research interests with a collaboration network, vector representations of scholars can be gained with graph learning. Meanwhile, since scholars are occupied with various attributes, we propose to incorporate four types of scholar attributes for learning scholar vectors. Finally, the early-stage similarity sequence based on Scholar2vec is used to predict lifetime collaborators with machine learning methods. Extensive experiments on two real-world datasets show that Scholar2vec outperforms state-of-the-art methods in lifetime collaborator prediction. Our work presents a new way to measure the similarity between two scholars by vector representation, which tackles the knowledge between network embedding and academic relationship mining.

scholarly journals Relation Representation Learning Via Signed Graph Mutual Information Maximization for Trust Prediction

Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 115
Author(s):  
Yongjun Jing ◽  
Hao Wang ◽  
Kun Shao ◽  
Xing Huo
Keyword(s):  
Mutual Information ◽  
Representation Learning ◽  
Signed Graph ◽  
Trust Prediction ◽  
Trust Networks ◽  
Trust Relation ◽  
Information Maximization ◽  
Real World Datasets ◽  
Negative Links ◽  
Mutual Information Maximization

Trust prediction is essential to enhancing reliability and reducing risk from the unreliable node, especially for online applications in open network environments. An essential fact in trust prediction is to measure the relation of both the interacting entities accurately. However, most of the existing methods infer the trust relation between interacting entities usually rely on modeling the similarity between nodes on a graph and ignore semantic relation and the influence of negative links (e.g., distrust relation). In this paper, we proposed a relation representation learning via signed graph mutual information maximization (called SGMIM). In SGMIM, we incorporate a translation model and positive point-wise mutual information to enhance the relation representations and adopt Mutual Information Maximization to align the entity and relation semantic spaces. Moreover, we further develop a sign prediction model for making accurate trust predictions. We conduct link sign prediction in trust networks based on learned the relation representation. Extensive experimental results in four real-world datasets on trust prediction task show that SGMIM significantly outperforms state-of-the-art baseline methods.

Knowledge-aware Multi-modal Adaptive Graph Convolutional Networks for Fake News Detection

2021 ◽  
Vol 17 (3) ◽  
pp. 1-23
Author(s):  
Shengsheng Qian ◽  
Jun Hu ◽  
Quan Fang ◽  
Changsheng Xu
Keyword(s):  
Social Media ◽  
Visual Information ◽  
Representation Learning ◽  
Fake News ◽  
Unified Framework ◽  
Model Learning ◽  
Convolutional Network ◽  
Textual Information ◽  
Convolutional Networks ◽  
Real World Datasets

In this article, we focus on fake news detection task and aim to automatically identify the fake news from vast amount of social media posts. To date, many approaches have been proposed to detect fake news, which includes traditional learning methods and deep learning-based models. However, there are three existing challenges: (i) How to represent social media posts effectively, since the post content is various and highly complicated; (ii) how to propose a data-driven method to increase the flexibility of the model to deal with the samples in different contexts and news backgrounds; and (iii) how to fully utilize the additional auxiliary information (the background knowledge and multi-modal information) of posts for better representation learning. To tackle the above challenges, we propose a novel Knowledge-aware Multi-modal Adaptive Graph Convolutional Networks (KMAGCN) to capture the semantic representations by jointly modeling the textual information, knowledge concepts, and visual information into a unified framework for fake news detection. We model posts as graphs and use a knowledge-aware multi-modal adaptive graph learning principal for the effective feature learning. Compared with existing methods, the proposed KMAGCN addresses challenges from three aspects: (1) It models posts as graphs to capture the non-consecutive and long-range semantic relations; (2) it proposes a novel adaptive graph convolutional network to handle the variability of graph data; and (3) it leverages textual information, knowledge concepts and visual information jointly for model learning. We have conducted extensive experiments on three public real-world datasets and superior results demonstrate the effectiveness of KMAGCN compared with other state-of-the-art algorithms.

scholarly journals An Exploratory Study of COVID-19 Information on Twitter in the Greater Region

2021 ◽  
Vol 5 (1) ◽  
pp. 5
Author(s):  
Ninghan Chen ◽  
Zhiqiang Zhong ◽  
Jun Pang
Keyword(s):  
Machine Learning ◽  
Social Networks ◽  
Online Social Networks ◽  
Exploratory Study ◽  
Representation Learning ◽  
Data Driven ◽  
Learning Methods ◽  
Twitter Users ◽  
Over Time

The outbreak of the COVID-19 led to a burst of information in major online social networks (OSNs). Facing this constantly changing situation, OSNs have become an essential platform for people expressing opinions and seeking up-to-the-minute information. Thus, discussions on OSNs may become a reflection of reality. This paper aims to figure out how Twitter users in the Greater Region (GR) and related countries react differently over time through conducting a data-driven exploratory study of COVID-19 information using machine learning and representation learning methods. We find that tweet volume and COVID-19 cases in GR and related countries are correlated, but this correlation only exists in a particular period of the pandemic. Moreover, we plot the changing of topics in each country and region from 22 January 2020 to 5 June 2020, figuring out the main differences between GR and related countries.

Sign in / Sign up

Export Citation Format

Share Document