Maximum Utility Item Sets for Transactional Databases Using GUIDE

Agrawal, 1994, Fast Algorithms for Mining Association Rules, Proc. 20th Int’l Conf. Very Large Data Bases (VLDB), 487 Agrawal, 1995, Mining Sequential Patterns, Proc. 11th Int’l Conf. Data Eng., 3, 10.1109/ICDE.1995.380415 Ahmed, 2009, Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases, IEEE Trans. Knowledge and Data Eng., 21, 1708, 10.1109/TKDE.2009.46 Cai, 1998, Mining Association Rules with Weighted Items, Proc. Int’l Database Eng. and Applications Symp. (IDEAS ‘98), 68, 10.1109/IDEAS.1998.694360 Chan, 2003, Mining High Utility Item sets, Proc. IEEE Third Int’l Conf. Data Mining, 19, 10.1109/ICDM.2003.1250893 Chang, 2011, Mining Weighted Sequential Patterns in a Sequence Database with a Time-Interval Weight, Knowledge-Based Systems, 24, 1, 10.1016/j.knosys.2010.03.003 Chi, 2004, Moment: Maintaining Closed Frequent Item sets over a Stream Sliding Window, in Proc. of IEEE Int’l Conf. on Data Mining, 59 Gaber, 2005, Mining Data Streams: A Review, in SIGMOD Record, 34, 18, 10.1145/1083784.1083789 C. Giannella, J. Han, J. Pei, X. Yan and P. S. Yu, “Mining Frequent Patterns in Data Streams as Multiple Time Granularities,” in H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha (eds.), Next Generation Data Mining, AAAI/MIT, pp. 191-212, 2003. Golab, 2003, Issues in Data Stream Management, in ACM SIGMOD Record, 32, 5, 10.1145/776985.776986 K. Gouda and M. J. Zaki. “Efficiently Mining Maximal Frequent Item sets,” in Proc. of the IEEE International Conference on Data Mining (ICDM), pp. 163-170, San Jose, 2001. Han, 2000, Mining Frequent Patterns without Candidate Generation, In Proc. of ACM-SIGMOD Int’l Conf. on Management of Data (SIGMOD’00), 1, 10.1145/335191.335372 N. Jiang and L. Gruenwald, “CFI-Stream: Mining Closed Frequent Item sets in Data Streams,”in Proc. of the Utility-Based Data Mining Workshop, ACM KDD (UBDM’06), pp. 592-597,USA, August 2006. Jiang, 2006, Research Issues in Data Stream Association Rule Mining, in ACM SIGMOD Record, 35, 14, 10.1145/1121995.1121998 C. Jin, W. Qian, C. Sha, J.X. Yu and A. Zhou, “Dynamically Maintaining Frequent Items Over a Data Stream,” in Proc. of CIKM’03, pp. 287-294, Nov. 2003. Lee, 2005, Finding Maximal Frequent Item sets over Online Data Streams Adaptively, in Proc. of Fifth IEEE Int’l Conf. on Data Mining (ICDM’05) C. K.-S. Leung and Q. I. Khan, “DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams,” in Proc. of the 6th IEEE Int’l Conf. on Data Mining (ICDM’06), pp. 928-932. C. K.-S. Leung and F. Jiang, “Frequent Item set Mining of Uncertain Data Streams using the Damped Window Model,” in Proc. of the 26th Annual ACM Symposium on Applied Computing, pp. 950-955, Taichung, Taiwan, March, 2011.