𝔖 Bobbio Scriptorium
✦   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 - Fast algorithms for maximal clique enumeration with limited memory

✍ Scribed by Cheng, James; Zhu, Linhong; Ke, Yiping; Chu, Shumo

Book ID
120556473
Publisher
ACM Press
Year
2012
Weight
482 KB
Category
Article
ISBN
1450314627

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[ACM Press the 18th ACM SIGKDD internati
[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 - Algorithms for mining uncertain graph data
✍ 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

[ACM Press the 18th ACM SIGKDD internati
[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
✍ Chen, Hung-Hsuan; Ciou, Yan-Bin; Lin, Shou-De πŸ“‚ Article πŸ“… 2012 πŸ› ACM Press 🌐 English βš– 673 KB

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