DocumentCode :
34258
Title :
Multi-Layer Graph Analysis for Dynamic Social Networks
Author :
Oselio, Brandon ; Kulesza, Alex ; Hero, Alfred O.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Univ. of Michigan, Ann Arbor, MI, USA
Volume :
8
Issue :
4
fYear :
2014
fDate :
Aug. 2014
Firstpage :
514
Lastpage :
523
Abstract :
Modern social networks frequently encompass multiple distinct types of connectivity information; for instance, explicitly acknowledged friend relationships might complement behavioral measures that link users according to their actions or interests. One way to represent these networks is as multi-layer graphs, where each layer contains a unique set of edges over the same underlying vertices (users). Edges in different layers typically have related but distinct semantics; depending on the application multiple layers might be used to reduce noise through averaging, to perform multifaceted analyses, or a combination of the two. However, it is not obvious how to extend standard graph analysis techniques to the multi-layer setting in a flexible way. In this paper we develop latent variable models and methods for mining multi-layer networks for connectivity patterns based on noisy data.
Keywords :
graph theory; network theory (graphs); social networking (online); application multiple layers; connectivity patterns; dynamic social networks; latent variable models; multilayer graph analysis techniques; multilayer network mining; noise reduction; noisy data; Bayes methods; Communities; Electronic mail; Kalman filters; Optimization; Social network services; Stochastic processes; Hypergraphs; Pareto optimality; mixture graphical models; multigraphs;
fLanguage :
English
Journal_Title :
Selected Topics in Signal Processing, IEEE Journal of
Publisher :
ieee
ISSN :
1932-4553
Type :
jour
DOI :
10.1109/JSTSP.2014.2328312
Filename :
6824807
Link To Document :
بازگشت