References
- R. Agrawal, T. Imieliński and A. Swami, “Mining association rules between sets of items in large databases,” Proc. of the 12th ACM SIGMOD Int. Conf. on Management of Data, May 1993, pp.207-216. https://doi.org/10.1145/170035.170072
- R. Agrawal, R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases,” Proc. of the 20th Int. Conf. on Very Large Data Bases, Sep., 1994, pp.487-499.
- U. Yun, J.J. Leggett, “WFIM: weighted frequent itemset mining with a weight range and a minimum weight,” Proc. of the Fourth SIAM Int. Conf. on Data Mining, USA, 2005, pp.636-640.
- U. Yun, “Efficient Mining of weighted interesting patterns with a strong weight and/or support affinity,” Information Sciences, vol. 177, 2007, pp.3477-3499. https://doi.org/10.1016/j.ins.2007.03.018
- C.H. Cai, A.W. Fu, C.H. Cheng, W.W. Kwong, “Mining association rules with weighted items,” Proc. of Int. Database Engineering and Applications Symposium, IDEAS 98, Cardiff, Wales, UK, 1998, pp. 68-77. https://doi.org/10.1109/IDEAS.1998.694360
- C.F. Ahmed, S.K. Tanbeer, B.-S. Jeong and Y.-K. Lee, “Mining Weighted Frequent Patterns in Incremental Databases”, Proc. of the 10th Pacific Rim Int. Conf. on Artificial Intelligence, Dec. 2008, pp.933-938.
- F. Tao, “Weighted association rule mining using weighted support and significant framework,” Proc. of the 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, USA, 2003, pp. 661-666. https://doi.org/10.1145/956750.956836
- W. Wang, J. Yang, P.S. Yu, “WAR: weighted association rules for item intensities,” Knowledge Information and Systems, Vol.6, 2004, pp.203-229. https://doi.org/10.1007/s10115-003-0108-7
- J. Han, J. Pei, Y. Yin, R. Mao, “Mining frequent patterns without candidate generation: a frequent-pattern tree approach,” Data Mining and Knowledge Discovery, Vol.8, 2004, pp. 53-87. https://doi.org/10.1023/B:DAMI.0000005258.31418.83
- G. Grahne, and J. Zhu, “Fast Algorithms for frequent itemset mining using FP-Trees,” IEEE Transactions on Knowledge and Data Engineering, Vol.17, No.10, Oct., 2005, pp.1347-1362. https://doi.org/10.1109/TKDE.2005.166
- J. Han, H. Cheng, D. Xin, X. Yan, “Frequent pattern mining: current status and future directions,” Data Mining and Knowledge Discovery, Vol.15, 2007, pp.55-86. https://doi.org/10.1007/s10618-006-0059-1
- A. Metwally, D. Agrawal, A. E.Abbadi, “An Integrated Efficient Solution for Computing Frequent and Top-k Elements in Data Streams,” ACM Transactions on Database Systems (TODS), Vol.31, No.3, 2006, pp.1095-1133. https://doi.org/10.1145/1166074.1166084
- N. Jiang and L. Gruenwald, “Research Issues in Data Stream Association Rule Mining,” SIGMOD Record, Vol. 35, No. 1, Mar., 2006, pp.14-19. https://doi.org/10.1145/1121995.1121998
- C. K. -S. Leung, Q. I. Khan, “DSTree: A Tree structure for the mining of frequent Sets from Data Streams,” Proc. of the 6th Int. Conf. on Data Mining (ICDM’06), 2006, pp.928-932. https://doi.org/10.1109/ICDM.2006.62
- J.-L. Koh, S.-F. Shieh, “An efficient approach for maintaining association rules based on adjusting FP-tree structures,” Proc. of the DASFAA’04, 2004, pp.417-424.
- C. K.-S. Leung Q.I. Khan, Z. Li and T. Hoque, “CanTree: a canonical-order tree for incremental frequent-pattern mining,” Knowledge and Information Systems, Vol.11, No.3, 2007, pp.287-311. https://doi.org/10.1007/s10115-006-0032-8
- U. Yun, “Mining lossless closed frequent patterns with weight constraints,” Knowledge-Based Systems, Vol.210, 2007, pp.86-97.
- S.K. Tanbeer, C.F. Ahmed, B.-S. Jeong and Y.-K. Lee, “CP-tree: A tree structure for single pass frequent pattern mining,” Proc. of the 12th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD’08), 2008. https://doi.org/10.1007/978-3-540-68125-0_108
Cited by
- A Sequential Pattern Mining based on Dynamic Weight in Data Stream vol.2, pp.2, 2013, https://doi.org/10.3745/KTSDE.2013.2.2.137