scispace - formally typeset
Open AccessProceedings ArticleDOI

Temporally Factorized Network Modeling for Evolutionary Network Analysis

TLDR
This work shows that it is indeed possible to achieve the goal of representing the edge structure of the network purely as a function of time with the use of a matrix factorization, in which the entries are parameterized by time.
Abstract
The problem of evolutionary network analysis has gained increasing attention in recent years, because of an increasing number of networks, which are encountered in temporal settings. For example, social networks, communication networks, and information networks continuously evolve over time, and it is desirable to learn interesting trends about how the network structure evolves over time, and in terms of other interesting trends. One challenging aspect of networks is that they are inherently resistant to parametric modeling, which allows us to truly express the edges in the network as functions of time. This is because, unlike multidimensional data, the edges in the network reflect interactions among nodes, and it is difficult to independently model the edge as a function of time, without taking into account its correlations and interactions with neighboring edges. Fortunately, we show that it is indeed possible to achieve this goal with the use of a matrix factorization, in which the entries are parameterized by time. This approach allows us to represent the edge structure of the network purely as a function of time, and predict the evolution of the network over time. This opens the possibility of using the approach for a wide variety of temporal network analysis problems, such as predicting future trends in structures, predicting links, and node-centric anomaly/event detection. This flexibility is because of the general way in which the approach allows us to express the structure of the network as a function of time. We present a number of experimental results on a number of temporal data sets showing the effectiveness of the approach.

read more

Citations
More filters
Proceedings ArticleDOI

NetWalk: A Flexible Deep Embedding Approach for Anomaly Detection in Dynamic Networks

TL;DR: This paper proposes a novel approach, NetWalk, for anomaly detection in dynamic networks by learning network representations which can be updated dynamically as the network evolves, and employs a clustering-based technique to incrementally and dynamically detect network anomalies.
Proceedings ArticleDOI

Link prediction with spatial and temporal consistency in dynamic networks

TL;DR: A computer-implemented method executed by at least one processor for performing link prediction with spatial and temporal consistency by employing a time-dependent matrix factorization technique is presented.
Journal ArticleDOI

Tracking the evolution of overlapping communities in dynamic social networks

TL;DR: A novel Dynamic Overlapping Community Evolution Tracking method to solve the three problems simultaneously with one single model, i.e. topology potential field, which can both accurately partition dynamic overlapping social networks and efficiently track all kinds of community evolution events.
Proceedings ArticleDOI

Exploiting Structural and Temporal Evolution in Dynamic Link Prediction

TL;DR: A novel framework named STEP is proposed, to simultaneously integrate both structural and temporal information in link prediction in dynamic networks, and can be used to solve the link prediction problem in directed or undirected, weighted or unweighted dynamic networks.
Journal ArticleDOI

An Advanced Deep Generative Framework for Temporal Link Prediction in Dynamic Networks

TL;DR: A novel deep generative framework, called NetworkGAN, is proposed to tackle the challenging temporal link prediction task efficiently, which simultaneously models the spatial and temporal features in the dynamic networks via deep learning techniques.
References
More filters
Journal IssueDOI

The link-prediction problem for social networks

TL;DR: Experiments on large coauthorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.
Journal ArticleDOI

Friends and neighbors on the Web

TL;DR: In this paper, the authors show that some factors are better indicators of social connections than others, and that these indicators vary between user populations, and provide potential applications in automatically inferring real world connections and discovering, labeling, and characterizing communities.
Journal ArticleDOI

Graph evolution: Densification and shrinking diameters

TL;DR: In this paper, a new graph generator based on a forest fire spreading process was proposed, which has a simple, intuitive justification, requires very few parameters (like the flammability of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
Proceedings ArticleDOI

Group formation in large social networks: membership, growth, and evolution

TL;DR: It is found that the propensity of individuals to join communities, and of communities to grow rapidly, depends in subtle ways on the underlying network structure, and decision-tree techniques are used to identify the most significant structural determinants of these properties.
Journal ArticleDOI

A Brief History of Generative Models for Power Law and Lognormal Distributions

TL;DR: A rich and long history is found of how lognormal distributions have arisen as a possible alternative to power law distributions across many fields, focusing on underlying generative models that lead to these distributions.
Related Papers (5)