|
[1] Hbase. http://hbase.apache.org/. [2] Jeffrey Dean and Sanjay Ghemawat. Mapreduce: simplified data processing on large clusters. In Proceedings of the 6th conference on Symposium on Opearting Systems Design and Implementation. [3] Leslie G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103–111, August 1990. [4] Storm. http://storm-project.net/. [5] Grzegorz Malewicz, Matthew H. Austern, Aart J.C Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. Pregel: a system for large-scale graph processing. In Proceedings of the 2010 international conference on Management of data. [6] Hama. http://hama.apache.org/. [7] Giraph. http://giraph.apache.org/. [8] Wei Dong, Charikar Moses, and Kai Li. Efficient k-nearest neighbor graph con- struction for generic similarity measures. In Proceedings of the 20th international conference on World wide web. [9] Kyle H. Ambert and Aaron M. Cohen. k-information gain scaled nearest neigh- bors: A novel approach to classifying protein-protein interaction-related documents. IEEE/ACM Trans. Comput. Biol. Bioinformatics. [10] Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, 1999. [11] G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph parti- tioning. In Supercomputing, 1998. SC98. IEEE/ACM Conference on. [12] Li-Yung Ho, Jan-Jan Wu, and Pangfeng Liu. Distributed graph database for large- scale social computing. In Cloud Computing (CLOUD), 2012 IEEE 5th International Conference on, 2012. [13] Wei Chen, Yifei Yuan, and Li Zhang. Scalable influence maximization in social net- works under the linear threshold model. In Proceedings of the 2010 IEEE International Conference on Data Mining. [14] David Kempe, Jon Kleinberg, and ′ Eva Tardos. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. [15] Xiaohong Wang, Aaron Smalter, Jun Huan, and Gerald H. Lushington. G-hash: towards fast kernel-based similarity search in large graph databases. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT ’09, pages 472–480, New York, NY, USA, 2009. ACM. [16] Luke Wang, Yanghua Xiao, and Haixun Wang. How to partition a billion-node graph. Technical report, Microsoft Research Asia, 2013. [17] Michele Coscia, Giulio Rossetti, Fosca Giannotti, and Dino Pedreschi. Demon: a local-first discovery method for overlapping communities. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’12, pages 615–623, New York, NY, USA, 2012. ACM. [18] Alan Mislove, Massimiliano Marcon, Krishna P. Gummadi, Peter Druschel, and Bobby Bhattacharjee. Measurement and Analysis of Online Social Networks. In Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC’07).
|