Efficient parallel subgraph counting using G-tries

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2010, Pages 217-226

  Ribeiro, Pedro ^a   Silva, Fernando ^a   Lopes, Luís ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Adaptive load balancing; Complex networks; G tries; Graph mining; Parallel algorithms

Indexed keywords

ADAPTIVE LOAD BALANCING; COMPLEX NETWORKS; DYNAMIC LOAD BALANCING; G-TRIES; GRAPH ISOMORPHISM; GRAPH MINING; HARD PROBLEMS; LARGER NETWORKS; LINEAR SPEED-UP; NETWORK MEASUREMENT; NETWORK MOTIF; RECEIVER-INITIATED; SUBGRAPHS;

ADAPTIVE ALGORITHMS; CIRCUIT THEORY; CLUSTER COMPUTING; DYNAMIC LOADS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

COMPUTATIONAL EFFICIENCY;

EID: 78649461072     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTER.2010.27     Document Type: Conference Paper

References (34)

1. R. Albert and A. L. Barabasi, "Statistical mechanics of complex networks," Reviews of Modern Physics, vol. 74, no. 1, 2002.
2. L. da F. Costa, O. N. Oliveira Jr, G. Travieso, F. A. Rodrigues, P. R. V. Boas, L. Antiqueira, M. P. Viana, and L. E. C. da Rocha, "Analyzing and modeling real-world phenomena with complex networks: A survey of applications," ArXiv e-prints, vol. 0711, no. 3199, 2007.
3. L. da F. Costa, F. A. Rodrigues, G. Travieso, and P. R. V. Boas, "Characterization of complex networks: A survey of measurements," Advances In Physics, vol. 56, p. 167, 2007.
4. X. Yan, P. S. Yu, and J. Han, "Graph indexing: A frequent structure-based approach," in ACM SIGMOD Conference, 2004, pp. 335-346.
5. I. Bordino, D. Donato, A. Gionis, and S. Leonardi, "Mining large networks with subgraph counting," in 8th IEEE International Conference on Data Mining (ICDM), 2008, pp. 737-742.
6. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, "Network motifs: simple building blocks of complex networks." Science, vol. 298, no. 5594, pp. 824-827, 2002.
7. J. Köbler, U. Schöning, and J. Torán, The graph isomorphism problem: its structural complexity. Basel, Switzerland: Birkhauser Verlag, 1993.
8. T. Kloks, D. Kratsch, and H. Müller, "Finding and counting small induced subgraphs efficiently," Information Processing Letters, vol. 74, no. 3-4, pp. 115-121, 2000.
9. M. Kuramochi and G. Karypis, "Finding frequent patterns in a large sparse graph," Data Mining and Knowledge Discovery, vol. 11, no. 3, pp. 243-271, 2005.
10. S. Wernicke, "Efficient detection of network motifs," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 4, pp. 347-359, 2006.
11. J. Grochow and M. Kellis, "Network motif discovery using subgraph enumeration and symmetry-breaking," Research in Computational Molecular Biology, pp. 92-106, 2007.
12. P. Ribeiro and F. Silva, "G-tries: an efficient data structure for discovering network motifs," in ACM Symposium on Applied Computing, 2010.
13. D. L. Eager, E. D. Lazowska, and J. Zahorjan, "A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract)," ACM SIGMETRICS - Performance Evaluation Review, vol. 13, no. 2, pp. 1-3, 1985.
14. F. Schreiber and H. Schwobbermeyer, "Towards motif detection in networks: Frequency concepts and flexible search," in Proceedings of the International Workshop on Network Tools and Applications in Biology (NETTAB04, 2004, pp. 91-102.
15. M. Kuramochi and G. Karypis, "Frequent subgraph discovery," in IEEE International Conference on Data Mining, 2001, p. 313.
16. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering frequent closed itemsets for association rules," in 7th International Conference on Database Theory, 1999, pp. 398-416.
17. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in 20th International Conference on Very Large Data Bases, 1994, pp. 487-499.
18. T. Wang, J. W. Touchman, W. Zhang, E. B. Suh, and G. Xue, "A parallel algorithm for extracting transcription regulatory network motifs," IEEE International Symposium on Bioinformatics and Bioengineering, pp. 193-200, 2005.
19. P. Ribeiro, F. Silva, and L. Lopes, "Parallel calculation of subgraph census in biological networks," in 1st International Conference on Bioinformatics, Valencia, Spain, 2010.
20. M. Schatz, E. Cooper-Balis, and A. Bazinet, "Parallel network motif finding," 2008.
21. R. Ulanowicz, C. Bondavalli, and M. Egnotovich, "Network analysis of trophic dynamics in south florida ecosystem, fy 97: The florida bay ecosystem," Technical Report Ref. No. [UMCES] CBL, pp. 98-123, 1998.
22. V. Batagelj and A. Mrvar, "Pajek datasets," http://vlado.fmf.uni-lj.si/pub/networks/data/, 2006.
23. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks." Nature, vol. 393, no. 6684, pp. 440-442, 1998.
24. M. Newman, "Network data sets," http://www-personal.umich.edu/ ~mejn/netdata/, 2010.
25. M. E. J. Newman, "Finding community structure in networks using the eigenvectors of matrices," Physical Review E, vol. 74, no. 3, p. 036104, 2006.
26. D. Bu, Y. Zhao, L. Cai, H. Xue, X. Zhu, H. Lu, J. Zhang, S. Sun, L. Ling, N. Zhang, G. Li, and R. Chen, "Topological structure analysis of the proteinprotein interaction network in budding yeast," Nucleic Acids Research, vol. 31, no. 9, pp. 2443-2450, 2003.
27. E. D. Howe, "The free on-line dictionary of computing," http://www.foldoc.org/, 2010.
28. P. Sanders, "A detailed analysis of random polling dynamic load balancing," in In International Symposium on Parallel Architectures Algorithms and Networks. IEEE, 1994, pp. 382-389.
29. S. Wuchty, Z. Oltvai, and A. Barabasi, "Evolutionary conservation of motif constituents within the yeast protein interaction network," Nature Genetics, vol. 35, p. 176, 2003.
30. S. S. Shen-Orr, R. Milo, S. Mangan, and U. Alon, "Network motifs in the transcriptional regulation network of escherichia coli," Nature Genetics, vol. 31, no. 1, pp. 64-68, 2002.
31. S. Valverde and R. V. Solé, "Network motifs in computational graphs: A case study in software architecture," Physical Review E, vol. 72, no. 2, 2005.
32. K. Juszczyszyn, P. Kazienko, and K. Musiał, "Local topology of social network based on motif analysis," in 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II, 2008, pp. 97-105.
33. S. Itzkovitz, R. Levitt, N. Kashtan, R. Milo, M. Itzkovitz, and U. Alon, "Coarse-graining and selfdissimilarity of complex networks." Physical Review E, vol. 71, no. 1 Pt 2, 2005.
34. S. Wernicke and F. Rasche, "Fanmod: a tool for fast network motif detection," Bioinformatics, vol. 22, no. 9, pp. 1152-1153, 2006.