Top-K interesting subgraph discovery in information networks

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2014, Pages 820-831

  Gupta, Manish ^a   Gao, Jing ^b   Yan, Xifeng ^c   Cam, Hasan ^d   Han, Jiawei ^e  

^a MICROSOFT   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d U S ARMY RESEARCH LABORATORY   (United States)

^e UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HETEROGENEOUS NETWORKS; INFORMATION SERVICES;

CRITICAL PROBLEMS; INDEX STRUCTURE; INFORMATION NETWORKS; INTERESTINGNESS; LARGE GRAPHS; MATCHING PROBLEMS; SYNTHETIC DATASETS; TOPOLOGY INDICES;

TOPOLOGY;

EID: 84901754968     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2014.6816703     Document Type: Conference Paper

References (32)

1. P. Bogdanov, M. Mongiovì, and A. K. Singh. Mining Heavy Subgraphs in Time-Evolving Networks. In ICDM, pages 81-90, 2011.
2. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM, pages 442-446, 2004.
3. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. TPAMI, 26(10):1367-1372, 2004.
4. R. Fagin, R. Kumar, and D. Sivakumar. Comparing Top-K Lists. In SODA, pages 28-36, 2003.
5. G. Gou and R. Chirkova. Efficient Algorithms for Exact Ranked Twig-pattern Matching over Graphs. In SIGMOD, pages 581-594, 2008.
6. M. Gupta, J. Gao, C. Aggarwal, and J. Han. Outlier Detection for Temporal Data. TKDE, 2014.
7. M. Gupta, J. Gao, and J. Han. Community Distribution Outlier Detection in Heterogeneous Information Networks. In ECML PKDD, pages 557-573, 2013.
8. M. Gupta, J. Gao, Y. Sun, and J. Han. Community Trend Outlier Detection using Soft Temporal Pattern Mining. In ECML PKDD, pages 692-708, 2012.
9. M. Gupta, J. Gao, Y. Sun, and J. Han. Integrating Community Matching and Outlier Detection for Mining Evolutionary Community Outliers. In KDD, pages 859-867, 2012.
10. M. Gupta, J. Gao, X. Yan, H. Cam, and J. Han. On Detecting Association-Based Clique Outliers in Heterogeneous Information Networks. In ASONAM, pages 108-115, 2013.
11. M. Gupta, A. Mallya, S. Roy, J. H. D. Cho, and J. Han. Local Learning for Mining Outlier Subgraphs from Network Datasets. In SDM, 2014.
12. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting Top-K Join Queries in Relational Databases. VLDB Journal, 13(3):207-221, Sep 2004.
13. G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. J. Sci. Comp, 20(1):359-392, Dec 1998.
14. T. Lappas, K. Liu, and E. Terzi. Finding a Team of Experts in Social Networks. In KDD, pages 467-476, 2009.
15. B. D. McKay. Practical Graph Isomorphism. Congressus Numerantium, 30:45-87, 1981.
16. Y. Qi, K. S. Candan, and M. L. Sapino. Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs. In VLDB, pages 507-518, 2007.
17. S. Ranu and A. K. Singh. GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases. In ICDE, pages 844-855, 2009.
18. Y. Sun, Y. Yu, and J. Han. Ranking-based Clustering of Heterogeneous Information Networks with Star Network Schema. In KDD, pages 797-806, 2009.
19. Z. Sun, H. Wang, H. Wang, B. Shao, and J. Li. Efficient Subgraph Matching on Billion Node Graphs. PVLDB, 5(9):788-799, May 2012.
20. Y. Tian, R. C. Mceachin, C. Santos, D. J. States, and J. M. Patel. SAGA: A Subgraph Matching Tool for Biological Graphs. Bioinformatics, 23(2):232-239, Jan 2007.
21. J. R. Ullmann. An Algorithm for Subgraph Isomorphism. J. ACM, 23(1):31-42, Jan 1976.
22. X. Yan, B. He, F. Zhu, and J. Han. Top-K Aggregation Queries over Large Networks. In ICDE, pages 377-380, 2010.
23. X. Yan, P. S. Yu, and J. Han. Substructure Similarity Search in Graph Databases. In SIGMOD, pages 766-777, 2005.
24. J. Yang, W. Su, S. Li, and M. M. Dalkiliç. WIGM: Discovery of Subgraph Patterns in a Large Weighted Graph. In SDM, pages 1083-1094, 2012.
25. Y. Yuan, G. Wang, L. Chen, and H. Wang. Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases. PVLDB, 5(9):800-811, May 2012.
26. X. Zeng, J. Cheng, J. X. Yu, and S. Feng. Top-K Graph Pattern Matching: A Twig Query Approach. In WAIM, pages 284-295, 2012.
27. S. Zhang, J. Yang, and W. Jin. Sapper: Subgraph indexing and approximate matching in large graphs. PVLDB, 3(1):1185-1194, 2010.
28. P. Zhao and J. Han. On Graph Query Optimization in Large Networks. PVLDB, 3(1):340-351, 2010.
29. F. Zhu, Q. Qu, D. Lo, X. Yan, J. Han, and P. S. Yu. Mining Top-K Large Structural Patterns in a Massive Network. PVLDB, 4(11):807-818, 2011.
30. Y. Zhu, L. Qin, J. X. Yu, and H. Cheng. Finding Top-K Similar Graphs in Graph Databases. In EDBT, pages 456-467, 2012.
31. L. Zou, L. Chen, and Y. Lu. Top-K Subgraph Matching Query in a Large Graph. In PIKM, pages 139-146, 2007. ̈
32. L. Zou, L. Chen, and M. T. Ozsu. Distance-join: Pattern Match Query in a Large Graph Database. PVLDB, 2(1):886-897, Aug 2009.