Finding links and initiators: a graph reconstruction problem - Computer Science > Artificial IntelligenceReportar como inadecuado




Finding links and initiators: a graph reconstruction problem - Computer Science > Artificial Intelligence - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Consider a 0-1 observation matrix M, where rows correspond to entities andcolumns correspond to signals; a value of 1 or 0 in cell i,j of M indicatesthat signal j has been observed or not observed in entity i. Given such amatrix we study the problem of inferring the underlying directed links betweenentities rows and finding which entries in the matrix are initiators.We formally define this problem and propose an MCMC framework for estimatingthe links and the initiators given the matrix of observations M. We also showhow this framework can be extended to incorporate a temporal aspect; instead ofconsidering a single observation matrix M we consider a sequence of observationmatrices M1,

., Mt over time.We show the connection between our problem and several problems studied inthe field of social-network analysis. We apply our method to paleontologicaland ecological data and show that our algorithms work well in practice and givereasonable results.



Autor: Heikki Mannila, Evimaria Terzi

Fuente: https://arxiv.org/







Documentos relacionados