Please use this identifier to cite or link to this item:
|Title:||Top-k maximal influential paths in network data|
|Source:||Xu, E.,Hsu, W.,Lee, M.L.,Patel, D. (2012). Top-k maximal influential paths in network data. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7446 LNCS (PART 1) : 369-383. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-32600-4_27|
|Abstract:||Information diffusion is a fundamental process taking place in networks. It is often possible to observe when nodes get influenced, but it is hard to directly observe the underlying network. Furthermore, in many applications, the underlying networks are implicit or even unknown. Existing works on network inference can only infer influential edges between two nodes. In this paper, we develop a method for inferring top-k maximal influential paths which can capture the dynamics of information diffusion better compared to influential edges. We define a generative influence propagation model based on the Independent Cascade Model and Linear Threshold Model, which mathematically model the spread of certain information through a network. We formalize the top-k maximal influential path inference problem and develop an efficient algorithm, called TIP, to infer the top-k maximal influential paths. TIP makes use of the properties of top-k maximal influential paths to dynamically increase the support and prune the projected databases. We evaluate the proposed algorithms on both synthetic and real world data sets. The experimental results demonstrate the effectiveness and efficiency of our method. © 2012 Springer-Verlag.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.