Improved sampling for triangle counting with MapReduce

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6935 LNCS, Issue , 2011, Pages 685-689

  Yoon, Jin Hyun ^a   Kim, Sung Ryul ^a  

^a Konkuk University   (South Korea)

Author keywords

Data Mining; Hadoop; MapReduce; Sampling; Triangle Counting

Indexed keywords

COUNTING PROBLEMS; DATA MINING APPLICATIONS; HADOOP; MAP-REDUCE; NUMBER OF TRIANGLES; REAL-WORLD GRAPHS; TRIANGLE COUNTING;

INFORMATION TECHNOLOGY;

DATA MINING;

EID: 80054059720     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24082-9_83     Document Type: Conference Paper

References (9)

1. Achlioptas, D., McSherry, F.: Fast computation of low rank matrix approximation. In: STOC (2001)
2. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC 1996:Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 20-29. ACM, New York (1996)
3. Bar-Yosseff, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: SODA 2002: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 623-632. Society for Industrial and Applied Mathematics, Philadelphia (2002)
4. Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of ACM KDD, Las Vegas, NV, USA (August 2008)
5. Buriol, L.S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: PODS 2006: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 253-262. ACM, New York (2006)
6. Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: OSDI (2004)
7. Jowhari, H., Ghodsi, M.: New streaming algorithms for counting triangles in graphs. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 710-716. Springer, Heidelberg (2005) (Pubitemid 41450248)
8. Tsourakakis, C., Drineas, P., Michelakis, E., Koutis, I., Faloutsos, C.: Spectral counting of triangles in power-law networks via element-wise sparsification. In: SODA 2002: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2009)
9. Tsourakakis, C., Kang, U., Miller, G., Faloutsos, C.: DOULION: Counting Triangles in Massive Graphs with a Coin. In: Proceedings of KDD, pp. 837-846 (2009)