Mining Graph Patterns - Frequent Pattern Mining - page 333

36. C. E. Tsourakakis, F. Bonchi, A. Gionis, F. Gullo, and M. A. Tsiarli. Denser than the densest
subgraph: Extracting optimal quasi-cliques with quality guarantees. In KDD , pages 104-112,
2013.
37. K. Tsuda. Entire regularization paths for graph data. In Proc. 2007 Int. Conf. Machine Learning
(ICML'07) , pages 919-926, 2007.
38. N. Vanetik, E. Gudes, and S. E. Shimony. Computing frequent graph patterns from
semistructured data. In Proc. 2002 Int. Conf. on Data Mining (ICDM'02) , pages 458-465,
2002.
39. J. Wang and J. Cheng. Truss decomposition in massive networks. PVLDB , 5(9):812-823, 2012.
40. C. Wang, W. Wang, J. Pei, Y. Zhu, and B. Shi. Scalable mining of large disk-base graph
databases. In Proc. 2004 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases
(KDD'04) , pages 316-325, 2004.
41. N. Wang, J. Zhang, K. L. Tan, A. K. H. Tung. On Triangulation-based Dense Neighborhood
Graphs Discovery. PVLDB , 4(2):58-68, 2010.
42. J. Wang, J. Cheng, and A. Fu. Redundancy-aware maximal cliques Cliques. In KDD , pages
122-130, 2013.
43. T. Washio and H. Motoda. State of the art of graph-based data mining. SIGKDD Explorations ,
5:59-68, 2003.
44. J. Xiang, C. Guo, and A. Aboulnaga. Scalable maximum clique computation using MapReduce.
In ICDE , pages 74-85, 2013.
45. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proc. 2002 Int. Conf.
Data Mining (ICDM'02) , pages 721-724, 2002.
46. X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In Proc. 2003 ACM
SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD'03) , pages 286-295, 2003.
47. X. Yan and J. Han. Discovery of frequent substructures. In D. Cook and L. Holder (eds.),
Mining Graph Data, pages 99-115, John Wiley Sons, 2007.
48. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In Proc.
2004 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'04) , pages 335-346, 2004.
49. X. Yan, X. J. Zhou, and J. Han. Mining closed relational graphs with connectivity constraints.
In Proc. 2005 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'05) , pages
324-333, 2005.
50. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by scalable leap
search. In Proc. 2008 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'08) , pages
433-444, 2008.
51. M. J. Zaki. Efficiently mining frequent trees in a forest. In Proc. 2002 ACM SIGKDD Int. Conf.
Knowledge Discovery in Databases (KDD'02) , pages 71-80, 2002.
52. Y. Zhang and S. Parthasarathy. Extracting analyzing and visualizing triangle k-core motifs
within networks. In ICDE , pages 1049-1060, 2012.
53. Z. Zou, H. Gao, and J. Li. Discovering frequent subgraphs over uncertain graph databases
under probabilistic semantics. In KDD , pages 633-642, 2010.