作者: Bo Zong , Yinghui Wu , Ambuj K. Singh , Xifeng Yan
关键词:
摘要: In social networks, information and influence diffuse among users as cascades. While the importance of studying cascades has been recognized in various applications, it is difficult to observe complete structure practice. this paper we study cascade inference problem following independent model, provide a full treatment from complexity algorithms: (a) propose idea consistent trees inferred structures for cascades, these connect source nodes observed with paths satisfying constraints temporal information. (b) We introduce metrics measure likelihood well several optimization problems finding them. (c) show that decision are general NP-complete, hard approximate. (d) approximation algorithms performance guarantees on quality heuristics. experimentally verify efficiency effectiveness our algorithms, using real synthetic data.