Mining attributestructure correlated patterns in large attributed graphs

Proceedings of the VLDB Endowment

Volumn 5, Issue 5, 2012, Pages 466-477

  Silva, Arlei ^a   Meira, Wagner ^a   Zaki, Mohammed J ^b  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTED GRAPHS; CITATION NETWORKS; DENSE SUB-GRAPHS; FREQUENT ITEMSET; INTERESTINGNESS; PRUNING STRATEGY; STATISTICAL SIGNIFICANCE; STRUCTURAL CORRELATION;

DATA MINING;

EID: 84863729772     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2140436.2140443     Document Type: Article

References (22)

1. R. Agrawal, T. Imieliński, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD, pages 207-216, 1993.
2. A. Anagnostopoulos, R. Kumar, and M. Mahdian. In uence and correlation in social networks. In KDD, pages 7-15, 2008.
3. S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5):75-174, 2010.
4. R. Ge, M. Ester, B. J. Gao, Z. Hu, B. Bhattacharya, and B. Ben-Moshe. Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications. ACM Trans. Knowl. Discov. Data, 2(2):1-35, 2008.
5. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, pages 721-732, 2005.
6. M. Girvan and M. Newman. Community structure in social and biological networks. In PNAS, pages 7821-7826, 2002.
7. Z. Guan, J. Wu, Q. Zhang, A. Singh, and X. Yan. Assessing and ranking structural correlation in graphs. In SIGMOD, pages 937-948, 2011.
8. D. Jiang and J. Pei. Mining frequent cross-graph quasi-cliques. ACM Trans. Knowl. Discov. Data, 2(4):1-42, 2009.
9. A. Khan, X. Yan, and K.-L. Wu. Towards proximity pattern mining in large graphs. In SIGMOD, pages 867-878, 2010.
10. G. Liu and L. Wong. Effective pruning techniques for mining quasi-cliques. In PKDD, pages 33-49, 2008.
11. M. McPherson, L. Smith-Lovin, and J. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27(1):415-444, 2001.
12. F. Moser, R. Colak, A. Rafiey, and M. Ester. Mining cohesive patterns from graphs with feature vectors. In SDM, pages 593-604, 2009.
13. P.-N. Mougel, M. Plantevit, C. Rigotti, O. Gandrillon, and J.-F. Boulicaut. Constraint-Based Mining of Sets of Cliques Sharing Vertex Properties. In ACNE, pages 48-62, 2010.
14. J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasi-cliques. In KDD, pages 228-238, 2005.
15. J. Sese, M. Seki, and M. Fukuzaki. Mining networks with shared items. In CIKM, pages 1681-1684, 2010.
16. A. Silva, W. Meira, Jr., and M. J. Zaki. Structural correlation pattern mining for large graphs. In MLG, pages 119-126, 2010.
17. L. Valiant. The complexity of computing the permanent. Theoretical computer science, 8(2):189-201, 1979.
18. J. Wang, Z. Zeng, and L. Zhou. Clan: An algorithm for mining closed cliques from large dense graph databases. In ICDE, pages 73-82, 2006.
19. M. J. Zaki. Scalable algorithms for association mining. IEEE Trans. on Knowl. and Data Eng., 12:372-390, 2000.
20. Z. Zeng, J. Wang, L. Zhou, and G. Karypis. Coherent closed quasi-clique discovery from large dense graph databases. In KDD, pages 797-802, 2006.
21. Z. Zeng, J. Wang, L. Zhou, and G. Karypis. Out-of-core coherent closed quasi-clique mining from large dense graph databases. ACM Trans. Database Syst., 32, June 2007.
22. Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. PVLDB, 2(1):718-729, 2009.