1 |
L.T. Thomas, S.R. Valluri, and K. Karlapalem, "MARGIN: Maximal frequent subgraph mining", Transactions on Knowledge Discovery from Data. vol. 4, no. 3, pp. 10:1-42, 2010.
|
2 |
X. Yan and J. Han, "gSpan: graph-based substructure pattern mining", in Proc. of the 2002 IEEE Int'l Conf. on Data Mining, pp. 721-724, 2002.
|
3 |
M. Seno, and G. Karypis, "Finding frequent patterns using length-decreasing support constraints", Data Mining and Knowledge Discovery, vol. 10, no. 3, pp. 197-228, 2005.
DOI
|
4 |
R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," in Proc. of the 20th Int'l Conf. on Very Large Data Bases (VLDB), pp. 487-499, 1994.
|
5 |
J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," in Proc. of the 2000 ACM SIGMOD Int'l Conf. on Management of Data, pp. 1-12, 2000.
|
6 |
A. Bifet, G. Holmes, B. Pfahringer, and R. Gavalda, "Mining Frequent Closed Graphs on Evolving Data Streams", in Proc. of the 17th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 591-599, 2011.
|
7 |
A.Y.R. Gonzalez, J.F.M. Trinidad, J.A. Carrasco-Ochoa, and J. Ruiz-Shulcloper, "Mining frequent patterns and association rules using similarities," Expert Systems with Applications, Vol. 40, No. 17, pp. 6823-6836, 2013.
DOI
ScienceOn
|
8 |
S. Gunnemann and T. Seidl, "Subgraph Mining on Directed and Weighted Graphs", in Pro. of the 14th Pacific-Asia Conf. on Knowledge Discovery and Data Mining, pp. 133-146, 2010.
|
9 |
G. Lee and U. Yun, "Frequent Graph Pattern Mining with Length-Decreasing Support Constraints", Multimedia and Ubiquitous Engineering, pp. 185-192, 2013.
|
10 |
J. Huan, W. Wang, and J. Prins, "Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism", in Proc. of the 3rd IEEE International Conf. on Data Mining, pp. 549-552, 2003.
|
11 |
Y. Jia, J. Zhang, and J. Huan, "An efficient graph-mining method for complicated and noisy data with real-world applications", Knowledge Information Systems, vol. 28, no. 2, pp 423-447, 2011.
DOI
|
12 |
C. Jiang, F. Coenen, and M. Zito, "Frequent Sub-graph Mining on Edge Weighted Graphs" in Proc. of the 12th int'l conf. on Data warehousing and knowledge discovery, pp. 77-88, 2010.
|
13 |
S. Nijssen and J.N. Kok, "The Gaston Tool for Frequent Subgraph Mining", Electronic Notes in Theoretical Computer Science, vol. 127, no. 1 pp. 77-87, 2005.
DOI
|