๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Link Mining: Models, Algorithms, and Applications || Mining Large Information Networks by Graph Summarization

โœ Scribed by Yu, Philip S.; Han, Jiawei; Faloutsos, Christos


Book ID
118053501
Publisher
Springer New York
Year
2010
Weight
871 KB
Category
Article
ISBN
1441965157

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the 1st International Worksho
โœ Zeng, ZengFeng; Wu, Bin; Wang, Haoyu ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› ACM Press โš– 730 KB

For the large-scale distributed graph mining, the graph is distributed over a cluster of nodes, thus performing computations on the distributed graph is expensive when large amount of data have to be moved between different computers. A good partitioning of distributed graph is needed to reduce the

[Communications in Computer and Informat
โœ Zhiguo, Gong; Luo, Xiangfeng; Chen, Junjie; Wang, Fu Lee; Lei, Jingsheng ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 199 KB

This book constitutes, together with LNCS 6987 and LNCS 6988, the refereed proceedings of the International Conference on Web Information Systems and Mining, WISM 2011, held in Taiyuan, China, in September 2011. The 112 revised full papers presented in the three volumes were carefully reviewed and s