The Gaston Tool for Frequent Subgraph Mining
Tóm tắt
Từ khóa
Tài liệu tham khảo
T. Asai, H. Arimura, T. Uno, and S. Nakano. Discovering frequent substructures in large unordered trees. Technical Report University of Kyushuu, (216), 2003
Y. Chi, Y. Yang, R.R. Muntz. HybridTreeMiner: An Efficient Algorithm for Mining Frequent Rooted Trees and Free Trees Using Canonical Forms. In Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM), 2004
L. Dehaspe, H. Toivonen, and R.D. King. Finding frequent substructures in chemical compounds. In Proceedings of the SIGKDD, pages 30–36, 1998
Garey, 1979
H. Hofer, C. Borgelt, and M.R. Berthold. Large scale mining of molecular fragments with wildcards. In Advances in Intelligent Data Analysis V, pages 380–389, 2003
J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proceedings of the ICDM, 2003
Inokuchi, 2003, Complete mining of frequent patterns from graphs: Mining graph data, Machine Learning, 50, 321, 10.1023/A:1021726221443
M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proceedings of the ICDM, pages 313–320, 2001
McKay, 1981, Practical graph isomorphism, 30, 45
Nakano, 2003, A simple constant time enumeration algorithm for free trees, IPSJ SIGNotes ALgorithms, 091–002
S. Nijssen and J.N. Kok. Efficient discovery of frequent unordered trees. In First International Workshop on Mining Graphs, Trees and Sequences, pages 55–64, 2003
L.D. Raedt and S. Kramer. The level-wise version space algorithm and its application to molecular fragment finding. In Proceedings of the Seventeenth IJCAI, pages 853–859, 2001
U. Rückert and S. Kramer. Frequent free tree discovery in graph data. In Special Track on Data Mining, ACM Symposium on Applied Computing, pages 564–570, 2004
X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In Proceedings of the SIGKDD, pages 286–295, 2003