With the popularity of online social network services, influence maximization on social networks has drawn much attention in recent years. Most of these studies approximate a greedy based sub-optimal solution by proving the submodular nature of the utility function. Instead of using the analytical t
β¦ LIBER β¦
[ACM Press the 18th ACM SIGKDD international conference - Beijing, China (2012.08.12-2012.08.16)] Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '12 - Information propagation game
β Scribed by Chen, Hung-Hsuan; Ciou, Yan-Bin; Lin, Shou-De
- Book ID
- 121225293
- Publisher
- ACM Press
- Year
- 2012
- Weight
- 673 KB
- Category
- Article
- ISBN
- 1450314627
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
[ACM Press the 18th ACM SIGKDD internati
β
Chen, Hung-Hsuan; Ciou, Yan-Bin; Lin, Shou-De
π
Article
π
2012
π
ACM Press
π
English
β 673 KB
[ACM Press the 18th ACM SIGKDD internati
β
Wang, Yu; Agichtein, Eugene; Benzi, Michele
π
Article
π
2012
π
ACM Press
β 601 KB
[ACM Press the 18th ACM SIGKDD internati
β
Shang, Fanhua; Jiao, L.C.; Wang, Fei
π
Article
π
2012
π
ACM Press
π
English
β 465 KB
[ACM Press the 18th ACM SIGKDD internati
β
Feng, Jing; He, Xiao; Konte, Bettina; BΓΆhm, Christian; Plant, Claudia
π
Article
π
2012
π
ACM Press
β 554 KB
[ACM Press the 18th ACM SIGKDD internati
β
Li, Jianzhong
π
Article
π
2012
π
ACM Press
β 373 KB
[ACM Press the 18th ACM SIGKDD internati
β
Li, Jianzhong
π
Article
π
2012
π
ACM Press
π
English
β 373 KB
With the rapid development of advanced data acquisition techniques such as high-throughput biological experiments and wireless sensor networks, large amount of graph-structured data, graph data for short, have been collected in a wide range of applications. Discovering knowledge from graph data has