[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 - Summarization-based mining bipartite graphs
✍ Scribed by Feng, Jing; He, Xiao; Konte, Bettina; Böhm, Christian; Plant, Claudia
- Book ID
- 118050626
- Publisher
- ACM Press
- Year
- 2012
- Weight
- 554 KB
- Category
- Article
- ISBN
- 1450314627
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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