| Tài liệu tham khảo |
Loại |
Chi tiết |
| [2] S. Nijssen, J.N. Kok, A quickstart in frequent structure mining can make a difference, in: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’04, ACM, 2004, pp. 647–652 |
Sách, tạp chí |
| Tiêu đề: |
A quickstart in frequent structure mining can make a difference |
| Tác giả: |
S. Nijssen, J.N. Kok |
| Nhà XB: |
ACM |
| Năm: |
2004 |
|
| [4] A. Gago-Alonso, J. Medina-Pagola, J. Carrasco-Ochoa, J. Martínez-Trinidad, Mining frequent connected subgraphs reducing the number of candidates, in: W.Daelemans, B. Goethals, K. Morik (Eds.), Machine Learning and Knowledge Discovery in Databases, Lecture Notes in Computer Science, vol. 5211, Springer, Berlin/Heidelberg, 2008, pp. 365–376 |
Sách, tạp chí |
| Tiêu đề: |
Machine Learning and Knowledge Discovery in Databases |
| Tác giả: |
A. Gago-Alonso, J. Medina-Pagola, J. Carrasco-Ochoa, J. Martínez-Trinidad |
| Nhà XB: |
Springer |
| Năm: |
2008 |
|
| [6] J. Huan, W. Wang, J. Prins, J. Yang, Spin: mining maximal frequent subgraphs from graph databases, in: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’04, ACM, 2004, pp. 581–586 |
Sách, tạp chí |
| Tiêu đề: |
Spin: mining maximal frequent subgraphs from graph databases |
| Tác giả: |
J. Huan, W. Wang, J. Prins, J. Yang |
| Nhà XB: |
ACM |
| Năm: |
2004 |
|
| [8] M. Al-Hasan, V. Chaoji, S. Salem, J. Besson, M.J. Zaki, Origami: mining representative orthogonal graph patterns, in: ICDM, IEEE Computer Society, 2007, pp |
Sách, tạp chí |
| Tiêu đề: |
Origami: mining representative orthogonal graph patterns |
| Tác giả: |
M. Al-Hasan, V. Chaoji, S. Salem, J. Besson, M.J. Zaki |
| Nhà XB: |
IEEE Computer Society |
| Năm: |
2007 |
|
| [10] F. Zhu, Q. Qu, D. Lo, X. Yan, J. Han, P.S. Yu, Mining top-k large structural patterns in a massive network, PVLDB 4 (2011) 807–818 |
Sách, tạp chí |
| Tiêu đề: |
Mining top-k large structural patterns in a massive network |
| Tác giả: |
F. Zhu, Q. Qu, D. Lo, X. Yan, J. Han, P.S. Yu |
| Nhà XB: |
PVLDB |
| Năm: |
2011 |
|
| [11] Y. Jia, J. Zhang, J. Huan, An efficient graph-mining method for complicated and noisy data with real-world applications, Knowl. Inf. Syst. 28 (2011) 423–447 |
Sách, tạp chí |
| Tiêu đề: |
An efficient graph-mining method for complicated and noisy data with real-world applications |
| Tác giả: |
Y. Jia, J. Zhang, J. Huan |
| Nhà XB: |
Knowl. Inf. Syst. |
| Năm: |
2011 |
|
| [12] C. Chen, X. Yan, F. Zhu, J. Han, gApprox: mining frequent approximate patterns from a massive network, in: ICDM, IEEE Computer Society, 2007, pp. 445–450 |
Sách, tạp chí |
| Tiêu đề: |
gApprox: mining frequent approximate patterns from a massive network |
| Tác giả: |
C. Chen, X. Yan, F. Zhu, J. Han |
| Nhà XB: |
IEEE Computer Society |
| Năm: |
2007 |
|
| [14] L.T. Thomas, S.R. Valluri, K. Karlapalem, Margin: maximal frequent subgraph mining, ACM Trans. Knowl. Discov. Data 4 (2010) 10:1–10:42 |
Sách, tạp chí |
| Tiêu đề: |
Margin: maximal frequent subgraph mining |
| Tác giả: |
L.T. Thomas, S.R. Valluri, K. Karlapalem |
| Nhà XB: |
ACM Trans. Knowl. Discov. Data |
| Năm: |
2010 |
|
| [15] X. Chen, C. Zhang, F. Liu, J. Guo, Algorithm research of top-down mining maximal frequent subgraph based on tree structure, in: P. Snac, M. Ott, A.Seneviratne (Eds.), Wireless Communications and Applications, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol. 72, Springer, Berlin Heidelberg, 2012, pp. 401–411 |
Sách, tạp chí |
| Tiêu đề: |
Wireless Communications and Applications |
| Tác giả: |
X. Chen, C. Zhang, F. Liu, J. Guo |
| Nhà XB: |
Springer |
| Năm: |
2012 |
|
| [16] M. Kuramochi, G. Karypis, Finding frequent patterns in a large sparse graph, Data Min. Knowl. Discov. 11 (2005) 243–271 |
Sách, tạp chí |
| Tiêu đề: |
Finding frequent patterns in a large sparse graph |
| Tác giả: |
M. Kuramochi, G. Karypis |
| Nhà XB: |
Data Mining and Knowledge Discovery |
| Năm: |
2005 |
|
| [17] B. Bringmann, S. Nijssen, What is frequent in a single graph?, in: T. Washio, E.Suzuki, K. Ting, A. Inokuchi (Eds.), Advances in Knowledge Discovery and Data |
Sách, tạp chí |
| Tiêu đề: |
What is frequent in a single graph |
| Tác giả: |
B. Bringmann, S. Nijssen |
| Nhà XB: |
T. Washio |
|
| [18] M. Flores-Garrido, J.A. Carrasco-Ochoa, J.F. Martínez-Trinidad, Mining maximal frequent patterns in a single graph using inexact matching, Instituto Nacional de Astrofísica, Óptica y Electrónica, Tonantzintla, Puebla, Mexico |
Sách, tạp chí |
| Tiêu đề: |
Mining maximal frequent patterns in a single graph using inexact matching |
| Tác giả: |
M. Flores-Garrido, J.A. Carrasco-Ochoa, J.F. Martínez-Trinidad |
| Nhà XB: |
Instituto Nacional de Astrofísica, Óptica y Electrónica |
|
| [20] M. Kuramochi, G. Karypis, Finding frequent patterns in a large sparse graph, Data Min. Knowl. Discov. 11 (2005) 243–271 |
Sách, tạp chí |
| Tiêu đề: |
Finding frequent patterns in a large sparse graph |
| Tác giả: |
M. Kuramochi, G. Karypis |
| Nhà XB: |
Data Mining and Knowledge Discovery |
| Năm: |
2005 |
|
| [22] B. Bringmann, S. Nijssen, What is frequent in a single graph?, in: T. Washio, E. Suzuki, K. Ting, A. Inokuchi (Eds.), Advances in Knowledge Discovery and Data Mining, Lecture Notes in Computer Science, vol. 5012, Springer, Berlin/ |
Sách, tạp chí |
| Tiêu đề: |
What is frequent in a single graph |
| Tác giả: |
B. Bringmann, S. Nijssen |
| Nhà XB: |
Springer |
|
| [1] S. Ranu, A. Singh, Graphsig: a scalable approach to mining significant subgraphs in large graph databases, in: IEEE 25th International Conference on Data Engineering, 2009, pp. 844–855 |
Khác |
|
| [3] X. Yan, J. Han, gspan: graph-based substructure pattern mining, in: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM’02, 2002 |
Khác |
|
| [5] H. Cheng, X. Yan, J. Han, Mining graph patterns, in: C. Aggarwal, H. Wang (Eds.), Managing and Mining Graph Data, Advances in Database Systems, vol. 40, Springer, 2010, pp. 365–392 |
Khác |
|
| [7] J. Han, H. Cheng, D. Xin, X. Yan, Frequent pattern mining: current status and future directions, Data Min. Knowl. Discov. 15 (2007) 55–86 |
Khác |
|
| [9] W. Fan, K. Zhang, H. Cheng, J. Gao, X. Yan, J. Han, P. Yu, O. Verscheure, Direct mining of discriminative and essential frequent patterns via model-based search tree, in: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008, pp. 230–238 |
Khác |
|
| [13] A. Sanfeliu, K.S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Syst. Man Cybern. 13 (1983) 353–363 |
Khác |
|
