Tài liệu tham khảo |
Loại |
Chi tiết |
[1] Agrawal, R., Imielinksi, T., Swami, A. (1993), “Mining association rules between sets of items in large database”, The ACM SIGMOD conference, pp. 207-216 |
Sách, tạp chí |
Tiêu đề: |
Mining association rules between sets of items in large database”, "The ACM SIGMOD conference |
Tác giả: |
Agrawal, R., Imielinksi, T., Swami, A |
Năm: |
1993 |
|
[2] Agrawal, R., Srikant, R. (1994), “Fast algorithm for mining association rules”, The international conference on very large data bases, pp. 487-499 |
Sách, tạp chí |
Tiêu đề: |
Fast algorithm for mining association rules”, "The international conference on very large data bases |
Tác giả: |
Agrawal, R., Srikant, R |
Năm: |
1994 |
|
[3] Agrawal, R., Srikant, R. (1995), “Mining sequential patterns”, The eleventh IEEE international conference on data engineering, pp. 3-14 |
Sách, tạp chí |
Tiêu đề: |
Mining sequential patterns”, "The eleventh IEEE international conference on data engineering |
Tác giả: |
Agrawal, R., Srikant, R |
Năm: |
1995 |
|
[4] Agrawal, R., Manila, H., Srikant, R., Toivonen, H. and Verkamo. A.L. (1996), “Fast discovery of association rules”, Advances in Knowledge Discovery and Data Minning. MIT Press |
Sách, tạp chí |
Tiêu đề: |
Fast discovery of association rules”, "Advances in Knowledge Discovery and Data Minning |
Tác giả: |
Agrawal, R., Manila, H., Srikant, R., Toivonen, H. and Verkamo. A.L |
Năm: |
1996 |
|
[5] Bodon, F., Ronyai, L. (2003), “Trie: An Alternative data structure for data mining algorithms”, Mathematical and Computer Modeling, 38(7-9), pp.739-751 |
Sách, tạp chí |
Tiêu đề: |
Trie: An Alternative data structure for data mining algorithms”, "Mathematical and Computer Modeling |
Tác giả: |
Bodon, F., Ronyai, L |
Năm: |
2003 |
|
[6] Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y. (1996), “Maintenance of discovered association rules in large databases: An incremental updating approach”, The twelfth IEEE international conference on data engineering, pp. 106-114 |
Sách, tạp chí |
Tiêu đề: |
Maintenance of discovered association rules in large databases: An incremental updating approach”, "The twelfth IEEE international conference on data engineering |
Tác giả: |
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y |
Năm: |
1996 |
|
[7] Dunham, M.H., Xiao, Y., Gruenwald, L., Hossain, Z. (2003), “A survey of Assocition rules”, Department of Computer Science and Engineering Southerm Methodist University Dallas |
Sách, tạp chí |
Tiêu đề: |
A survey of Assocition rules |
Tác giả: |
Dunham, M.H., Xiao, Y., Gruenwald, L., Hossain, Z |
Năm: |
2003 |
|
[8] Han, J., Fu, Y. (1995), “Discovery of multiple-level association rules from large database”, The Twenty-first international conference on very large databases, pp. 420-431 |
Sách, tạp chí |
Tiêu đề: |
Discovery of multiple-level association rules from large database”, "The Twenty-first international conference on very large databases |
Tác giả: |
Han, J., Fu, Y |
Năm: |
1995 |
|
[9] Han, J., Pei, J., Yin, Y. (2000), “Mining frequent patterns without candidate generation”, The 2000 ACM SIGMOD international conference on management of data, pp. 1-12 |
Sách, tạp chí |
Tiêu đề: |
Mining frequent patterns without candidate generation”, "The 2000 ACM SIGMOD international conference on management of data |
Tác giả: |
Han, J., Pei, J., Yin, Y |
Năm: |
2000 |
|
[10] Hong, T.P., Wang, C.Y., Tao, Y.H. (2001), “A new incremental data mining algorithm using pre-large itemsets”, Intelligent Data Analysis, 5(2), pp.111-129 |
Sách, tạp chí |
Tiêu đề: |
A new incremental data mining algorithm using pre-large itemsets”, "Intelligent Data Analysis |
Tác giả: |
Hong, T.P., Wang, C.Y., Tao, Y.H |
Năm: |
2001 |
|
[11] Hong, T.P., Lin, C.W., Wu, Y.L. (2008), “Incrementally fast updated frequent pattern trees”, Expert Systems with Applications, 34(4), pp. 2424-2435 |
Sách, tạp chí |
Tiêu đề: |
Incrementally fast updated frequent pattern trees”," Expert Systems with Applications |
Tác giả: |
Hong, T.P., Lin, C.W., Wu, Y.L |
Năm: |
2008 |
|
[12] Hong, T.P., Lin, C.W., Wu, Y.L. (2009), “Maintenance of fast updated frequent pattern trees for record deletion”, Computational Statistics and Data Analysis, 53(7), pp. 2485-2499 |
Sách, tạp chí |
Tiêu đề: |
Maintenance of fast updated frequent pattern trees for record deletion”, "Computational Statistics and Data Analysis |
Tác giả: |
Hong, T.P., Lin, C.W., Wu, Y.L |
Năm: |
2009 |
|
[13] Hong, T.P., Wang, C.Y. (2010), “An efficient and effective association-rule maintenance algorithm for record modification”, Expert Systems with Applications, 37(1), pp. 618-626 |
Sách, tạp chí |
Tiêu đề: |
An efficient and effective association-rule maintenance algorithm for record modification”, "Expert Systems with Applications |
Tác giả: |
Hong, T.P., Wang, C.Y |
Năm: |
2010 |
|
[14] Hong, T.P., Wang, C.Y., Tseng, S.S. (2011), “An incremental mining algorithm for maintaining sequential patterns using pre-large sequences”, In Expert Systems with Applications, 38(6), pp. 7051-7058 (2011) |
Sách, tạp chí |
Tiêu đề: |
An incremental mining algorithm for maintaining sequential patterns using pre-large sequences”, In "Expert Systems with Applications |
Tác giả: |
Hong, T.P., Wang, C.Y., Tseng, S.S |
Năm: |
2011 |
|
[15] Koh, J.L., Shied, S.F. (2004), “An efficient approach for maintaining association rules based on adjusting FP-tree structures”, In DASFAA’04, pp. 417-424 [16] Knuth, D.E. (1968), “The Art of Computer Programming”, Vol.3, Addison-Wesley |
Sách, tạp chí |
Tiêu đề: |
An efficient approach for maintaining association rules based on adjusting FP-tree structures”, In "DASFAA’04", pp. 417-424 [16] Knuth, D.E. (1968), “The Art of Computer Programming”, Vol.3, "Addison- |
Tác giả: |
Koh, J.L., Shied, S.F. (2004), “An efficient approach for maintaining association rules based on adjusting FP-tree structures”, In DASFAA’04, pp. 417-424 [16] Knuth, D.E |
Năm: |
1968 |
|
[19] Mannila, H., Toivonen, H., Verkamo, A.I. (1994), “Efficient algorithm for discovering association rules”, The AAAI workshop on knowledge discovery in databases, pp. 181-192 |
Sách, tạp chí |
Tiêu đề: |
Efficient algorithm for discovering association rules”, "The AAAI workshop on knowledge discovery in databases |
Tác giả: |
Mannila, H., Toivonen, H., Verkamo, A.I |
Năm: |
1994 |
|
[20] Srikant, R., Agrawal, R. (1995), “Mining generalized association rules”, The twenty first international conference on very large data bases, pp. 407- 419 |
Sách, tạp chí |
Tiêu đề: |
Mining generalized association rules”, "The twenty first international conference on very large data bases |
Tác giả: |
Srikant, R., Agrawal, R |
Năm: |
1995 |
|
[21] Thomas, S., Bodagala, S., Alsabti, K., Ranka, S. (1997), “An efficient algorithm for the incremental updation of association rules in large databases”, SIGKDD’97, pp. 263-266 |
Sách, tạp chí |
Tiêu đề: |
An efficient algorithm for the incremental updation of association rules in large databases”, "SIGKDD’97 |
Tác giả: |
Thomas, S., Bodagala, S., Alsabti, K., Ranka, S |
Năm: |
1997 |
|
[22] Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W. (1997), “New algorithms for fast discovery of association rules”, 3rd International Conference on Knowledge Discovery and Data Mining (KDD) |
Sách, tạp chí |
Tiêu đề: |
New algorithms for fast discovery of association rules” |
Tác giả: |
Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W |
Năm: |
1997 |
|
[23] Zaki, M.J., Hsiao, C.J. (2005), “Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure”, IEEE Transactions on Knowledge and Data Engineering |
Sách, tạp chí |
Tiêu đề: |
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure” |
Tác giả: |
Zaki, M.J., Hsiao, C.J |
Năm: |
2005 |
|